{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:01Z","timestamp":1725543421530},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540367079"},{"type":"electronic","value":"9783540368601"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11802372_34","type":"book-chapter","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T10:26:36Z","timestamp":1153736796000},"page":"351-361","source":"Crossref","is-referenced-by-count":2,"title":["An Improved Multi-agent Approach for Solving Large Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Yu-An","family":"Tan","sequence":"first","affiliation":[]},{"given":"Xin-Hua","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Li-Ning","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Xue-Lan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shu-Wu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.orl.2005.01.002","volume":"34","author":"V.G. Deineko","year":"2006","unstructured":"Deineko, V.G., Hoffmann, M., Okamoto, Y., et al.: The Traveling Salesman Problem with Few Inner Points. Operations Research Letters\u00a034(1), 106\u2013110 (2006)","journal-title":"Operations Research Letters"},{"issue":"12","key":"34_CR2","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.530","volume":"9","author":"G.D. Caro","year":"1998","unstructured":"Caro, G.D., Dorigo, M.: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificial Intelligence Research\u00a09(12), 317\u2013365 (1998)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1109\/TSMCB.2004.828283","volume":"34","author":"H.K. Tsai","year":"2004","unstructured":"Tsai, H.K., Yang, J.M., Tsai, Y.F., et al.: An Evolutionary Algorithm for Large Traveling Salesman Problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics\u00a034(4), 1718\u20131729 (2004)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"issue":"1","key":"34_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.neucom.2004.02.006","volume":"62","author":"K.S. Leung","year":"2004","unstructured":"Leung, K.S., Jin, H.D., Xu, Z.B.: An Expanding Self-organizing Neural Network for the Traveling Salesman Problem. Neurocomputing\u00a062(1), 267\u2013292 (2004)","journal-title":"Neurocomputing"},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M. Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: Tabu Search Heuristic for the Undirected Selective Traveling Salesman Problem. European Journal of Operational Research\u00a0106(2), 539\u2013545 (1998)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"34_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1162\/neco.1996.8.2.416","volume":"8","author":"M. Budinich","year":"1996","unstructured":"Budinich, M.: Self-organizing Neural Network for the Traveling Salesman Problem that is Competitive with Simulated Annealing. Neural Computation\u00a08(2), 416 (1996)","journal-title":"Neural Computation"},{"issue":"1","key":"34_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03052150500289370","volume":"38","author":"Y.P. Wang","year":"2006","unstructured":"Wang, Y.P., Han, L.X., Li, Y.H.: A New Encoding based Genetic Algorithm for the Traveling Salesman Problem. Engineering Optimization\u00a038(1), 1\u201313 (2006)","journal-title":"Engineering Optimization"},{"issue":"10","key":"34_CR8","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Orlin, J.B., Tiwari, A.: Greedy Genetic Algorithm for the Quadratic Assignment Problem. Computers and Operations Research\u00a027(10), 917\u2013934 (2002)","journal-title":"Computers and Operations Research"},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G.: The Traveling Salesman Problem: an Overview of Exact and Approximate Algorithms. European Journal of Operational Research\u00a059(2), 231\u2013247 (1992)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"34_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M. Padberg","year":"1987","unstructured":"Padberg, M., Rinaldi, G.: Optimization of a 532-city Symmetric Genetic Traveling Salesman Problem by Branch and Cut. Operational Research Letters\u00a06(1), 1\u20137 (1987)","journal-title":"Operational Research Letters"},{"issue":"6","key":"34_CR11","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"Croes, G.A.: A Method for Solving Traveling Salesman Problems. Operational Research\u00a06(6), 791\u2013812 (1958)","journal-title":"Operational Research"},{"issue":"2","key":"34_CR12","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer Solution of the Traveling Salesman Problem. Bell System Technology Journal\u00a044(2), 2245\u20132269 (1965)","journal-title":"Bell System Technology Journal"},{"issue":"2","key":"34_CR13","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operational Research\u00a021(2), 498\u2013516 (1973)","journal-title":"Operational Research"},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02601639","volume":"63","author":"O. Martin","year":"1996","unstructured":"Martin, O., Otto, S.W.: Combining Simulated Annealing with Local Search Heuristic. Annual Operational Research\u00a063(2), 57\u201375 (1996)","journal-title":"Annual Operational Research"},{"key":"34_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03315-9","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)","edition":"3"},{"issue":"3","key":"34_CR16","first-page":"299","volume":"5","author":"O. Martin","year":"1991","unstructured":"Martin, O., Otto, S.W., Felten, E.W.: Large Step Markov Chain for the Traveling Salesman. Journal of Complex System\u00a05(3), 299 (1991)","journal-title":"Journal of Complex System"},{"issue":"6","key":"34_CR17","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/4235.974843","volume":"5","author":"R. Baraglia","year":"2001","unstructured":"Baraglia, R., Hidalgo, J.I., Perego, R.: A Hybrid Heuristic for the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation\u00a05(6), 613\u2013622 (2001)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"34_CR18","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 Agent. IEEE Transactions on System, Man, and Cybernetics, Part B: Cybernetics\u00a026(1), 29\u201342 (1996)","journal-title":"IEEE Transactions on System, Man, and Cybernetics, Part B: Cybernetics"},{"issue":"1","key":"34_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ins.2003.11.008","volume":"166","author":"C.F. Tsai","year":"2004","unstructured":"Tsai, C.F., Tsai, C.W., Tseng, C.C.: A New Hybrid Heuristic Approach for Solving Large Traveling Salesman Problem. Information Sciences\u00a0166(1), 67\u201381 (2004)","journal-title":"Information Sciences"},{"issue":"1","key":"34_CR20","doi-asserted-by":"publisher","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 Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"4","key":"34_CR21","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - A Traveling Salesman Problem Library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"34_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"K. Smith","year":"1999","unstructured":"Smith, K.: Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research. INFORMS Journal Computer\u00a011(1), 15\u201334 (1999)","journal-title":"INFORMS Journal Computer"},{"issue":"9","key":"34_CR23","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/S0893-6080(99)00063-5","volume":"12","author":"N. Aras","year":"1999","unstructured":"Aras, N., Oommen, J., Altinel, I.K.: Kohonen Network Incorporating Explicit Statistics and Its Application to the Traveling Salesman Problem. Neural Networks\u00a012(9), 1273\u20131284 (1999)","journal-title":"Neural Networks"},{"issue":"5","key":"34_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/S0305-0548(99)00065-9","volume":"27","author":"I.K. Altinel","year":"2000","unstructured":"Altinel, I.K., Aras, N., Oommen, J.: Fast, Efficient and Accurate Solutions to the Hamiltonian Path Problem Using Neural Approaches. Computer and Operations Research\u00a027(5), 461\u2013494 (2000)","journal-title":"Computer and Operations Research"},{"issue":"4","key":"34_CR25","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TNN.2003.811562","volume":"14","author":"N. Aras","year":"2003","unstructured":"Aras, N., Altinel, I.K., Oommen, J.: A Kohonen-Like Decomposition Method for the Euclidean Traveling Salesman Problem-KNIES_DECOMPOSE. IEEE Transactions on Neural Networks\u00a014(4), 869\u2013890 (2003)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"2","key":"34_CR26","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1012751230791","volume":"14","author":"E.M. Casermeiro","year":"2001","unstructured":"Casermeiro, E.M., Marin, G.G., Perez, J.M.: An Efficient Multi-valued Hopfield Network for the Traveling Salesman Problem. Neural Processing Letters\u00a014(2), 203\u2013216 (2001)","journal-title":"Neural Processing Letters"},{"issue":"2","key":"34_CR27","first-page":"15","volume":"124","author":"S.P. Coy","year":"1999","unstructured":"Coy, S.P., Golden, B.L., Wasil, E.A.: A Computational Study of Smoothing Heuristics for the Traveling Salesman Problem. European Journal of Operational Research\u00a0124(2), 15\u201327 (1999)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"34_CR28","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C. Voudouris","year":"1999","unstructured":"Voudouris, C., Tsang, E.: Guided Local Search and Its Application to the Traveling Salesman Problem. European Journal of Operational Research\u00a0113(1), 469\u2013499 (1999)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"34_CR29","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/3468.995530","volume":"32","author":"J.W. Pepper","year":"2002","unstructured":"Pepper, J.W., Golden, B.L., Wasil, E.A.: Solving the Traveling Salesman Problem with Annealing-Based Heuristics: A Computational Study. IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans\u00a032(1), 72\u201377 (2002)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics Part A: Systems and Humans"},{"issue":"5","key":"34_CR30","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"L. Buriol","year":"2004","unstructured":"Buriol, L., Franca, P.M.: A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. Journal of Heuristics\u00a010(5), 483\u2013506 (2004)","journal-title":"Journal of Heuristics"}],"container-title":["Lecture Notes in Computer Science","Agent Computing and Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11802372_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:25:18Z","timestamp":1619508318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11802372_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540367079","9783540368601"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11802372_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}