{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T05:56:26Z","timestamp":1775714186205,"version":"3.50.1"},"reference-count":167,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T00:00:00Z","timestamp":1221782400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s11047-008-9098-4","type":"journal-article","created":{"date-parts":[[2008,9,18]],"date-time":"2008-09-18T07:27:33Z","timestamp":1221722853000},"page":"239-287","source":"Crossref","is-referenced-by-count":574,"title":["A survey on metaheuristics for stochastic combinatorial optimization"],"prefix":"10.1007","volume":"8","author":[{"given":"Leonora","family":"Bianchi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Dorigo","sequence":"additional","affiliation":[]},{"given":"Luca Maria","family":"Gambardella","sequence":"additional","affiliation":[]},{"given":"Walter J.","family":"Gutjahr","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,19]]},"reference":[{"key":"9098_CR1","volume-title":"Simulated annealing and the Boltzmann machine","author":"E Aarts","year":"1990","unstructured":"Aarts E, Korst J (1990) Simulated annealing and the Boltzmann machine. Wiley, New York, NY, USA"},{"issue":"1\u20132","key":"9098_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-003-0436-0","volume":"97","author":"S Albers","year":"2003","unstructured":"Albers S (2003) Online algorithms: a survey. Math Program 97(1\u20132):3\u201326","journal-title":"Math Program"},{"key":"9098_CR4","first-page":"514","volume-title":"Proceedings of the 2004 winter simulation conference (WSC04)","author":"TM Alkhamis","year":"2004","unstructured":"Alkhamis TM, Ahmed MA (2004) Simulation-based optimization using simulated annealing with confidence intervals. In: Ingalls RG, Rossetti MD, Smith JS, Peters BA (eds) Proceedings of the 2004 winter simulation conference (WSC04). IEEE Press, Piscataway, NJ, USA, pp 514\u2013518"},{"key":"9098_CR5","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/S0377-2217(98)00112-X","volume":"116","author":"TM Alkhamis","year":"1999","unstructured":"Alkhamis TM, Ahmed MA, Kim Tuan W (1999) Simulated annealing for discrete optimization with estimation. Eur J Oper Res 116:530\u2013544","journal-title":"Eur J Oper Res"},{"key":"9098_CR6","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1287\/mnsc.45.5.748","volume":"45","author":"MH Alrefaei","year":"1999","unstructured":"Alrefaei MH, Andrad\u00f3ttir S (1999) A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Manag Sci 45:748\u2013764","journal-title":"Manag Sci"},{"key":"9098_CR7","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/WSC.1998.744910","volume-title":"Proceedings of the 1998 winter simulation conference (WSC98)","author":"S Andrad\u00f3ttir","year":"1998","unstructured":"Andrad\u00f3ttir S (1998) A review of simulation optimization techniques. In: Medeiros DJ, Watson EF, Carson JS, Manivannan MS (eds) Proceedings of the 1998 winter simulation conference (WSC98). IEEE Press, Piscataway, NJ, USA, pp 151\u2013158"},{"key":"9098_CR8","doi-asserted-by":"crossref","unstructured":"Aringhieri R (2004) Solving chance-constrained programs combining Tabu Search and simulation. In: Ribeiro CC, Martins SL (eds) Proceedings of the 3rd international workshop on experimental and efficient algorithms (WEA04), vol 3059: Lecture notes in computer science. Springer, Berlin, Germany, pp 30\u201341","DOI":"10.1007\/978-3-540-24838-5_3"},{"key":"9098_CR9","doi-asserted-by":"crossref","unstructured":"Arnold D (2002) In Noisy optimization with evolutionary strategies, vol 8: Genetic algorithms and evolutionary computation series. Kluwer Academic Publishers, Boston, MA, USA","DOI":"10.1007\/978-1-4615-1105-2"},{"key":"9098_CR10","doi-asserted-by":"crossref","unstructured":"B\u00e4ck T, Fogel D, Michalewicz Z (eds) (1997) Handbook of evolutionary computation. Oxford University Press, Oxford, UK, and Institute of Physics Publishing, Bristol, UK","DOI":"10.1887\/0750308958"},{"key":"9098_CR11","unstructured":"Balaprakash P, Birattari M, St\u00fctzle T, Dorigo M (2007a) Adaptive sample size and importance sampling in estimation-based local search for stochastic combinatorial optimization: a complete analysis. Technical Report TR\/IRIDIA\/2007-015, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium, September"},{"key":"9098_CR12","unstructured":"Balaprakash P, Birattari M, St\u00fctzle T, Dorigo M (2007b) An experimental study of estimation-based metaheuristics for the probabilistic traveling salesman problem. Technical Report TR\/IRIDIA\/2007-021, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"},{"issue":"4","key":"9098_CR13","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s11047-007-9049-5","volume":"6","author":"A Banks","year":"2007","unstructured":"Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization, part i: background and development. Nat Comput 6(4):467\u2013484","journal-title":"Nat Comput"},{"issue":"1","key":"9098_CR14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11047-007-9050-z","volume":"7","author":"A Banks","year":"2008","unstructured":"Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization, part ii: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7(1):109\u2013124","journal-title":"Nat Comput"},{"key":"9098_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01743349","volume":"5","author":"J-FM Barthelemy","year":"1993","unstructured":"Barthelemy J-FM, Haftka RT (1993) Approximation concepts for optimum structural design\u2014a review. Struct Optim 5:129\u2013144","journal-title":"Struct Optim"},{"key":"9098_CR17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/mnsc.17.4.B141","volume":"17","author":"R Bellman","year":"1970","unstructured":"Bellman R, Zadeh LA (1970) Decision-making in a fuzzy environment. Manag Sci 17:141\u2013161","journal-title":"Manag Sci"},{"issue":"1","key":"9098_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2004.02.027","volume":"167","author":"P Beraldi","year":"2005","unstructured":"Beraldi P, Ruszczy\u0144ski A (2005) Beam Search heuristic to solve stochastic integer problems under probabilistic constraints. Eur J Oper Res 167(1):35\u201347","journal-title":"Eur J Oper Res"},{"key":"9098_CR19","unstructured":"Bertsekas DP (1995) Dynamic programming and optimal control, vol 1, 2. Athena Scientific, Belmont, MA, USA"},{"key":"9098_CR20","volume-title":"Network optimization: continuous and discrete models","author":"DP Bertsekas","year":"1998","unstructured":"Bertsekas DP (1998) Network optimization: continuous and discrete models. Athena Scientific, Belmont, MA, USA"},{"key":"9098_CR21","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009634810396","volume":"5","author":"DP Bertsekas","year":"1998","unstructured":"Bertsekas DP, Casta\u00f1on DA (1998) Rollout algorithms for stochastic scheduling problems. J Heuristics 5:89\u2013108","journal-title":"J Heuristics"},{"issue":"3","key":"9098_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1023\/A:1009635226865","volume":"3","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas DP, Tsitsiklis JN, Wu C (1997) Rollout algorithms for combinatorial optimization. J Heuristics 3(3):245\u2013262","journal-title":"J Heuristics"},{"issue":"2\u20134","key":"9098_CR23","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0045-7825(99)00386-2","volume":"186","author":"H-G Beyer","year":"2000","unstructured":"Beyer H-G (2000) Evolutionary algorithms in noisy environments: theoretical issues and guidelines for practice. Comput Meth Appl Mech Eng 186(2\u20134):239\u2013267","journal-title":"Comput Meth Appl Mech Eng"},{"key":"9098_CR24","unstructured":"Bianchi L (2006) Ant colony optimization and local search for the probabilistic traveling salesman problem: a case study in stochastic combinatorial optimization. PhD thesis, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"},{"issue":"1","key":"9098_CR27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.ejor.2005.05.027","volume":"176","author":"L Bianchi","year":"2007","unstructured":"Bianchi L, Campbell AM (2007) Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. Eur J Oper Res 176(1):131\u2013144","journal-title":"Eur J Oper Res"},{"key":"9098_CR28","doi-asserted-by":"crossref","unstructured":"Bianchi L, Gambardella LM, Dorigo M (2002a) An ant colony optimization approach to the probabilistic traveling salesman problem. In: Merelo Guerv\u00f3s JJ, Adamidis P, Beyer H-G, Fern\u00e1ndez-Villaca\u00f1as J-L, Schwefel H-P (eds) Proceedings of the 7th international conference on parallel problem solving from nature (PPSN VII), vol 2439: Lecture notes in computer science. Springer, London, UK, pp 883\u2013892","DOI":"10.1007\/3-540-45712-7_85"},{"key":"9098_CR29","doi-asserted-by":"crossref","unstructured":"Bianchi L, Gambardella LM, Dorigo M (2002b) Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic. In: Dorigo M, Di Caro G, Sampels M (eds) Proceedings of the 3rd international workshop on ant algorithms (ANTS 2002), vol 2463: Lecture notes in computer science. Springer, London, UK, pp 176\u2013187","DOI":"10.1007\/3-540-45724-0_15"},{"key":"9098_CR25","doi-asserted-by":"crossref","unstructured":"Bianchi L, Birattari M, Chiarandini M, Manfrin M, Mastrolilli M, Paquete L, Rossi-Doria O, Schiavinotto T (2004) Metaheuristics for the vehicle routing problem with stochastic demands. In: Yao X, Burke E, Lozano JA, Smith J, Merelo Guerv\u00f3s JJ, Bullinaria JA, Rowe J, Ti\u0148o P, Kab\u00e1n A, Schwefel H-P (eds) Proceedings of the 8th international conference on parallel problem solving from nature (PPSN VIII), vol 3242: Lecture notes in computer science. Springer, Berlin, Germany, pp 450\u2013460","DOI":"10.1007\/978-3-540-30217-9_46"},{"issue":"1","key":"9098_CR30","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.ejor.2003.10.016","volume":"162","author":"L Bianchi","year":"2005","unstructured":"Bianchi L, Knowles J, Bowler N (2005) Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms. Eur J Oper Res 162(1):206\u2013219","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9098_CR26","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10852-005-9033-y","volume":"5","author":"L Bianchi","year":"2006","unstructured":"Bianchi L, Birattari M, Manfrin M, Mastrolilli M, Paquete L, Rossi-Doria O, Schiavinotto T (2006) Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J Math Model Algorithms 5(1):91\u2013110","journal-title":"J Math Model Algorithms"},{"key":"9098_CR31","unstructured":"Birattari M, Balaprakash P, Dorigo M (2005) ACO\/F-Race: ant colony optimization and racing techniques for combinatorial optimization under uncertainty. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) Proceedings of the 6th metaheuristics international conference (MIC 2005), pp 107\u2013112"},{"key":"9098_CR32","volume-title":"Metaheuristics\u2014progress in complex systems optimization. Operations research\/computer science interfaces series","author":"M Birattari","year":"2006","unstructured":"Birattari M, Balaprakash P, Dorigo M (2006) The ACO\/F-RACE algorithm for combinatorial optimization under uncertainty. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) Metaheuristics\u2014progress in complex systems optimization. Operations research\/computer science interfaces series. Springer, Berlin, Germany"},{"key":"9098_CR33","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"1997","unstructured":"Birge JR, Louveaux F (1997) Introduction to stochastic programming. Springer, New York, NY, USA"},{"key":"9098_CR34","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1214\/aoms\/1177730293","volume":"19","author":"ZW Birnbaum","year":"1948","unstructured":"Birnbaum ZW (1948) On random variables with comparable peakedness. Ann Math Stat 19:76\u201381","journal-title":"Ann Math Stat"},{"issue":"4","key":"9098_CR35","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.plrev.2005.10.001","volume":"2","author":"C Blum","year":"2005","unstructured":"Blum C (2005) Ant colony optimization: introduction and recent trends. Phys Life Rev 2(4):353\u2013373","journal-title":"Phys Life Rev"},{"issue":"3","key":"9098_CR36","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv 35(3):268\u2013308","journal-title":"ACM Comput Surv"},{"key":"9098_CR37","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge, MA, USA"},{"key":"9098_CR38","doi-asserted-by":"crossref","unstructured":"Bowler NE, Fink TMA, Ball RC (2003) Characterization of the probabilistic traveling salesman problem. Phys Rev E 68(036703)","DOI":"10.1103\/PhysRevE.68.036703"},{"key":"9098_CR39","first-page":"27","volume-title":"Proceedings of the genetic and evolutionary computation conference (GECCO 2001)","author":"J Branke","year":"2001","unstructured":"Branke J (2001) Evolutionary approaches to dynamic optimization problems\u2014updated survey. In: Beyer H-G, Cant\u00fa-Paz E, Goldberg D, Parmee IC, Spector L, Whitley D (eds) Proceedings of the genetic and evolutionary computation conference (GECCO 2001). Morgan Kaufmann, San Francisco, CA, USA, pp 27\u201330"},{"key":"9098_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0911-0","volume-title":"Evolutionary optimization in dynamic environments","author":"J Branke","year":"2002","unstructured":"Branke J (2002) Evolutionary optimization in dynamic environments. Springer, Berlin, Germany"},{"key":"9098_CR41","doi-asserted-by":"crossref","unstructured":"Branke J, Guntsch M (2003) New ideas for applying ant colony optimization to the probabilistic TSP. In Proceedings of the 3rd European workshop on evolutionary computation in combinatorial optimization (EvoCOP 2003), vol 2611: Lecture notes in computer science. Springer, Berlin, Germany, pp 165\u2013175","DOI":"10.1007\/3-540-36605-9_16"},{"issue":"4","key":"9098_CR42","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1023\/B:JMMA.0000049380.86987.d4","volume":"3","author":"J Branke","year":"2004","unstructured":"Branke J, Guntsch M (2004) Solving the probabilistic TSP with ant colony optimization. J Math Model Algorithms 3(4):403\u2013425","journal-title":"J Math Model Algorithms"},{"key":"9098_CR44","doi-asserted-by":"crossref","unstructured":"Brodersen O, Schumann M (2007) Optimizing a stochastic warehouse using particle swarm optimization. In Second international conference on innovative computing (ICICIC). IEEE Press, Piscataway, NJ, USA, pp 449\u2013452","DOI":"10.1109\/ICICIC.2007.434"},{"issue":"1","key":"9098_CR45","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1520-6750(199302)40:1<69::AID-NAV3220400105>3.0.CO;2-H","volume":"40","author":"M Brusco","year":"1993","unstructured":"Brusco M, Jacobs L (1993a) A simulated annealing approach to the cyclic staff-scheduling problem. Nav Res Logist 40(1):69\u201384","journal-title":"Nav Res Logist"},{"issue":"12","key":"9098_CR46","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1057\/jors.1993.198","volume":"44","author":"M Brusco","year":"1993","unstructured":"Brusco M, Jacobs L (1993b) A simulated annealing approach to the solution of flexible labour scheduling problems. J Oper Res Soc 44(12):1191\u20131200","journal-title":"J Oper Res Soc"},{"key":"9098_CR48","first-page":"684","volume-title":"Proceedings of the 1988 winter simulation conference (WSC98)","author":"AA Bulgak","year":"1988","unstructured":"Bulgak AA, Sanders JL (1988) Integrating a modified simulated annealing algorithm with the simulation of a manufacturing system to optimize buffer sizes in automatic assembly systems. In: Abrams M, Haigh P, Comfort J (eds) Proceedings of the 1988 winter simulation conference (WSC98). IEEE Press, Piscataway, NJ, USA, pp 684\u2013690"},{"key":"9098_CR49","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1009625526657","volume":"5","author":"P Cal\u00e9gari","year":"1999","unstructured":"Cal\u00e9gari P, Coray G, Hertz A, Kobler D, Kuonen P (1999) A taxonomy of evolutionary algorithms in combinatorial optimization. J Heuristics 5:145\u2013158","journal-title":"J Heuristics"},{"key":"9098_CR51","unstructured":"Chang HS (2004) An ant system based exploration-exploitation for reinforcement learning. In Proceedings of the IEEE conference on systems, man, and cybernetics. IEEE Press, Piscataway, NJ, USA, pp 3805\u20133810"},{"key":"9098_CR52","doi-asserted-by":"crossref","unstructured":"Chang HS, Gutjahr WJ, Yang J, Park S (2004) An ant system approach to Markov decision processes. In Proceedings of the 23rd American control conference (ACC04), vol 4. IEEE Press, Piscataway, NJ, USA, pp 3820\u20133825","DOI":"10.23919\/ACC.2004.1384508"},{"issue":"11","key":"9098_CR53","doi-asserted-by":"crossref","first-page":"1804","DOI":"10.1109\/TAC.2005.858644","volume":"50","author":"HS Chang","year":"2005","unstructured":"Chang HS, Lee H-G, Fu MC, Marcus SI (2005) Evolutionary policy iteration for solving Markov decision processes. IEEE T Automat Contr 50(11):1804\u20131808","journal-title":"IEEE T Automat Contr"},{"key":"9098_CR54","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10852-006-9051-4","volume":"6","author":"RK Cheung","year":"2007","unstructured":"Cheung RK, Dongsheng X, Yongpei G (2007) A solution method for a two-dispatch delivery problem with stochastic customers. J Math Model Algorithms 6:87\u2013107","journal-title":"J Math Model Algorithms"},{"key":"9098_CR55","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1009636520440","volume":"4","author":"D Costa","year":"1998","unstructured":"Costa D, Silver EA (1998) Tabu Search when noise is present: an illustration in the context of cause and effect analysis. J Heuristics 4:5\u201323","journal-title":"J Heuristics"},{"key":"9098_CR56","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1109\/WSC.2000.899877","volume-title":"Proceedings of the 2000 winter simulation conference (WSC00)","author":"B Dengiz","year":"2000","unstructured":"Dengiz B, Alabas C (2000) Simulation optimization using Tabu Search. In: Joines JA, Barton RR, Kang K, Fishwick PA (eds) Proceedings of the 2000 winter simulation conference (WSC00). IEEE Press, Piscataway, NJ, USA, pp 805\u2013810"},{"key":"9098_CR57","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1016\/j.ejor.2004.12.027","volume":"175","author":"K Doerner","year":"2006","unstructured":"Doerner K, Gutjahr WJ, Kotsis G, Polaschek M, Strauss C (2006) Enriched workflow modelling and stochastic branch-and-bound. Eur J Oper Res 175:1798\u20131817","journal-title":"Eur J Oper Res"},{"issue":"2\u20133","key":"9098_CR58","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M Dorigo","year":"2005","unstructured":"Dorigo M, Blum C (2005) Ant colony optimization theory: a survey. Theor Comput Sci 344(2\u20133):243\u2013278","journal-title":"Theor Comput Sci"},{"key":"9098_CR60","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant Colony System: A cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53\u201366","journal-title":"IEEE Trans Evol Comput"},{"key":"9098_CR63","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant colony optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo M, St\u00fctzle T (2004) Ant colony optimization. MIT Press, Cambridge, MA, USA"},{"key":"9098_CR61","volume-title":"The ant system: an autocatalytic optimization process. Technical Report 91-016, Department of Electronics","author":"M Dorigo","year":"1991","unstructured":"Dorigo M, Maniezzo V, Colorni A (1991) The ant system: an autocatalytic optimization process. Technical Report 91-016, Department of Electronics. Politecnico di Milano, Milan, Italy"},{"issue":"1","key":"9098_CR62","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern\u2014Part B 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern\u2014Part B"},{"issue":"2","key":"9098_CR59","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo M, Di Caro G, Gambardella LM (1999) Ant algorithms for discrete optimization. Artif Life 5(2):137\u2013172","journal-title":"Artif Life"},{"key":"9098_CR64","unstructured":"Dyer M, Stougie L (2003) Computational complexity of stochastic programming problems. Technical Report SPOR-report 2003-20. Department of Mathematics and Computer Science. Technische Universiteit Eindhoven, Eindhoven, The Netherlands"},{"issue":"3","key":"9098_CR65","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/S0377-2217(98)00327-0","volume":"118","author":"F Easton","year":"1999","unstructured":"Easton F, Mansour N (1999) A distributed genetic algorithm for deterministic and stochastic labor scheduling problems. Eur J Oper Res 118(3):505\u2013523","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9098_CR66","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1111\/j.1540-5915.1996.tb01825.x","volume":"27","author":"F Easton","year":"1996","unstructured":"Easton F, Rossin D (1996) A stochastic goal program for employee scheduling. Dec Sci 27(3):541\u2013568","journal-title":"Dec Sci"},{"key":"9098_CR67","doi-asserted-by":"crossref","unstructured":"Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the IEEE international symposium on micro machine and human science (MHS\u201995). IEEE Press, Piscataway, NJ, USA, pp 39\u201343","DOI":"10.1109\/MHS.1995.494215"},{"issue":"7","key":"9098_CR68","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1080\/00207540412331320526","volume":"43","author":"E Erel","year":"2005","unstructured":"Erel E, Sabuncuoglu I, Sekerci H (2005) Stochastic assembly line balancing using Beam Search. Int J Prod Res 43(7):1411\u20131426","journal-title":"Int J Prod Res"},{"key":"9098_CR69","first-page":"1013","volume-title":"Proceedings of the 2002 winter simulation conference (WSC02)","author":"DA Finke","year":"2002","unstructured":"Finke DA, Medeiros DJ, Traband M (2002) Shop scheduling using Tabu Search and simulation. In: Y\u00fccesan E, Chen CH, Snowdon JL, Charnes JM (eds) Proceedings of the 2002 winter simulation conference (WSC02). IEEE Press, Piscataway, NJ, USA, pp 1013\u20131017"},{"key":"9098_CR70","volume-title":"Artificial intelligence through simulated evolution","author":"LJ Fogel","year":"1966","unstructured":"Fogel LJ, Owens AJ, Walsh MJ (1966) Artificial intelligence through simulated evolution. Wiley, New York, NY, USA"},{"key":"9098_CR71","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1214\/aoap\/1177004607","volume":"4","author":"BL Fox","year":"1995","unstructured":"Fox BL, Heine GW (1995) Probabilistic search with overrides. Ann Appl Probab 4:1087\u20131094","journal-title":"Ann Appl Probab"},{"issue":"3","key":"9098_CR72","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.14.3.192.113","volume":"14","author":"MC Fu","year":"2002","unstructured":"Fu MC (2002) Optimization for simulation: theory vs. practice. INFORMS J Comput 14(3):192\u2013215","journal-title":"INFORMS J Comput"},{"issue":"2","key":"9098_CR73","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1145\/858481.858482","volume":"13","author":"MC Fu","year":"2003","unstructured":"Fu MC (2003) Guest editorial of the ACM TOMACS special issue on \u201csimulation optimization\u201d. ACM Trans Model Comput Simul 13(2):105\u2013107","journal-title":"ACM Trans Model Comput Simul"},{"key":"9098_CR74","doi-asserted-by":"crossref","unstructured":"Gambardella LM, Dorigo M (1996) Solving symmetric and asymmetric TSPs by ant colonies. In: Proceedings of the 1996 IEEE international conference on evolutionary computation (ICEC\u201996). IEEE Press, Piscataway, NJ, USA, pp 622\u2013627","DOI":"10.1109\/ICEC.1996.542672"},{"key":"9098_CR75","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York, NY, USA"},{"key":"9098_CR76","doi-asserted-by":"crossref","unstructured":"Gelfand SB, Mitter SK (1985) Analysis of simulated annealing for optimization. In: Proceedings of the 24th IEEE conference on decision and control (CDC\u201985), vol 2. IEEE Press, Piscataway, NJ, USA, pp 779\u2013786","DOI":"10.1109\/CDC.1985.268603"},{"key":"9098_CR77","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF00939629","volume":"69","author":"SB Gelfand","year":"1989","unstructured":"Gelfand SB, Mitter SK (1989) Simulated annealing with noisy or imprecise measurements. J Optim Theory Appl 69:49\u201362","journal-title":"J Optim Theory Appl"},{"key":"9098_CR78","doi-asserted-by":"crossref","unstructured":"Geman D, Geman S (1984) Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. In: IEEE transactions of pattern analysis and machine intelligence, vol 6, pp 721\u2013741","DOI":"10.1109\/TPAMI.1984.4767596"},{"issue":"2","key":"9098_CR79","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/trsc.29.2.143","volume":"29","author":"M Gendreau","year":"1995","unstructured":"Gendreau M, Laporte G, S\u00e9guin R (1995) An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transp Sci 29(2):143\u2013155","journal-title":"Transp Sci"},{"issue":"3","key":"9098_CR80","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1287\/opre.44.3.469","volume":"44","author":"M Gendreau","year":"1996","unstructured":"Gendreau M, Laporte G, S\u00e9guin R (1996) A Tabu Search heuristic for the vehicle routing problem with stochastic demands and customers. Oper Res 44(3):469\u2013477","journal-title":"Oper Res"},{"key":"9098_CR82","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533\u2013549","journal-title":"Comput Oper Res"},{"key":"9098_CR83","doi-asserted-by":"crossref","unstructured":"Glover F (1998) A template for scatter search and path relinking. In: Hao J-K, Lutton E, Ronald E, Schoenaurer M, Snyers D (eds) Artificial evolution, vol 1363: Lecture notes in computer science. Springer, Berlin, Germany","DOI":"10.1007\/BFb0026589"},{"key":"9098_CR84","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(01)00263-3","volume":"119","author":"F Glover","year":"2002","unstructured":"Glover F (2002) Tabu Search and finite convergence. Discret Appl Math 119:3\u201336","journal-title":"Discret Appl Math"},{"key":"9098_CR85","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu Search. Kluwer Academic Publishers, Norwell, MA, USA"},{"key":"9098_CR86","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198572237.001.0001","volume-title":"Probability and random processes","author":"GR Grimmett","year":"2001","unstructured":"Grimmett GR, Stirzaker DR (2001) Probability and random processes, 3rd edn. Oxford University Press, New York, NY, USA","edition":"3"},{"key":"9098_CR87","volume-title":"The traveling salesman problem and its variations","year":"2002","unstructured":"Gutin G, Punnen A (eds) (2002) The traveling salesman problem and its variations. Kluwer Academic Publishers, Dordrecht, The Netherlands"},{"issue":"8","key":"9098_CR88","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"WJ Gutjahr","year":"2000","unstructured":"Gutjahr WJ (2000) A graph-based ant system and its convergence. Future Gener Comput Syst 16(8):873\u2013888","journal-title":"Future Gener Comput Syst"},{"issue":"3","key":"9098_CR89","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","volume":"82","author":"WJ Gutjahr","year":"2002","unstructured":"Gutjahr WJ (2002) ACO algorithms with guaranteed convergence to the optimal solution. Inf Process Lett 82(3):145\u2013153","journal-title":"Inf Process Lett"},{"key":"9098_CR90","doi-asserted-by":"crossref","unstructured":"Gutjahr WJ (2003) A converging ACO algorithm for stochastic combinatorial optimization. In: Proceedings of the 2nd symposium on stochastic algorithms, foundations and applicaions (SAGA 2003), vol 2827: Lecture notes in computer science. Springer, Berlin, Germany, pp 10\u201325","DOI":"10.1007\/978-3-540-39816-5_2"},{"key":"9098_CR91","doi-asserted-by":"crossref","unstructured":"Gutjahr WJ (2004) S-ACO: an ant-based approach to combinatorial optimization under uncertainty. In: Proceedings of the 4th international workshop on ant colony optimization and swarm intelligence (ANTS 2004), vol 3172: Lecture notes in computer science. Springer, Berlin, Germany, pp 238\u2013249","DOI":"10.1007\/978-3-540-28646-2_21"},{"key":"9098_CR92","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/S0377-2217(98)00279-3","volume":"117","author":"WJ Gutjahr","year":"1999","unstructured":"Gutjahr WJ, Hellmayr A, Pflug GCh (1999) Optimal stochastic single-machine tardiness scheduling by stochastic branch-and-bound. Eur J Oper Res 117:396\u2013413","journal-title":"Eur J Oper Res"},{"key":"9098_CR93","doi-asserted-by":"crossref","unstructured":"Gutjahr WJ, Katzensteiner S, Reiter P (2007) A VNS algorithm for noisy problems and its application to project portfolio analysis. In: Hromkovi\u010d J, Kr\u00e1lovi\u010d R, Nunkesser M, Widmayer P (eds) Proceedings of the 4th symposium on stochastic algorithms, foundations and applications (SAGA 2007), vol 4665: Lecture notes in computer science, pp 93\u2013104","DOI":"10.1007\/978-3-540-74871-7_9"},{"key":"9098_CR94","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00229298","volume":"8","author":"WJ Gutjahr","year":"1996","unstructured":"Gutjahr WJ, Pflug GCh (1996) Simulated annealing for noisy cost functions. J Glob Optim 8:1\u201313","journal-title":"J Glob Optim"},{"key":"9098_CR95","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1108\/14637150010313357","volume":"6","author":"WJ Gutjahr","year":"2000","unstructured":"Gutjahr WJ, Strauss C, Toth M (2000a) Crashing of stochastic activities by sampling and optimization. Bus Process Manag J 6:65\u201383","journal-title":"Bus Process Manag J"},{"key":"9098_CR96","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/ijoc.12.2.125.11894","volume":"12","author":"WJ Gutjahr","year":"2000","unstructured":"Gutjahr WJ, Strauss C, Wagner E (2000b) A stochastic branch-and-bound approach to activity crashing in project management. INFORMS J Comput 12:125\u2013135","journal-title":"INFORMS J Comput"},{"key":"9098_CR97","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0360-8352(92)90014-B","volume":"22","author":"J Haddock","year":"1992","unstructured":"Haddock J, Mittenthal J (1992) Simulation optimization using simulated annealing. Comput Ind Eng 22:387\u2013395","journal-title":"Comput Ind Eng"},{"key":"9098_CR98","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B Hajek","year":"1988","unstructured":"Hajek B (1988) Cooling schedules for optimal annealing. Math Oper Res 13:311\u2013329","journal-title":"Math Oper Res"},{"key":"9098_CR99","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1026565712483","volume":"7","author":"S Hanafi","year":"2000","unstructured":"Hanafi S (2000) On the convergence of Tabu Search. J Heuristics 7:47\u201358","journal-title":"J Heuristics"},{"key":"9098_CR100","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1018930113099","volume":"85","author":"WKK Haneveld","year":"1999","unstructured":"Haneveld WKK, van der Vlerk MH (1999) Stochastic integer programming: state of the art. Ann Oper Res 85:39\u201357","journal-title":"Ann Oper Res"},{"key":"9098_CR101","unstructured":"Hansen P (1986) The steepest ascent mildest descent heuristics for combinatorial programming. Talk presented at the congress on numerical methods in combinatorial optimization. Capri, Italy"},{"key":"9098_CR102","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: Principles and applications. Eur J Oper Res 130:449\u2013467","journal-title":"Eur J Oper Res"},{"key":"9098_CR103","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/S0377-2217(00)00116-8","volume":"132","author":"KK Haugen","year":"2001","unstructured":"Haugen KK, L\u00f8kketangen A, Woodruff DL (2001) Progressive hedging as a meta-heuristic applied to stochastic lot-sizing. Eur J Oper Res 132:116\u2013122","journal-title":"Eur J Oper Res"},{"key":"9098_CR104","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1016\/j.ejor.2005.11.070","volume":"180","author":"D Haugland","year":"2007","unstructured":"Haugland D, Ho SC, Laporte G (2007) Designing delivery districts for the vehicle routing problem with stochastic demands. Eur J Oper Res 180:997\u20131010","journal-title":"Eur J Oper Res"},{"key":"9098_CR105","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(99)00435-X","volume":"126","author":"A Hertz","year":"2000","unstructured":"Hertz A, Kobler D (2000) A framework for the description of evolutionary algorithms. Eur J Oper Res 126:1\u201312","journal-title":"Eur J Oper Res"},{"key":"9098_CR106","first-page":"121","volume-title":"Local search in combinatorial optimization","author":"A Hertz","year":"1997","unstructured":"Hertz A, Taillard E, de Werra D (1997) Tabu Search. In: Aarts EHL, Lenstra JK (eds) Local search in combinatorial optimization. Wiley, New York, NY, USA, pp 121\u2013136"},{"key":"9098_CR107","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Harbor, MI, USA"},{"key":"9098_CR108","doi-asserted-by":"crossref","unstructured":"Homem-de-Mello T (2000) Variable-sample methods and simulated annealing for discrete stochastic optimization. Stochastic Programming E-Print Series, http:\/\/hera.rz.hu-berlin.de\/speps\/","DOI":"10.1007\/978-1-4757-6594-6_5"},{"key":"9098_CR109","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1145\/858481.858483","volume":"13","author":"T Homem-de-Mello","year":"2003","unstructured":"Homem-de-Mello T (2003) Variable-sample methods for stochastic optimization. ACM Trans Model Comput Simul 13:108\u2013133","journal-title":"ACM Trans Model Comput Simul"},{"key":"9098_CR110","doi-asserted-by":"crossref","unstructured":"Hvattum LM, L\u00f8kketangen A (in press) Using scenario trees and progressive hedging for stochastic inventory routing problems. J Heuristics. doi: 10.1007\/s10732-008-9076-0","DOI":"10.1007\/s10732-008-9076-0"},{"issue":"3","key":"9098_CR111","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/B:JOSH.0000019683.85186.57","volume":"7","author":"S Irani","year":"2004","unstructured":"Irani S, Lu X, Regan A (2004) On-line algorithms for the dynamic traveling repair problem. J Sched 7(3):243\u2013258","journal-title":"J Sched"},{"key":"9098_CR112","doi-asserted-by":"crossref","unstructured":"Jellouli O, Ch\u00e2telet E (2001) Monte Carlo simulation and genetic algorithm for optimising supply chain management in a stochastic environment. In: Proceedings of the 2001 IEEE conference on systems, man, and cybernetics, vol 3. IEEE Press, Piscataway, NJ, USA, pp 1835\u20131839","DOI":"10.1109\/ICSMC.2001.973596"},{"issue":"1","key":"9098_CR113","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00500-003-0328-5","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y (2005) A comprehensive survey of fitness approximation in evolutionary computation. Soft Comput 9(1):3\u201312","journal-title":"Soft Comput"},{"issue":"3","key":"9098_CR114","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/TEVC.2005.846356","volume":"9","author":"Y Jin","year":"2005","unstructured":"Jin Y, Branke J (2005) Evolutionary optimization in uncertain environments\u2014a survey. IEEE Trans Evol Comput 9(3):303\u2013317","journal-title":"IEEE Trans Evol Comput"},{"key":"9098_CR115","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/0925-5273(95)00145-X","volume":"45","author":"H J\u00f6nsson","year":"1996","unstructured":"J\u00f6nsson H, Silver EA (1996) Some insights regarding selecting sets of scenarios in combinatorial stochastic problems. J Prod Econ 45:463\u2013472","journal-title":"J Prod Econ"},{"key":"9098_CR116","doi-asserted-by":"crossref","unstructured":"Jovanovi\u0107 D, Mladenovi\u0107 M, Ognjanovi\u0107 Z (2007) Variable neighborhood search for the probabilistic satisfiability problem. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr WJ, Hartl RF, Reimann M (eds) Metaheuristics\u2014progress in complex systems optimization, vol 39: Operations research\/Computer Science Interfaces Series. Springer, New York, NY, USA, pp 173\u2013188","DOI":"10.1007\/978-0-387-71921-4_9"},{"key":"9098_CR117","unstructured":"Kall P, Wallace SW (1994) Stochastic programming. Wiley, Chichester, UK, 1994. Wiley has released the copyright on the book, and the authors made the text available to the scientific community: it can be downloaded for free at http:\/\/www.unizh.ch\/ior\/Pages\/Deutsch\/Mitglieder\/Kall\/bib\/ka-wal-94.pdf"},{"key":"9098_CR118","doi-asserted-by":"crossref","unstructured":"Kennedy J (1997) The particle swarm: social adaptation of knowledge. In: Proceedings of the IEEE international conference on evolutionary computation (CEC\u201997). IEEE Press, Piscataway, NJ, USA, pp 303\u2013308","DOI":"10.1109\/ICEC.1997.592326"},{"key":"9098_CR119","first-page":"277","volume":"9","author":"A Kenyon","year":"2002","unstructured":"Kenyon A, Morton DP (2002) A survey on stochastic location and routing problems. Central Eur J Oper Res 9:277\u2013328","journal-title":"Central Eur J Oper Res"},{"key":"9098_CR120","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"key":"9098_CR121","doi-asserted-by":"crossref","unstructured":"Kouvelis P, Yu G (1997) Robust discrete optimization and its applications, vol 14: Nonconvex optimization and its applications. Kluwer Academic Publishers, Dordrecht, The Netherlands","DOI":"10.1007\/978-1-4757-2620-6"},{"issue":"3","key":"9098_CR122","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.42.3.543","volume":"42","author":"G Laporte","year":"1994","unstructured":"Laporte G, Louveaux F, Mercure H (1994) An exact solution for the a priori optimization of the probabilistic traveling salesman problem. Oper Res 42(3):543\u2013549","journal-title":"Oper Res"},{"key":"9098_CR125","doi-asserted-by":"crossref","first-page":"2949","DOI":"10.1016\/j.cor.2005.11.008","volume":"34","author":"Y-H Liu","year":"2007","unstructured":"Liu Y-H (2007) A hybrid scatter search for the probabilistic traveling salesman problem. Comput Oper Res 34:2949\u20132963","journal-title":"Comput Oper Res"},{"issue":"1","key":"9098_CR123","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/ijoc.1020.0024","volume":"16","author":"Z-Z Lin","year":"2004","unstructured":"Lin Z-Z, Bean JC, White CC III (2004) A hybrid genetic\/optimization algorithm for finite-horizon, partially observed Markov decision processes. INFORMS J Comput 16(1):27\u201338","journal-title":"INFORMS J Comput"},{"key":"9098_CR124","doi-asserted-by":"crossref","unstructured":"Liu B, Wang L, Jin Y-H (2005) Hybrid particle swarm optimization for flow shop scheduling with stochastic processing time, vol 380: Lecture notes in computer science, pp 630\u2013637","DOI":"10.1007\/11596448_93"},{"key":"9098_CR126","doi-asserted-by":"crossref","unstructured":"Liu Y-H, Jou R-C, Wang C-C, Chiu C-S (2007) An evolutionary algorithm with diversified crossover operator for the heterogeneous probabilistic TSP. In: Carbonell JG, Siekmann J (eds) Modeling decisions for artificial intelligence. 4th international conference, (MDAI 2007), vol 4617: Lecture notes in computer science. Springer, Berlin, Germany, pp 351\u2013360","DOI":"10.1007\/978-3-540-73729-2_33"},{"key":"9098_CR127","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF00247208","volume":"2","author":"A L\u00f8kketangen","year":"1996","unstructured":"L\u00f8kketangen A, Woodruff DL (1996) Progressive hedging and Tabu Search applied to mixed integer (0,1) multistage stochastic programming. J Heuristics 2:111\u2013128","journal-title":"J Heuristics"},{"issue":"2","key":"9098_CR128","first-page":"244","volume":"28","author":"L Lu","year":"2006","unstructured":"Lu L, Tan Q-M (2006) Hybrid particle swarm optimization algorithm for stochastic vehicle routing problem. Xi Tong Gong Cheng Yu Dian Zi Ji Shu\/Syst Eng Electron 28(2):244\u2013247","journal-title":"Xi Tong Gong Cheng Yu Dian Zi Ji Shu\/Syst Eng Electron"},{"key":"9098_CR129","doi-asserted-by":"crossref","unstructured":"Lu M, Wu D-P, Zhang J-P (2006) A particle swarm optimization-based approach to tackling simulation optimization of stochastic, large-scale and complex systems, vol 3930: Lecture notes in computer science, pp 528\u2013537","DOI":"10.1007\/11739685_55"},{"key":"9098_CR130","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/S0377-2217(97)00276-2","volume":"106","author":"CM Lutz","year":"1998","unstructured":"Lutz CM, Davis KR, Sun M (1998) Determining buffer location and size in production lines using Tabu Search. Eur J Oper Res 106:301\u2013316","journal-title":"Eur J Oper Res"},{"key":"9098_CR131","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/SIEDS.2004.239880","volume-title":"Proceedings of the 2004 IEEE systems and information engineering design symposium (SIEDS04)","author":"KL Mak","year":"2004","unstructured":"Mak KL, Guo ZG (2004) A genetic algorithm for vehicle routing problems with stochastic demand and soft time windows. In: Jones MH, Patek SD, Tawney BE (eds) Proceedings of the 2004 IEEE systems and information engineering design symposium (SIEDS04). IEEE Press, Piscataway, NJ, USA, pp 183\u2013190"},{"key":"9098_CR133","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21:1087\u20131092","journal-title":"J Chem Phys"},{"issue":"2","key":"9098_CR134","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1162\/evco.1996.4.2.113","volume":"4","author":"BL Miller","year":"1997","unstructured":"Miller BL, Goldberg DE (1997) Genetic algorithms, selection schemes, and the varying effects of noise. Evol Comput 4(2):113\u2013131","journal-title":"Evol Comput"},{"key":"9098_CR135","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06560-0","volume-title":"Designing evolutionary algorithms for dynamic environments","author":"RW Morrison","year":"2004","unstructured":"Morrison RW (2004) Designing evolutionary algorithms for dynamic environments. Springer, Berlin, Germany"},{"key":"9098_CR136","unstructured":"Metaheuristics Network web site. http:\/\/www.metaheuristics.org\/"},{"issue":"3","key":"9098_CR137","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.46.3.381","volume":"46","author":"VI Norkin","year":"1998","unstructured":"Norkin VI, Ermoliev YM, Ruszczy\u0144ski A (1998a) On optimal allocation of indivisibles under uncertainty. Oper Res 46(3):381\u2013395","journal-title":"Oper Res"},{"key":"9098_CR138","first-page":"425","volume":"83","author":"VI Norkin","year":"1998","unstructured":"Norkin VI, Pflug GCh, Ruszczy\u0144ski A (1998b) A Branch and Bound method for stochastic global optimization. Math Program 83:425\u2013450","journal-title":"Math Program"},{"key":"9098_CR139","doi-asserted-by":"crossref","unstructured":"\u00d3lafsson S, Kim J (2002) Simulation optimization. In: Y\u00fccesan E, Chen CH, Snowdown JL, Charnes JM (eds) Proceedings of the 2002 winter simulation conference (WSC02). IEEE Press, Piscataway, NJ, USA, pp 89\u201384","DOI":"10.1109\/WSC.2002.1172871"},{"key":"9098_CR140","volume-title":"Combinatorial optimization","author":"CH Papadimitriou","year":"1982","unstructured":"Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization. Dover Publications, Mineola, NY, USA"},{"key":"9098_CR141","doi-asserted-by":"crossref","unstructured":"Pappala VS, Erlich I (2007) Management of distributed generation units under stochastic load demands using particle swarm optimization. In: Power engineering society general meeting (PES), IEEE Press, Piscataway, NJ, USA, pp 24\u201328","DOI":"10.1109\/PES.2007.385784"},{"key":"9098_CR142","unstructured":"Pichitlamken J (2002) A combined procedure for optimization via simulation. PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, USA"},{"key":"9098_CR143","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1109\/WSC.2001.977310","volume-title":"Proceedings of the 2001 winter simulation conference (WSC01)","author":"J Pichitlamken","year":"2001","unstructured":"Pichitlamken J, Nelson LB (2001) Selection-of-the-best procedures for optimization via simulation. In: Peters BA, Smith JS, Medeiros DJ, Rohrer MW (eds) Proceedings of the 2001 winter simulation conference (WSC01). IEEE Press, Piscataway, NJ, USA, pp 401\u2013407"},{"issue":"2","key":"9098_CR144","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/858481.858485","volume":"13","author":"J Pichitlamken","year":"2003","unstructured":"Pichitlamken J, Nelson LB (2003) A combined procedure for optimization via simulation. ACM Trans Model Comput Simul 13(2):155\u2013179","journal-title":"ACM Trans Model Comput Simul"},{"key":"9098_CR145","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1:33\u201357","journal-title":"Swarm Intell"},{"key":"9098_CR146","first-page":"147","volume-title":"Proceedings of the 15th international conference on health sciences simulation, western multiconference 2005","author":"M Rauner","year":"2005","unstructured":"Rauner M, Brailsford SC, Gutjahr WJ, Zeppelzauer W (2005) Optimal screening policies for diabetic retinopathy using a combined discrete event simulation and ant colony optimization approach. In: Andersen JG, Katzper M (eds) Proceedings of the 15th international conference on health sciences simulation, western multiconference 2005. SCS\u2014Society of Computer Simulation International, San Diego, CA, USA, pp 147\u2013152"},{"key":"9098_CR147","volume-title":"Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der biologischen Evolution","author":"RI Rechenberg","year":"1973","unstructured":"Rechenberg RI (1973) Evolutionsstrategie: Optimierung Technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart, Germany"},{"key":"9098_CR148","doi-asserted-by":"crossref","unstructured":"Reeves CR, Rowe JE (2003) Genetic algorithms: principles and perspectives\u2014a guide to GA theory. Operaations Research\/Computer Science Interfaces Series. Kluwer Academic Publishers, Boston, MA, USA","DOI":"10.1007\/b101880"},{"key":"9098_CR149","unstructured":"Resende MGC, Ribeiro CC (2003) In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. vol 57: International series in operations research & management, chapter Greedy randomized adaptive search procedures. Kluwer Academic Publishers, Boston, USA, pp 219\u2013249"},{"key":"9098_CR150","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"RT Rockafellar","year":"1991","unstructured":"Rockafellar RT, Wets RJ-B (1991) Scenarios and policy aggregation in optimization under uncertainty. Math Oper Res 16:119\u2013147","journal-title":"Math Oper Res"},{"key":"9098_CR151","unstructured":"Roenko N (1990) Simulated annealing under uncertainty. Technical report, Institute for Operations Research, University of Zurich, Switzerland"},{"issue":"2","key":"9098_CR152","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0305-0548(03)00240-5","volume":"32","author":"SL Rosen","year":"2005","unstructured":"Rosen SL, Harmonosky CM (2005) An improved simulated annealing simulation optimization method for discrete parameter stochastic systems. Comput Oper Res 32(2):343\u2013358","journal-title":"Comput Oper Res"},{"key":"9098_CR153","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316511","volume-title":"Simulation and the Monte Carlo method","author":"RY Rubinstein","year":"1981","unstructured":"Rubinstein RY (1981) Simulation and the Monte Carlo method. Wiley, New York, NY, USA"},{"key":"9098_CR154","doi-asserted-by":"crossref","unstructured":"Rudolph G (1996) Convergence of evolutionary algorithms in general search spaces. In: Proceedings of the IEEE international conference on evolutionary computation (ICEC\u201996). IEEE Press, Piscataway, NJ, USA, pp 50\u201354","DOI":"10.1109\/ICEC.1996.542332"},{"issue":"5","key":"9098_CR156","first-page":"1171","volume":"27","author":"N Secomandi","year":"2000","unstructured":"Secomandi N (2000) Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput Oper Res 27(5):1171\u20131200","journal-title":"Comput Oper Res"},{"issue":"5","key":"9098_CR157","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1287\/opre.49.5.796.10608","volume":"49","author":"N Secomandi","year":"2001","unstructured":"Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper Res 49(5):796\u2013802","journal-title":"Oper Res"},{"key":"9098_CR158","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1025605803490","volume":"9","author":"N Secomandi","year":"2003","unstructured":"Secomandi N (2003) Analysis of a rollout approach to sequencing problems with stochastic routing applications. J Heuristics 9:321\u2013352","journal-title":"J Heuristics"},{"issue":"3","key":"9098_CR159","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1287\/opre.48.3.390.12436","volume":"48","author":"L Shi","year":"2000","unstructured":"Shi L, \u00d3lafsson S (2000) Nested partitions method for global optimization. Oper Res 48(3):390\u2013407","journal-title":"Oper Res"},{"key":"9098_CR161","unstructured":"Stochastic Programming Community Homepage. http:\/\/stoprog.org\/"},{"issue":"4","key":"9098_CR162","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","volume":"6","author":"T St\u00fctzle","year":"2002","unstructured":"St\u00fctzle T, Dorigo M (2002) A short convergence proof for a class of ACO algorithms. IEEE Trans Evol Comput 6(4):358\u2013365","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9098_CR163","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1111\/j.1475-3995.2005.00492.x","volume":"12","author":"J SudhirRyan Daniel","year":"2005","unstructured":"Sudhir Ryan Daniel J, Rajendran C (2005) A simulation-based genetic algorithm for inventory optimization in a serial supply chain. Int Trans Oper Res 12(1):101\u2013127","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"9098_CR164","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/858481.858484","volume":"13","author":"JR Swisher","year":"2003","unstructured":"Swisher JR, Jacobson SH, Y\u00fccesan E (2003) Discrete-event simulation optimization using ranking, selection, multiple comparison procedures: a survey. ACM Trans Model Comput Simul 13(2):134\u2013154","journal-title":"ACM Trans Model Comput Simul"},{"key":"9098_CR166","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/03081069208717490","volume":"16","author":"D Teodorovi\u0107","year":"1992","unstructured":"Teodorovi\u0107 D, Pavkovi\u0107 G (1992) A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand. Transp Plan Technol 16:261\u2013273","journal-title":"Transp Plan Technol"},{"key":"9098_CR167","first-page":"1068","volume":"9","author":"G Tesauro","year":"1997","unstructured":"Tesauro G, Galperin GR (1997) On-line policy improvement using monte carlo search. Adv Neural Inf Process Syst 9:1068\u20131074","journal-title":"Adv Neural Inf Process Syst"},{"key":"9098_CR168","doi-asserted-by":"crossref","unstructured":"van Laarhoven PJM, Aarts EHL (1987) Simulated annealing: theory and applications. D. Reidel Publishing Company, Dordrecht, The Netherlands","DOI":"10.1007\/978-94-015-7744-1"},{"key":"9098_CR169","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The simple genetic algorithm: foundations and theory","author":"M Vose","year":"1999","unstructured":"Vose M (1999) The simple genetic algorithm: foundations and theory. The MIT Press, Cambridge, MA, USA"},{"issue":"8","key":"9098_CR171","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1016\/j.epsr.2008.01.012","volume":"78","author":"L Wang","year":"2008","unstructured":"Wang L, Singh C (2008) Stochastic economic emission load dispatch through a modified particle swarm optimization algorithm. Electr Pow Syst Res 78(8):1466\u20131476","journal-title":"Electr Pow Syst Res"},{"key":"9098_CR170","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.ejor.2006.10.037","volume":"184","author":"K-J Wang","year":"2008","unstructured":"Wang K-J, Wang S-M, Chen J-C (2008) A resource portfolio planning model using sampling-based stochastic programming and genetic algorithm. Eur J Oper Res 184:327\u2013340","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9098_CR172","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<79::AID-JOS19>3.0.CO;2-H","volume":"2","author":"JP Watson","year":"1999","unstructured":"Watson JP, Rana S, Whitley LD, Howe AE (1999) The impact of approximate evaluation on the performance of search algorithms for warehouse scheduling. J Sched 2(2):79\u201398","journal-title":"J Sched"},{"issue":"1","key":"9098_CR173","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/trsc.34.1.99.12278","volume":"34","author":"W Yang","year":"2000","unstructured":"Yang W, Mathur K, Ballou RH (2000) Stochastic vehicle routing problem with restocking. Transp Sci 34(1):99\u2013112","journal-title":"Transp Sci"},{"issue":"4","key":"9098_CR174","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1111\/1475-3995.00368","volume":"9","author":"Y Yoshitomi","year":"2002","unstructured":"Yoshitomi Y (2002) A genetic algorithm approach to solving stochastic job-shop scheduling problems. Int Trans Oper Res 9(4):479\u2013495","journal-title":"Int Trans Oper Res"},{"issue":"6","key":"9098_CR175","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1111\/1475-3995.00429","volume":"10","author":"Y Yoshitomi","year":"2003","unstructured":"Yoshitomi Y, Yamaguchi R (2003) A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling. Int Trans Oper Res 10(6):577\u2013596","journal-title":"Int Trans Oper Res"},{"key":"9098_CR176","unstructured":"Zhao P-X (2007) Improved particle swarm optimization algorithm for the stochastic loader problem. In: Second IEEE conference on industrial electronics and applications (ICIEA 2007). IEEE Press, Piscataway, NJ, USA, pp 773\u2013776"},{"key":"9098_CR177","doi-asserted-by":"crossref","unstructured":"Zimmermann HJ (1991) Fuzzy set theory and its application, 2nd edn. Kluwer Academic Publishers, Boston, MA, USA","DOI":"10.1007\/978-94-015-7949-0"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-008-9098-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-008-9098-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-008-9098-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T20:39:07Z","timestamp":1709239147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-008-9098-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,19]]},"references-count":167,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["9098"],"URL":"https:\/\/doi.org\/10.1007\/s11047-008-9098-4","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,19]]}}}