{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:09:36Z","timestamp":1742976576410,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319069432"},{"type":"electronic","value":"9783319069449"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06944-9_17","type":"book-chapter","created":{"date-parts":[[2014,7,8]],"date-time":"2014-07-08T10:13:23Z","timestamp":1404814403000},"page":"237-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Weyland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Montemanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca Maria","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,9]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","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.: Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem. Eur. J. Oper. Res. 199, 98\u2013110 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1016\/j.cor.2009.12.005","volume":"37","author":"P Balaprakash","year":"2010","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T., Dorigo, M.: Estimation-based metaheuristics for the probabilistic traveling salesman problem. Comput. Oper. Res. 37(11), 1939\u20131951 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s11721-009-0031-y","volume":"3","author":"P Balaprakash","year":"2009","unstructured":"Balaprakash, P., Birattari, M., St\u00fctzle, T., Yuan, Z., Dorigo, M.: Estimation-based ant colony optimization and local search for the probabilistic traveling salesman problem. Swarm Intell. 3(3), 223\u2013242 (2009)","journal-title":"Swarm Intell."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-45724-0_15","volume-title":"Ant Algorithms","author":"L Bianchi","year":"2002","unstructured":"Bianchi, L., Gambardella, L.M., Dorigo, M.: Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 176\u2013187. Springer, Heidelberg (2002)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/3-540-45712-7_85","volume-title":"Parallel Problem Solving from Nature - PPSN VII","author":"L Bianchi","year":"2002","unstructured":"Bianchi, L., Gambardella, L.M., Dorigo, M.: An ant colony optimization approach to the probabilistic traveling salesman problem. In: Guerv\u00f3s, J.J.M., Adamidis, P.A., Beyer, H.-G., Fern\u00e1ndez-Villaca\u00f1as, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 883\u2013892. Springer, Heidelberg (2002)"},{"issue":"4","key":"17_CR6","doi-asserted-by":"publisher","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.: Estimation-based local search for stochastic combinatorial optimization using delta evaluations: a case study on the probabilistic traveling salesman problem. INFORMS J. Comput. 20(4), 644\u2013658 (2008)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1023\/B:JMMA.0000049380.86987.d4","volume":"3","author":"J Branke","year":"2004","unstructured":"Branke, J., Guntsch, M.: Solving the probabilistic TSP with ant colony optimization. J. Math. Model. Algorithms 3(4), 403\u2013425 (2004)","journal-title":"J. Math. Model. Algorithms"},{"issue":"9","key":"17_CR8","doi-asserted-by":"publisher","first-page":"2703","DOI":"10.1016\/j.cor.2005.02.024","volume":"33","author":"AM Campbell","year":"2006","unstructured":"Campbell, A.M.: Aggregation for the probabilistic traveling salesman problem. Comput. Oper. Res. 33(9), 2703\u20132724 (2006)","journal-title":"Comput. Oper. Res."},{"key":"17_CR9","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Proceeding of ECAL - European Conference on Artificial Life, pp. 134\u2013142 (1991)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M Dorigo","year":"1999","unstructured":"Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant algorithms for discrete optimization. Artif. Life 5, 137\u2013172 (1999)","journal-title":"Artif. Life"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. - Part B: Cybern. 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. - Part B: Cybern."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Gambardella, L.M., Montemanni, R., Weyland, D.: An enhanced ant colony system for the sequential ordering problem. In: Proceedings of OR 2011 - International Conference on Operations Research, Zurich, Switzerland (2011)","DOI":"10.1007\/978-3-642-29210-1_57"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.ejor.2012.02.038","volume":"220","author":"LM Gambardella","year":"2012","unstructured":"Gambardella, L.M., Montemanni, R., Weyland, D.: Coupling ant colony systems with strong local searches. Eur. J. Oper. Res. 220(3), 831\u2013843 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"M Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G., Seguin, R.: Stochastic vehicle routing. Eur. J. Oper. Res. 88(1), 3\u201312 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR15","unstructured":"Jaillet, P.: Probabilistic traveling salesman problems. Ph.D. thesis, M. I. T., Dept. of Civil Engineering (1985)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Local Search in Combinatorial Optimization, pp. 215\u2013310 (1997)","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Montemanni, R., Weyland, D., Gambardella, L.M.: An enhanced ant colony system for the team orienteering problem with time windows. In: ISCCS 2011 - The 2011 International Symposium on Computer Science and Society, pp. 381\u2013384. IEEE (2011)","DOI":"10.1109\/ISCCS.2011.95"},{"key":"17_CR18","unstructured":"Tsplib. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-04772-5_88","volume-title":"Computer Aided Systems Theory - EUROCAST 2009","author":"D Weyland","year":"2009","unstructured":"Weyland, D., Bianchi, L., Gambardella, L.M.: New approximation-based local search algorithms for the probabilistic traveling salesman problem. In: Moreno-D\u00edaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) EUROCAST 2009. LNCS, vol. 5717, pp. 681\u2013688. Springer, Heidelberg (2009)"},{"key":"17_CR20","unstructured":"Weyland, D., Bianchi, L., Gambardella, L.M.: New heuristics for the probabilistic traveling salesman problem. In: Proceedings of the VIII Metaheuristic International Conference (MIC 2009) (2009)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Bio-Inspired Models of Network, Information, and Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06944-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T00:52:30Z","timestamp":1675817550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06944-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319069432","9783319069449"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06944-9_17","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"9 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}