{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:50:46Z","timestamp":1725742246016},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642394812"},{"type":"electronic","value":"9783642394829"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39482-9_26","type":"book-chapter","created":{"date-parts":[[2013,7,23]],"date-time":"2013-07-23T05:49:15Z","timestamp":1374558555000},"page":"224-233","source":"Crossref","is-referenced-by-count":1,"title":["Comparative Study of Artificial Bee Colony Algorithms with Heuristic Swap Operators for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Zhonghua","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijing","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuedong","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongliang","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","first-page":"2160","volume-title":"47th IEEE Conference on Decision and Control","author":"M. Aicardi","year":"2008","unstructured":"Aicardi, M., Giglio, D., Minciardi, R.: Determination of Optimal Control Strategies for TSP by Dynamic Programming. In: 47th IEEE Conference on Decision and Control, pp. 2160\u20132167. IEEE Press, Piscataway (2008)"},{"key":"26_CR2","first-page":"262","volume-title":"15th International Conference on Electronics, Communications and Computers","author":"M.R. Lopez","year":"2005","unstructured":"Lopez, M.R., Tunon, M.I.C.: Design and Use of the CPAN Branch & Bound for the Solu-tion of the Travelling Salesman Problem (TSP). In: 15th International Conference on Electronics, Communications and Computers, pp. 262\u2013267. IEEE Press, United States (2005)"},{"issue":"6","key":"26_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.orl.2004.04.001","volume":"32","author":"A.B. Kahng","year":"2004","unstructured":"Kahng, A.B., Reda, S.: Match Twice and Stitch: A New TSP Tour Construction Heuristic. Operations Research Letters\u00a032(6), 499\u2013509 (2004)","journal-title":"Operations Research Letters"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","volume":"38","author":"M. Albayrak","year":"2011","unstructured":"Albayrak, M., Allahverdi, N.: Development A New Mutation Operator to Solve the Traveling Salesman Problem by Aid of Genetic Algorithms. Expert Systems with Applications\u00a038(3), 1313\u20131320 (2011)","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"26_CR5","doi-asserted-by":"publisher","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"X. Geng","year":"2011","unstructured":"Geng, X., Chen, Z., Yang, W., Shi, D., Zhao, K.: Solving the Traveling Salesman Problem Based on an Adaptive Simulated Annealing Algorithm with Greedy Search. Applied Soft Computing\u00a011(4), 3680\u20133689 (2011)","journal-title":"Applied Soft Computing"},{"issue":"7","key":"26_CR6","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ins.2010.12.003","volume":"181","author":"J. Zhao","year":"2011","unstructured":"Zhao, J., Liu, Q., Wang, W., Wei, Z., Shi, P.: A Parallel Immune Algorithm for Traveling Salesman Problem and Its Application on Cold Rolling Scheduling. Information Sciences\u00a0181(7), 1212\u20131223 (2011)","journal-title":"Information Sciences"},{"issue":"4","key":"26_CR7","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/TSMCB.2006.888421","volume":"37","author":"M. Saadatmand-Tarzjan","year":"2007","unstructured":"Saadatmand-Tarzjan, M., Khademi, M., Akbarzadeh-T, M., Abrishami, M.H.: A Novel Constructive-Optimizer Neural Network for the Traveling Salesman Problem. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics\u00a037(4), 754\u2013770 (2007)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics"},{"key":"26_CR8","first-page":"297","volume-title":"3rd International Conference on Natural Computation","author":"J. Lu","year":"2007","unstructured":"Lu, J., Fang, N., Shao, D., Liu, C.: An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem. In: 3rd International Conference on Natural Computation, pp. 297\u2013301. IEEE Press, Piscataway (2007)"},{"key":"26_CR9","first-page":"435","volume-title":"2nd International Conference on Computer and Automation Engineering","author":"G. Vahdati","year":"2010","unstructured":"Vahdati, G., Ghouchani, S.Y., Yaghoobi, M.: A Hybrid Search Algorithm with Hopfield Neural Network and Genetic algorithm for Solving Traveling Salesman Problem. In: 2nd International Conference on Computer and Automation Engineering, pp. 435\u2013439. IEEE Press, Piscataway (2010)"},{"key":"26_CR10","first-page":"7","volume-title":"2nd World Congress on Nature and Biologically Inspired Computing","author":"A. Banharnsakun","year":"2010","unstructured":"Banharnsakun, A., Achalakul, T., Sirinaovakul, B.: ABC-GSX: A Hybrid Method for Solving the Traveling Salesman Problem. In: 2nd World Congress on Nature and Biologically Inspired Computing, pp. 7\u201312. IEEE Press, Piscataway (2010)"},{"key":"26_CR11","first-page":"1","volume-title":"Neural Computing & Applications","author":"M.S. K\u0131ran","year":"2012","unstructured":"K\u0131ran, M.S., \u0130\u015fcan, H., G\u00fcnd\u00fcz, M.: The Analysis of Discrete Artificial Bee Colony Algorithm with Neighborhood Operator on Traveling Salesman Problem. In: Neural Computing & Applications, pp. 1\u201313. Springer, London (2012) (in press)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/INISTA.2011.5946125","volume-title":"2011 International Symposium on Innovations in Intelligent Systems and Applications","author":"D. Karaboga","year":"2011","unstructured":"Karaboga, D., Gorkemli, B.: A Combinatorial Artificial Bee Colony Algorithm for Traveling Salesman Problem. In: 2011 International Symposium on Innovations in Intelligent Systems and Applications, pp. 50\u201353. IEEE Press, Piscataway (2011)"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.asoc.2011.08.040","volume":"12","author":"G. Li","year":"2012","unstructured":"Li, G., Niu, P., Xiao, X.: Development and Investigation of Efficient Artificial Bee Colony Algorithm for Numerical Function Optimization. Applied Soft Computing\u00a012(1), 320\u2013332 (2012)","journal-title":"Applied Soft Computing"},{"issue":"11","key":"26_CR14","doi-asserted-by":"publisher","first-page":"3421","DOI":"10.1016\/j.asoc.2012.06.019","volume":"12","author":"Z. Su","year":"2012","unstructured":"Su, Z., Wang, P., Shen, J., Li, Y., Zhang, Y., Hu, E.: Automatic Fuzzy Partitioning Approach Using Variable String Length Artificial Bee Colony (VABC) Algorithm. Applied Soft Computing\u00a012(11), 3421\u20133441 (2012)","journal-title":"Applied Soft Computing"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.asoc.2011.08.038","volume":"12","author":"M.H. Kashan","year":"2012","unstructured":"Kashan, M.H., Nahavandi, N., Kashan, A.H.: DisABC: A New Artificial Bee Colony Algorithm for Binary Optimization. Applied Soft Computing\u00a012(1), 342\u2013352 (2012)","journal-title":"Applied Soft Computing"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39482-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T02:46:01Z","timestamp":1557974761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39482-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642394812","9783642394829"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39482-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}