{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:37:04Z","timestamp":1766180224194},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,6,4]],"date-time":"2009-06-04T00:00:00Z","timestamp":1244073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s11721-009-0031-y","type":"journal-article","created":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T23:51:45Z","timestamp":1244245905000},"page":"223-242","source":"Crossref","is-referenced-by-count":47,"title":["Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem"],"prefix":"10.1007","volume":"3","author":[{"given":"Prasanna","family":"Balaprakash","sequence":"first","affiliation":[]},{"given":"Mauro","family":"Birattari","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]},{"given":"Zhi","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Dorigo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,4]]},"reference":[{"key":"31_CR1","unstructured":"Applegate, D., Bixby, R. E., Chvatal, V., & Cook, W. J. (2001). Concorde\u2014a code for solving traveling salesman problems. URL http:\/\/www.math.princeton.edu\/tsp\/concorde.html ."},{"key":"31_CR2","series-title":"LNCS","first-page":"113","volume-title":"Hybrid metaheuristics","author":"P. Balaprakash","year":"2007","unstructured":"Balaprakash, P., Birattari, M., & St\u00fctzle, T. (2007). Improvement strategies for the F-Race algorithm: Sampling design and iterative refinement. In T. Bartz-Beielstein, M. Blesa, C. Blum, B. Naujoks, A. Roli, G. Rudolph, & M. Sampels (Eds.), LNCS : Vol. 4771. Hybrid metaheuristics, HM 2007 (pp. 113\u2013127). Berlin: Springer."},{"key":"31_CR3","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T., Yuan, Z., & Dorigo, M. (2008). Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem. IRIDIA Supplementary page. URL http:\/\/iridia.ulb.ac.be\/supp\/IridiaSupp2008-018\/ ."},{"issue":"1","key":"31_CR4","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ejor.2008.11.027","volume":"199","author":"P. Balaprakash","year":"2009","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T., & Dorigo, M. (2009). Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem. European Journal of Operational Research, 199(1), 98\u2013110.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"31_CR5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"J. L. Bentley","year":"1992","unstructured":"Bentley, J. L. (1992). Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4(4), 387\u2013411.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"31_CR6","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(93)90145-D","volume":"65","author":"D. Bertsimas","year":"1993","unstructured":"Bertsimas, D., & Howell, L. (1993). Further results on the probabilistic traveling salesman problem. European Journal of Operational Research, 65(1), 68\u201395.","journal-title":"European Journal of Operational Research"},{"key":"31_CR7","unstructured":"Bianchi, L. (2006). Ant colony optimization and local search for the probabilistic traveling salesman problem: a case study in stochastic combinatorial optimization. Ph.D. thesis, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium."},{"issue":"1","key":"31_CR8","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, A. (2007). Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem. European Journal of Operational Research, 176(1), 131\u2013144.","journal-title":"European Journal of Operational Research"},{"key":"31_CR9","unstructured":"Bianchi, L., & Gambardella, L. M. Ant colony optimization and local search based on exact and estimated objective values for the probabilistic traveling salesman problem (Technical Report IDSIA-06-07). IDSIA, USI-SUPSI, Manno, Switzerland, June 2007."},{"key":"31_CR10","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-45724-0_15","volume-title":"Ant algorithms, third international workshop","author":"L. Bianchi","year":"2002","unstructured":"Bianchi, L., Gambardella, L., & Dorigo, M. (2002a). Solving the homogeneous probabilistic travelling salesman problem by the ACO metaheuristic. In M. Dorigo, G. Di Caro, & M. Sampels (Eds.), LNCS : Vol. 2463. Ant algorithms, third international workshop, ANTS 2002 (pp. 176\u2013187). Berlin: Springer."},{"key":"31_CR11","series-title":"LNCS","first-page":"883","volume-title":"7th international conference on parallel problem solving from nature","author":"L. Bianchi","year":"2002","unstructured":"Bianchi, L., Gambardella, L. M., & Dorigo, M. (2002b). An ant colony optimization approach to the probabilistic traveling salesman problem. In J. J. Guerv\u00f3s, P. Adamidis, H. Beyer, J. L. Mart\u00edn, & H. P. Schwefel (Eds.), LNCS : Vol. 2439. 7th international conference on parallel problem solving from nature, PPSN VII (pp. 883\u2013892). Berlin: Springer."},{"issue":"1","key":"31_CR12","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. European Journal of Operational Research, 162(1), 206\u2013219.","journal-title":"European Journal of Operational Research"},{"key":"31_CR13","unstructured":"Birattari, M. (2004). The problem of tuning metaheuristics as seen from a machine learning perspective. Ph.D. thesis, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium."},{"key":"31_CR14","series-title":"Studies in computational intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-00483-4","volume-title":"Tuning metaheuristics: a machine learning perspective","author":"M. Birattari","year":"2009","unstructured":"Birattari, M. (2009). Tuning metaheuristics: a machine learning perspective. Studies in computational intelligence (Vol.\u00a0197). Berlin: Springer."},{"key":"31_CR15","series-title":"Operations research\/computer science interfaces series","first-page":"189","volume-title":"Metaheuristics\u2014progress in complex systems optimization","author":"M. Birattari","year":"2006","unstructured":"Birattari, M., Balaprakash, P., & Dorigo, M. (2006). The ACO\/F-RACE algorithm for combinatorial optimization under uncertainty. In K. F. Doerner, M. Gendreau, P. Greistorfer, W. J. Gutjahr, R. F. Hartl, & M. Reimann (Eds.), Operations research\/computer science interfaces series : Vol. 44. Metaheuristics\u2014progress in complex systems optimization (pp. 189\u2013203). Berlin: Springer."},{"issue":"4","key":"31_CR16","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1287\/ijoc.1080.0276","volume":"20","author":"M. Birattari","year":"2008","unstructured":"Birattari, M., Balaprakash, P., St\u00fctzle, T., & Dorigo, M. (2008). Estimation-based local search for stochastic combinatorial optimization using delta evaluations: A case study in the probabilistic traveling salesman problem. INFORMS Journal on Computing, 20(4), 644\u2013658.","journal-title":"INFORMS Journal on Computing"},{"key":"31_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","volume-title":"Swarm intelligence: from natural to artificial systems","author":"E. Bonabeau","year":"1999","unstructured":"Bonabeau, E., Dorigo, M., & Theraulaz, G. (1999). Swarm intelligence: from natural to artificial systems. London: Oxford University Press."},{"issue":"4","key":"31_CR18","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. Journal of Mathematical Modelling and Algorithms, 3(4), 403\u2013425.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"1","key":"31_CR19","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). A new rank based version of the ant system: A computational study. Central European Journal for Operations Research and Economics, 7(1), 25\u201338.","journal-title":"Central European Journal for Operations Research and Economics"},{"issue":"2\u20133","key":"31_CR20","first-page":"177","volume":"9","author":"O. Cord\u00f3n","year":"2002","unstructured":"Cord\u00f3n, O., de Viana, I. F., & Herrera, F. (2002). Analysis of the best-worst ant system and its variants on the TSP. Mathware and Soft Computing, 9(2\u20133), 177\u2013192.","journal-title":"Mathware and Soft Computing"},{"key":"31_CR21","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G. Di Caro","year":"1998","unstructured":"Di Caro, G., & Dorigo, M. (1998). AntNet: Distributed stigmergetic control for communications networks. Journal of Artificial Intelligence Research, 9, 317\u2013365.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"9","key":"31_CR22","doi-asserted-by":"crossref","first-page":"1462","DOI":"10.4249\/scholarpedia.1462","volume":"2","author":"M. Dorigo","year":"2007","unstructured":"Dorigo, M., & Birattari, M. (2007). Swarm intelligence. Scholarpedia, 2(9), 1462.","journal-title":"Scholarpedia"},{"issue":"1","key":"31_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., & Gambardella, L. M. (1997). Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), 53\u201366.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"31_CR24","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. Cambridge: MIT Press."},{"key":"31_CR25","volume-title":"Statistical methods for research workers","author":"R. A. Fisher","year":"1925","unstructured":"Fisher, R. A. (1925). Statistical methods for research workers. Edinburgh: Oliver and Boyd."},{"key":"31_CR26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"M. Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G., & S\u00e9guin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88, 3\u201312.","journal-title":"European Journal of Operational Research"},{"key":"31_CR27","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1007\/978-3-540-39816-5_2","volume-title":"Stochastic algorithms: foundations and applications","author":"W. J. Gutjahr","year":"2003","unstructured":"Gutjahr, W. J. (2003). A converging ACO algorithm for stochastic combinatorial optimization. In A. Albrecht & K. Steinhofl (Eds.), LNCS : Vol. 2827. Stochastic algorithms: foundations and applications (pp. 10\u201325). Berlin: Springer."},{"key":"31_CR28","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-540-28646-2_21","volume-title":"Ant colony optimization and swarm intelligence, 5th international workshop","author":"W. J. Gutjahr","year":"2004","unstructured":"Gutjahr, W. J. (2004). S-ACO: An ant based approach to combinatorial optimization under uncertainty. In M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada, & T. St\u00fctzle (Eds.), LNCS : Vol. 3172. Ant colony optimization and swarm intelligence, 5th international workshop, ANTS 2004 (pp. 238\u2013249). Berlin: Springer."},{"key":"31_CR29","volume-title":"Stochastic local search: foundations and applications","author":"H. Hoos","year":"2005","unstructured":"Hoos, H., & St\u00fctzle, T. (2005). Stochastic local search: foundations and applications. San Mateo: Morgan Kaufmann."},{"key":"31_CR30","unstructured":"Jaillet, P. (1985). Probabilistic traveling salesman problems. Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA."},{"key":"31_CR31","first-page":"215","volume-title":"Local search in combinatorial optimization","author":"D. S. Johnson","year":"1997","unstructured":"Johnson, D. S., & McGeoch, L. A. (1997). The travelling salesman problem: a case study in local optimization. In E. H. L. Aarts & J. K. Lenstra (Eds.), Local search in combinatorial optimization (pp. 215\u2013310). Wiley: New York."},{"key":"31_CR32","unstructured":"Johnson, D. S., McGeoch, L.A., Rego, C, & Glover, F. (2001). 8th DIMACS implementation challenge. URL http:\/\/www.research.att.com\/~dsj\/chtsp\/ ."},{"key":"31_CR33","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). A priori optimization of the probabilistic traveling salesman problem. Operations Research, 42, 543\u2013549.","journal-title":"Operations Research"},{"issue":"3","key":"31_CR34","first-page":"299","volume":"5","author":"O. Martin","year":"1991","unstructured":"Martin, O., Otto, S. W., & Felten, E. W. (1991). Large-step Markov chains for the traveling salesman problem. Complex Systems, 5(3), 299\u2013326.","journal-title":"Complex Systems"},{"key":"31_CR35","unstructured":"St\u00fctzle, T. (2002). ACOTSP: A software package of various ant colony optimization algorithms applied to the symmetric traveling salesman problem. URL http:\/\/www.aco-metaheuristic.org\/aco-code\/ ."},{"issue":"8","key":"31_CR36","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., & Hoos, H. (2000). $\\mathcal{MAX}$ \u2013 $\\mathcal{MIN}$ ant system. Future Generation Computer Systems, 16(8), 889\u2013914.","journal-title":"Future Generation Computer Systems"},{"issue":"2","key":"31_CR37","doi-asserted-by":"crossref","first-page":"99","DOI":"10.2307\/3001913","volume":"5","author":"J. W. Tukey","year":"1949","unstructured":"Tukey, J. W. (1949). Comparing individual means in the analysis of variance. Biometrics, 5(2), 99\u2013114.","journal-title":"Biometrics"}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-009-0031-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-009-0031-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-009-0031-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T01:06:45Z","timestamp":1633568805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-009-0031-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,4]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["31"],"URL":"https:\/\/doi.org\/10.1007\/s11721-009-0031-y","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,4]]}}}