261
Views
48
CrossRef citations to date
0
Altmetric
Article

SimILS: a simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization

, &
Pages 69-77 | Received 26 Mar 2014, Accepted 07 Aug 2014, Published online: 19 Dec 2017

References

  • Altiparmak F, Dengiz B and Bulgak AA (2002). Optimization of buffer sizes in assembly systems using intelligent techniques. In: Yucesan E, Chen C-H, Snowdon JL and Chames JM (eds). Proceedings of the 2002 Winter Simulation Conference. IEEE Press: San Diego, CA, 8–11 December, pp 1157–1162.
  • April J, Glover F, Kelly JP and Laguna M (2003). Simulation-based optimization: Practical introduction to simulation optimization. In: Chick S, Sánchez PJ, Ferrin D and Morrice DJ (eds). Proceedings of the 2003 Winter Simulation Conference. IEEE Press: New Orleans, LA, 7–10 December, pp 71–78.
  • Arreola-RisaAGiménez-GarcíaVMMartínez-ParraJLOptimizing stochastic production-inventory systems: A heuristic based on simulation and regression analysisEuropean Journal of Operational Research2011213110711810.1016/j.ejor.2011.02.031
  • BakerKRAltheimerDHeuristic solution methods for the stochastic flow shop problemEuropean Journal of Operational Research2012216117217710.1016/j.ejor.2011.07.021
  • Balasubramanian H, Banerjee R, Gregg M and Denton BT (2007). Improving primary care access using simulation optimization. In: Henderson SG, Biller B, Hsieh M-H, Shortle J, Tew JD and Barton RR (eds). Proceedings of the 2007 Winter Simulation Conference. IEEE Press: Washington DC, 9–12 December, pp 1494–1500.
  • BanerjeeBPSingle facility sequencing with random execution timesOperations Research196513335836410.1287/opre.13.3.358
  • BeraldiPRuszczyńskiAThe probabilistic set-covering problemOperations Research200250695696710.1287/opre.50.6.956.345
  • BertsimasDJA vehicle routing problem with stochastic demandOperations Research199240357458510.1287/opre.40.3.574
  • BianchiLHybrid metaheuristics for the vehicle routing problem with stochastic demandsJournal of Mathematical Modelling and Algorithms2006519111010.1007/s10852-005-9033-y
  • BianchiLDorigoMGambardellaLMGutjahrWJA survey on metaheuristics for stochastic combinatorial optimizationNatural Computing20098223928710.1007/s11047-008-9098-4
  • BurkeEIterated local search vs. hyper-heuristics: Towards general-purpose search algorithmsIEEE Congress on Evolutionary Computation201030733080
  • CabreraGJuanAALázaroDMarquèsJMProskurniaIA simulation-optimization approach to deploy internet services in large-scale systems with user-provided resourcesSimulation: Transactions of the Society for Modeling and Simulation International201490664465910.1177/0037549714531350
  • ChiangW-CRussellRXuXZepedaDA simulation/metaheuristic approach to newspaper production and distribution supply chain problemsInternational Journal of Production Economics2009121275276710.1016/j.ijpe.2009.03.001
  • ChristiansenCHLysgaardJA branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demandsOperations Research Letters200735677378110.1016/j.orl.2006.12.009
  • ChristiansenCHLysgaardJWøhlkSA branch-and-price algorithm for the capacitated arc routing problem with stochastic demandsOperations Research Letters200937639239810.1016/j.orl.2009.05.008
  • CordeauJFGendreauMLaporteGPotvinJ-YSemetFA guide to vehicle routing heuristicsJournal of the Operational Research Society200253551252210.1057/palgrave.jors.2601319
  • DelévacqADelislePKrajeckiMParallel GPU implementation of iterated local search for the travelling salesman problemLearning and Intelligent Optimization2012372377
  • Dengiz B and Alabas C (2000). Simulation optimization using tabu search. In: Joines JA, Barton RR, Kang K and Fishwick PA (eds). Proceedings of the 2000 Winter Simulation Conference. IEEE Press: Orlando, FL, 10–13 December, pp 805–810.
  • DongXChenPHuangHNowakMA multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow timeComputers and Operations Research201340262763210.1016/j.cor.2012.08.021
  • Dorigo M (1992). Optimization, learning and natural algorithms (in Italian). PhD Thesis, Politecnico di Milano, Italy.
  • FedergruenAZipkinPA combined vehicle routing and inventory allocation problemOperations Research19843251019103710.1287/opre.32.5.1019
  • Fleury G, Lacomme P, Prins C and Ramdane-Chérif W (2002). Robustness evaluation of solutions for the capacitated arc routing problem. In: Conference, AI Simulation and Planning in High Autonomy Systems, Lisboa, Portugal, pp 290–295.
  • FleuryGLacommePPrinsCRamdane-ChérifWImproving robustness of solutions to arc routing problemsJournal of the Operational Research Society200556552653810.1057/palgrave.jors.2601822
  • Fu MC et al (2000). Integrating optimization and simulation: Research and practice. In: Joines JA, Barton RR, Kang K and Fishwick PA (eds). Proceedings of the 2000 Winter Simulation Conference. IEEE Press: Orlando, FL, 10–13 December, pp 610–616.
  • GendreauMLaporteGSéguinRAn exact algorithm for the vehicle routing problem with stochastic demands and customersTransportation Science199529214315510.1287/trsc.29.2.143
  • GendreauMLaporteGSéguinRA tabu search heuristic for the vehicle routing problem with stochastic demands and customersOperations Research199644346947710.1287/opre.44.3.469
  • GendreauMLaporteGSéguinRStochastic vehicle routingEuropean Journal of Operational Research199688131210.1016/0377-2217(95)00050-X
  • GloverFHeuristics for integer programming using surrogate constraintsDecision Sciences19778115616610.1111/j.1540-5915.1977.tb01074.x
  • GloverFFuture paths for integer programming and links to artificial intelligenceComputers and Operations Research198613553354910.1016/0305-0548(86)90048-1
  • Glover F, Kelly JP and Laguna M (1996). New advances and applications of combining simulation and optimization. In: Charnes JM, Morrice DJ, Brunner DT and Swain JJ (eds). Proceedings of the 1996 Winter Simulation Conference. IEEE Press: Coronado, CA, 8–11 December, pp 144–152.
  • González S, Riera D, Juan AA, Elizondo MG and Fonseca P (2012). Sim-randsharp: A hybrid algorithm for solving the arc routing problem with stochastic demands. In: Laroque C, Himmelspach J, Pasupathy R, Rose O and Uhrmacher AM (eds). Proceedings of the 2012 Winter Simulation Conference. IEEE Press: Berlin, Germany, 9–12 December, pp 1–11.
  • GutjahrWS-ACO: An ant-based approach to combinatorial optimization under uncertaintyAnt Colony Optimization and Swarm Intelligence2004238249
  • GutjahrWJStraussCWagnerEA stochastic branch-and-bound approach to activity crashing in project managementINFORMS Journal on Computing200012212513510.1287/ijoc.12.2.125.11894
  • HollandJHGenetic algorithms and the optimal allocation of trialsSIAM Journal on Computing1973228810510.1137/0202009
  • IsmailZSolving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu searchJournal of Mathematics and Statistics20084316116710.3844/jmssp.2008.161.167
  • Jaillet P (1985). Probabilistic traveling salesman problems. PhD Thesis, Operations Research Center, MIT, Cambridge, MA.
  • JuanAABarriosBBValladaERieraDJorbaJSIM-ESP: A simheuristic algorithm for solving the permutation flow-shop problem with stochastic processing timesSimulation Modelling Practice and Theory20144610111710.1016/j.simpat.2014.02.005
  • JuanAAFaulinJGrasmanSERieraDMarullJMendezCUsing safety stocks and simulation to solve the vehicle routing problem with stochastic demandsTransportation Research Part C: Emerging Technologies201119575176510.1016/j.trc.2010.09.007
  • JuanAAFaulinJJorbaJCáceres-CruzJMarquesJUsing parallel and distributed computing for solving real-time vehicle routing problems with stochastic demandsAnnals of Operations Research20132071436510.1007/s10479-011-0918-z
  • JuanAAGrasmanSECaceres-CruzJBektaşTA simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outsSimulation Modelling Practice and Theory201446405210.1016/j.simpat.2013.11.008
  • JuanAALourençoHRMateoMLuoRCastellaQUsing iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issuesInternational Transactions in Operational Research201421110312610.1111/itor.12028
  • KallPWallaceSWStochastic Programming1994
  • Kennedy J and Eberhart R (1995). Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks. Perth, Australia, pp 1942–1948.
  • KirkpatrickSGelattCDVecchiMPOptimization by simulated annealingScience1983220459867168010.1126/science.220.4598.671
  • KiseHShiomiAUnoMChaoDAn efficient algorithm for a chance-constrained scheduling problemJournal of the Operations Research Society of Japan1982252193203
  • KleinbergJRabaniYTardosÉAllocating bandwidth for bursty connectionsSIAM Journal on Computing200030119121710.1137/S0097539797329142
  • Konak A and Kulturel-Konak S (2005). Simulation optimization using tabu search: An emperical study. In: Kuhl ME, Steiger NM, Armstrong FB and Joines JA (eds). Proceedings of the 2005 Winter Simulation Conference. IEEE Press: Orlando, FL, 4–7 December, pp 2686–2692.
  • LaporteGLouveauxFVMercureHA priori optimization of the probabilistic traveling salesman problemOperations Research199442354354910.1287/opre.42.3.543
  • Laroque C, Klaas A, Fischer J-H and Kuntze M (2012). Fast converging, automated experiment runs for material flow simulations using distributed computing and combined metaheuristics. In: Laroque C, Himmelspach J, Pasupathy R, Rose O and Uhrmacher AM (eds). Proceedings of the 2012 Winter Simulation Conference. IEEE Press: Berlin, Germany, 9–12 December, pp 102–111.
  • LegatoPMazzaRMTrunfioRSimulation-based optimization for discharge/loading operations at a maritime container terminalOR Spectrum201032354356710.1007/s00291-010-0207-2
  • LeiHLaporteGGuoBThe capacitated vehicle routing problem with stochastic demands and time windowsComputers and Operations Research201138121775178310.1016/j.cor.2011.02.007
  • LourençoHRMartinOCStützleTIterated local searchHandbook of Metaheuristics2003321353
  • LourençoHRMartinOCStützleTIterated local search: Framework and applicationsHandbook of Metaheuristics2010363397
  • MakinoTOn a scheduling problemJournal of the Operations Research Society Japan196583244
  • MarinakisYIordanidouG-RMarinakiMParticle swarm optimization for the vehicle routing problem with stochastic demandsApplied Soft Computing20131341693170410.1016/j.asoc.2013.01.007
  • MoghaddamBFRuizRSadjadiSJVehicle routing problem with uncertain demands: An advanced particle swarm algorithmComputers and Industrial Engineering201262130631710.1016/j.cie.2011.10.001
  • NawazMEnscoreJEEHamIA heuristic algorithm for m-machine, n-job flow shop sequencing problemInternational Journal of Management Science19831119195
  • NguyenV-PPrinsCProdhonCA multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problemEngineering Applications of Artificial Intelligence2012251567110.1016/j.engappai.2011.09.012
  • PennaPHVSubramanianAOchiLSAn iterated local search heuristic for the heterogeneous fleet vehicle routing problemJournal of Heuristics201119220123210.1007/s10732-011-9186-y
  • PinedoMOptimal policies in stochastic shop schedulingAnnals of Operations Research19841330532910.1007/BF01874395
  • RossKWTsangDHKThe stochastic knapsack problemIEEE Transactions on Communications198937774074710.1109/26.31166
  • RothkopfMHScheduling with random service timesManagement Science196612970771310.1287/mnsc.12.9.707
  • ShanmugamGGanesanPVanathiPTMeta heuristic algorithms for vehicle routing problem with stochastic demandsJournal of Computer Science20117453354210.3844/jcssp.2011.533.542
  • ShawPUsing constraint programming and local search methods to solve vehicle routing problemsPrinciples and Practice of Constraint Programming—CP981998417431
  • ShenZOrdóñezFDessoukyMMThe stochastic vehicle routing problem for minimum unmet demandOptimization and Logistics Challenges in the Enterprise2009349371
  • SteinbergEParksMSA preference order dynamic program for a knapsack problem with stochastic rewardsJournal of the Operational Research Society197930214114710.1057/jors.1979.27
  • SubramanianABattarraMAn iterated local search algorithm for the travelling salesman problem with pickups and deliveriesJournal of the Operational Research Society201264340240910.1057/jors.2012.24
  • SubramaniamGGosaviASimulation-based optimisation for material dispatching in vendor-managed inventory systemsInternational Journal of Simulation and Process Modeling20073423824510.1504/IJSPM.2007.016314
  • SubramanianABattarraMPottsCNAn iterated local search heuristic for the single machine total weighted tardiness scheduling problem with sequence-dependent setup timesInternational Journal of Production Research20145292729274210.1080/00207543.2014.883472
  • TanKCCheongCYGohCKSolving multiobjective vehicle routing problem with stochastic demand via evolutionary computationEuropean Journal of Operational Research2007177281383910.1016/j.ejor.2005.12.029
  • TeodorovicDPavkovicGA simulated annealing technique approach to the vehicle routing problem in the case of stochastic demandTransportation Planning and Technology199216426127310.1080/03081069208717490
  • Tripathi M, Kuriger G and Wan H (2009). An ant based simulation optimization for vehicle routing problem with stochastic demands. In: Rossetti MD, Hill RR, Johansson B, Dunkin A and Ingalls RG (eds). Proceedings of the 2009 Winter Simulation Conference. IEEE Press: Austin, Texas, pp 2476–2487.
  • VansteenwegenPMateoMAn iterated local search algorithm for the single-vehicle cyclic inventory routing problemEuropean Journal of Operational Research2014237380281310.1016/j.ejor.2014.02.020
  • Zhang T (2007). RLC_ACS: An improved ant colony algorithm for VRPSDP. In: Proceedings of 2007 International Conference on Machine Learning And Cybernetics. IEEE: Hong Kong, pp 978–983.
  • ZhangTChaovalitwongseWAZhangYScatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveriesComputers and Operations Research201239102277229010.1016/j.cor.2011.11.021

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.