{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:54:15Z","timestamp":1725861255832},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319422909"},{"type":"electronic","value":"9783319422916"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42291-6_63","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T11:10:22Z","timestamp":1468235422000},"page":"636-643","source":"Crossref","is-referenced-by-count":0,"title":["An Augmented Artificial Bee Colony with Hybrid Learning for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Guozheng","family":"Hu","sequence":"first","affiliation":[]},{"given":"Xianghua","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Ben","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dechang","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Yao","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"issue":"2","key":"63_CR1","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 59(2), 231\u2013247 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"63_CR2","first-page":"535","volume":"58","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L.: The traveling salesman problem; a guided tour of combinatorial optimization. Math. Gaz. 58, 535\u2013536 (1985)","journal-title":"Math. Gaz."},{"key":"63_CR3","first-page":"19","volume":"11","author":"G Reinelt","year":"1992","unstructured":"Reinelt, G.: A traveling salesman problem library. J. Oper. Res. Soc. 11, 19\u201321 (1992)","journal-title":"J. Oper. Res. Soc."},{"key":"63_CR4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. Inf. J. Comput. 14, 403\u2013417 (2002)","journal-title":"Inf. J. Comput."},{"key":"63_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N Ascheuer","year":"2001","unstructured":"Ascheuer, N., Fischetti, M., Gr\u00f6tschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Program. 90, 475\u2013506 (2001)","journal-title":"Math. Program."},{"key":"63_CR6","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1016\/j.ejor.2008.10.012","volume":"198","author":"TS Chang","year":"2009","unstructured":"Chang, T.S., Wan, Y., Ooi, W.T.: A stochastic dynamic traveling salesman problem with hard time windows. Eur. J. Oper. Res. 198, 748\u2013759 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"63_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1080\/07362998308809009","volume":"1","author":"R Bellman","year":"1983","unstructured":"Bellman, R., Roosta, M.: A stochastic travelling salesman problem. Stoch. Anal. Appl. 1, 159\u2013161 (1983)","journal-title":"Stoch. Anal. Appl."},{"key":"63_CR8","doi-asserted-by":"crossref","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","volume":"235","author":"J Majumdar","year":"2011","unstructured":"Majumdar, J., Bhunia, A.K.: Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times. J. Comput. Appl. Math. 235, 3063\u20133078 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"63_CR9","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","volume":"26","author":"G Carpeneto","year":"1980","unstructured":"Carpeneto, G., Toth, P.: Some new branching and bounding criteria for the asymmetric travelling salesman problem. Manag. Sci. 26, 736\u2013743 (1980)","journal-title":"Manag. Sci."},{"key":"63_CR10","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/S0377-2217(01)00227-2","volume":"140","author":"C Moon","year":"2002","unstructured":"Moon, C., Kim, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. Eur. J. Oper. Res. 140, 606\u2013617 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"63_CR11","first-page":"81","volume":"1990","author":"L Bianco","year":"1992","unstructured":"Bianco, L., Mingozzi, A., Ricciardelli, S.: The traveling salesman problem with cumulative costs. Networks 1990, 81\u201391 (1992)","journal-title":"Networks"},{"key":"63_CR12","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/S0305-0548(02)00050-3","volume":"30","author":"IC Choi","year":"2003","unstructured":"Choi, I.C., Kim, S.I., Kim, H.S.: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. Comput. Oper. Res. 30, 773\u2013786 (2003)","journal-title":"Comput. Oper. Res."},{"key":"63_CR13","unstructured":"Jana, N., Rameshbabu, T.K., Kar, S.: Genetic algorithm for the travelling salesman problem using new crossover and mutation operators. In: Information and Management Sciences\u2013Processings of the Ninth International Conference on Information and Management Sciences (2010)"},{"key":"63_CR14","first-page":"10","volume":"6","author":"I Brezina Jr.","year":"2011","unstructured":"Brezina Jr., I., \u010ci\u010dkov\u00e1, Z.: Solving the travelling salesman problem using the ant colony optimization. Int. Sci. J. Manag. Inf. Syst. 6, 10\u201314 (2011)","journal-title":"Int. Sci. J. Manag. Inf. Syst."},{"key":"63_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/11839088_20","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"M Manfrin","year":"2006","unstructured":"Manfrin, M., Birattari, M., St\u00fctzle, T., Dorigo, M.: Parallel ant colony optimization for the traveling salesman problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., St\u00fctzle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 224\u2013234. Springer, Heidelberg (2006)"},{"key":"63_CR16","doi-asserted-by":"crossref","first-page":"4023","DOI":"10.1016\/j.asoc.2013.05.022","volume":"13","author":"M Mavrovouniotis","year":"2013","unstructured":"Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors. Appl. Soft Comput. 13, 4023\u20134037 (2013)","journal-title":"Appl. Soft Comput."},{"key":"63_CR17","doi-asserted-by":"crossref","unstructured":"Bouzidi, M., Riffi, M.E.: Discrete novel hybrid particle swarm optimization to solve travelling salesman problem. In: The Workshop on Codes, Cryptography and Communication Systems, pp. 17\u201320 (2014)","DOI":"10.1109\/WCCCS.2014.7107912"},{"key":"63_CR18","unstructured":"Zhong, W.L., Zhang, J., Chen, W.N.: A novel discrete particle swarm optimization to solve traveling salesman problem. In: IEEE Congress on Evolutionary Computation, 2007, CEC 2007, pp. 3283\u20133287 (2007)"},{"key":"63_CR19","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (Abc) algorithm. J. Global Optim. 39, 459\u2013471 (2007)","journal-title":"J. Global Optim."},{"key":"63_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (Abc) algorithm and applications. Artif. Intell. Rev. 42, 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"key":"63_CR21","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0129183115501090","volume":"26","author":"ZN Alqattan","year":"2015","unstructured":"Alqattan, Z.N., Abdullah, R.: A hybrid artificial bee colony algorithm for numerical function optimization. Int. J. Mod. Phys. C 26, 127\u2013132 (2015)","journal-title":"Int. J. Mod. Phys. C"},{"key":"63_CR22","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.ejor.2015.07.048","volume":"248","author":"D Ta\u015f","year":"2015","unstructured":"Ta\u015f, D., Gendreau, M., Jabali, O., Laporte, G.: The traveling salesman problem with time-dependent service times. Eur. J. Oper. Res. 248, 372\u2013383 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"63_CR23","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.eswa.2015.10.019","volume":"46","author":"S Maity","year":"2015","unstructured":"Maity, S., Roy, A., Maiti, M.: An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Expert Syst. Appl. 46, 196\u2013223 (2015)","journal-title":"Expert Syst. Appl."},{"key":"63_CR24","doi-asserted-by":"crossref","first-page":"3166","DOI":"10.1016\/j.amc.2010.08.049","volume":"217","author":"G Zhu","year":"2010","unstructured":"Zhu, G., Kwong, S.: Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl. Math. Comput. 217, 3166\u20133173 (2010)","journal-title":"Appl. Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42291-6_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:12:00Z","timestamp":1498313520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42291-6_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319422909","9783319422916"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42291-6_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}