{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:13:34Z","timestamp":1743056014871,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687582"},{"type":"electronic","value":"9783319687599"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68759-9_51","type":"book-chapter","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T22:33:42Z","timestamp":1507847622000},"page":"631-643","source":"Crossref","is-referenced-by-count":1,"title":["A Probabilistic Learning Algorithm for the Shortest Path Problem"],"prefix":"10.1007","author":[{"given":"Yiya","family":"Diao","sequence":"first","affiliation":[]},{"given":"Changhe","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yebin","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Junchen","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xingang","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: A new rank based version of the ant system. A computational study (1997)","key":"51_CR1"},{"key":"51_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved ant system algorithm for thevehicle routing problem. Ann. Oper. Res. 89, 319\u2013328 (1999)","journal-title":"Ann. Oper. Res."},{"unstructured":"Cordon, O., de Viana, I.F., Herrera, F., Moreno, L.: A new ACO model integrating evolutionary computation concepts: the best-worst ant system (2000)","key":"51_CR3"},{"issue":"10","key":"51_CR4","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1007\/s00500-012-0855-z","volume":"16","author":"W Deng","year":"2012","unstructured":"Deng, W., Chen, R., He, B., Liu, Y., Yin, L., Guo, J.: A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft. Comput. 16(10), 1707\u20131722 (2012)","journal-title":"Soft. Comput."},{"issue":"5","key":"51_CR5","doi-asserted-by":"crossref","first-page":"5006","DOI":"10.1016\/j.eswa.2011.10.012","volume":"39","author":"G Dong","year":"2012","unstructured":"Dong, G., Guo, W.W., Tickle, K.: Solving the traveling salesman problem using cooperative genetic ant systems. Expert Syst. Appl. 39(5), 5006\u20135011 (2012)","journal-title":"Expert Syst. Appl."},{"key":"51_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/3-540-61723-X_1029","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Gambardella, L.M.: A study of some properties of Ant-Q. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 656\u2013665. Springer, Heidelberg (1996). doi:\n10.1007\/3-540-61723-X_1029"},{"issue":"1","key":"51_CR7","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.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"51_CR8","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.: 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.)"},{"issue":"9","key":"51_CR9","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1016\/j.cor.2009.11.015","volume":"37","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2010","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Blum, C.: Beam-ACO for the travelling salesman problem with time windows. Comput. Oper. Res. 37(9), 1570\u20131583 (2010)","journal-title":"Comput. Oper. Res."},{"key":"51_CR10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/j.engappai.2014.06.026","volume":"35","author":"T Saenphon","year":"2014","unstructured":"Saenphon, T., Phimoltares, S., Lursinsap, C.: Combining new fast opposite gradient search with ant colony optimization for solving travelling salesman problem. Eng. Appl. Artif. Intell. 35, 324\u2013334 (2014)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"51_CR11","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1007\/s10489-009-0179-6","volume":"34","author":"B Shuang","year":"2011","unstructured":"Shuang, B., Chen, J., Li, Z.: Study on hybrid PS-ACO algorithm. Appl. Intell. 34(1), 64\u201373 (2011)","journal-title":"Appl. Intell."},{"issue":"8","key":"51_CR12","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.H.: Max-min ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"51_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-11857-4_21","volume-title":"Advances in Swarm Intelligence","author":"Y Xia","year":"2014","unstructured":"Xia, Y., Li, C., Zeng, S.: Three new heuristic strategies for solving travelling salesman problem. In: Tan, Y., Shi, Y., Coello, C.A.C. (eds.) ICSI 2014. LNCS, vol. 8794, pp. 181\u2013188. Springer, Cham (2014). doi:\n10.1007\/978-3-319-11857-4_21"},{"doi-asserted-by":"crossref","unstructured":"Yong Xia, C.L.: Memory-based statistical learning for the travelling salesman problem. In: 2016 IEEE Congress on Evolutionary Computation (CEC). IEEE (2016, accepted)","key":"51_CR14","DOI":"10.1109\/CEC.2016.7744160"},{"issue":"Sup01","key":"51_CR15","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/18756891.2010.9727756","volume":"3","author":"XM You","year":"2010","unstructured":"You, X.M., Liu, S., Wang, Y.M.: Quantum dynamic mechanism-based parallel ant colony optimization algorithm. Int. J. Comput. Intell. Syst. 3(Sup01), 101\u2013113 (2010)","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"51_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2013\/123738","volume":"2013","author":"HY Yun","year":"2013","unstructured":"Yun, H.Y., Jeong, S.J., Kim, K.S.: Advanced harmony search with ant colony optimization for solving the traveling salesman problem. J. Appl. Math. 2013, 1\u20138 (2013)","journal-title":"J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68759-9_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T23:46:32Z","timestamp":1507938392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}