{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T05:10:03Z","timestamp":1781068203784,"version":"3.54.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T00:00:00Z","timestamp":1325808000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s00521-011-0794-0","type":"journal-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T07:37:15Z","timestamp":1325835435000},"page":"9-21","source":"Crossref","is-referenced-by-count":65,"title":["The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Mustafa Servet","family":"K\u0131ran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haz\u0131m","family":"\u0130\u015fcan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mesut","family":"G\u00fcnd\u00fcz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,1,6]]},"reference":[{"key":"794_CR1","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University"},{"key":"794_CR2","unstructured":"Zhong W-L, Zhang J, Chen W-N (2007) A novel discrete particle swarm optimization to solve traveling salesman problem. In: Proceedings of the IEEE congress on evolutionary computation, pp 3283\u20133287"},{"key":"794_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s00521-007-0127-5","volume":"17","author":"J Ma","year":"2008","unstructured":"Ma J, Yang T, Hou Z-G, Tan M, Liu D (2008) Neurodynamic programming: a case study of the travelling salesman problem. Neural Comput Appl 17:347\u2013355","journal-title":"Neural Comput Appl"},{"key":"794_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.advengsoft.2008.05.004","volume":"40","author":"A U\u011fur","year":"2009","unstructured":"U\u011fur A, Ayd\u0131n D (2009) An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms. Adv Eng Softw 40:341\u2013349","journal-title":"Adv Eng Softw"},{"issue":"2","key":"794_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0167-6377(90)90052-7","volume":"9","author":"A Langevin","year":"1990","unstructured":"Langevin A, Soumis F, Desrosiers J (1990) Classification of travelling salesman problem formulations. Oper Res Lett 9(2):127\u2013132","journal-title":"Oper Res Lett"},{"issue":"2","key":"794_CR6","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 (1992) The traveling salesman problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(2):231\u2013247","journal-title":"Eur J Oper Res"},{"issue":"2","key":"794_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0167-6377(92)90069-F","volume":"12","author":"AP Punnen","year":"1990","unstructured":"Punnen AP (1990) Travelling salesman problem under categorization. Oper Res Lett 12(2):89\u201395","journal-title":"Oper Res Lett"},{"issue":"3","key":"794_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bekta\u015f","year":"2006","unstructured":"Bekta\u015f T (2006) The multiple traveling salesman problems: an overview of formulations and solution procedures. Omega 34(3):209\u2013219","journal-title":"Omega"},{"issue":"3","key":"794_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"211","author":"C Rego","year":"2011","unstructured":"Rego C, Gamboa D, Glover F, Osterman C (2011) Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur J Oper Res 211(3):427\u2013441","journal-title":"Eur J Oper Res"},{"key":"794_CR10","unstructured":"Applegate DL, Bixby RE, Chvatal V, Cook WJ (2007) The traveling salesman problem: a computational study. Princeton series in applied mathematics. Princeton University Press, Princeton. ISBN:978-0-691-12993-8"},{"key":"794_CR11","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8:687\u2013697","journal-title":"Appl Soft Comput"},{"key":"794_CR12","unstructured":"Akay B (2009) Performance analysis of artificial bee colony algorithm on numerical optimization problems. PhD thesis in Turkish, Erciyes University, Graduate School of Natural and Applied Sciences, Kayseri, pp 70\u201372"},{"key":"794_CR13","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 (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459\u2013471","journal-title":"J Glob Optim"},{"key":"794_CR14","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/j.jfranklin.2008.11.003","volume":"346","author":"N Karaboga","year":"2009","unstructured":"Karaboga N (2009) A new design method based on artificial bee colony algorithm for digital IIR filters. J Frankl Inst 346:328\u2013348","journal-title":"J Frankl Inst"},{"key":"794_CR15","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A comparative study of artificial bee colony algorithm. Appl Math Comput 214:108\u2013132","journal-title":"Appl Math Comput"},{"key":"794_CR16","first-page":"5081","volume":"5-12B","author":"P-W Tsai","year":"2009","unstructured":"Tsai P-W, Pan J-S, Liao B-Y, Chu S-C (2009) Enhanced artificial bee colony optimization. Int J Innov Comput Inf Control 5-12B:5081\u20135092","journal-title":"Int J Innov Comput Inf Control"},{"key":"794_CR17","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf constrained minimum spanning tree problem. Appl Soft Comput 9:625\u2013631","journal-title":"Appl Soft Comput"},{"key":"794_CR18","doi-asserted-by":"crossref","first-page":"5682","DOI":"10.1016\/j.eswa.2010.02.042","volume":"37","author":"B Alatas","year":"2010","unstructured":"Alatas B (2010) Chaotic bee colony algorithms for global numerical optimization. Expert Syst Appl 37:5682\u20135687","journal-title":"Expert Syst Appl"},{"key":"794_CR19","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 (2010) Gbes-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217:3166\u20133173","journal-title":"Appl Math Comput"},{"key":"794_CR20","doi-asserted-by":"crossref","unstructured":"Akay B, Karaboga D (2010) A modified artificial bee colony algorithm for real parameter optimization. Inf Sci. doi: 10.1016\/j.ins.2010.07.015","DOI":"10.1016\/j.ins.2010.07.015"},{"key":"794_CR21","doi-asserted-by":"crossref","first-page":"4761","DOI":"10.1016\/j.eswa.2009.11.003","volume":"37","author":"C Zhang","year":"2010","unstructured":"Zhang C, Ouyang D, Ning J (2010) An artificial bee colony approach for clustering. Expert Syst Appl 37:4761\u20134767","journal-title":"Expert Syst Appl"},{"key":"794_CR22","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.engappai.2010.01.020","volume":"23","author":"SL Sabat","year":"2010","unstructured":"Sabat SL, Udgata SK, Abraham A (2010) Artificial bee colony algorithm for small signal model parameter extraction of MESFET. Eng Appl Artif Intell 23:689\u2013694","journal-title":"Eng Appl Artif Intell"},{"key":"794_CR23","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/j.ast.2010.04.008","volume":"14","author":"C Xu","year":"2010","unstructured":"Xu C, Duan H, Liu F (2010) Chaotic artificial bee colony approach to uninhabited combat air vehicle (UCAV) path planning. Aerosp Sci Technol 14:535\u2013541","journal-title":"Aerosp Sci Technol"},{"key":"794_CR24","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.cor.2011.06.007","volume":"39","author":"W-F Gao","year":"2012","unstructured":"Gao W-F, Liu S-Y (2012) A modified artificial bee colony algorithm. Comput Oper Res 39:687\u2013697","journal-title":"Comput Oper Res"},{"key":"794_CR25","doi-asserted-by":"crossref","first-page":"2888","DOI":"10.1016\/j.asoc.2010.11.025","volume":"11","author":"A Barnharnsakun","year":"2011","unstructured":"Barnharnsakun A, Achalakul T, Sirinaovakul B (2011) The best-so-far selection in artificial bee colony algorithm. Appl Soft Comput 11:2888\u20132901","journal-title":"Appl Soft Comput"},{"key":"794_CR26","doi-asserted-by":"crossref","first-page":"3508","DOI":"10.1016\/j.ins.2011.04.024","volume":"181","author":"F Kang","year":"2011","unstructured":"Kang F, Lie J, Ma Z (2011) Rosenbrock artificial bee colony algorithm for accurate global optimization of numerical functions. Inf Sci 181:3508\u20133531","journal-title":"Inf Sci"},{"key":"794_CR27","doi-asserted-by":"crossref","first-page":"3021","DOI":"10.1016\/j.asoc.2010.12.001","volume":"11","author":"D Karaboga","year":"2011","unstructured":"Karaboga D, Akay B (2011) A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Appl Soft Comput 11:3021\u20133031","journal-title":"Appl Soft Comput"},{"key":"794_CR28","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2009.12.025","volume":"11","author":"D Karaboga","year":"2011","unstructured":"Karaboga D, Ozturk C (2011) A novel clustering approach: artificial bee colony (ABC) algorithm. Appl Soft Comput 11:652\u2013657","journal-title":"Appl Soft Comput"},{"key":"794_CR29","doi-asserted-by":"crossref","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"MF Tasgetiren","year":"2011","unstructured":"Tasgetiren MF, Pan Q-K, Suganthan PN, Chen AH-L (2011) A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf Sci 181:3459\u20133475","journal-title":"Inf Sci"},{"key":"794_CR30","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181:2455\u20132468","journal-title":"Inf Sci"},{"key":"794_CR31","first-page":"13785","volume":"38","author":"M-H Horng","year":"2011","unstructured":"Horng M-H (2011) Multilevel thresholding selection based on the artificial bee colony algorithm for image segmentation. Expert Syst Appl 38:13785\u201313791","journal-title":"Expert Syst Appl"},{"key":"794_CR32","doi-asserted-by":"crossref","first-page":"5205","DOI":"10.1016\/j.asoc.2011.05.039","volume":"11","author":"M Ma","year":"2011","unstructured":"Ma M, Lieang J, Guo M, Fan Y, Yin Y (2011) SAR image segmentation based on artificial bee colony algorithm. Appl Soft Comput 11:5205\u20135214","journal-title":"Appl Soft Comput"},{"key":"794_CR33","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.asoc.2009.12.008","volume":"11","author":"SN Omkar","year":"2011","unstructured":"Omkar SN, Senthilnath J, Khandelwal R, Naik GN, Gopalakrishman S (2011) Artificial bee colony (ABC) for multi-objective design optimization of composite structures. Appl Soft Comput 11:489\u2013499","journal-title":"Appl Soft Comput"},{"key":"794_CR34","doi-asserted-by":"crossref","unstructured":"Manoj VJ, Elias E (2011) Artificial bee colony algorithm for the design of multiplier-less nonuniform filter bank transmultiplexer. Inf Sci. doi: 10.1016\/j.ins.2011.02.023","DOI":"10.1016\/j.ins.2011.02.023"},{"key":"794_CR35","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.anucene.2011.01.009","volume":"38","author":"IMS Oliveira De","year":"2011","unstructured":"De Oliveira IMS, Schirru R (2011) Swarm intelligence of artificial bees applied to in-core fuel management optimization. Ann Energy 38:1039\u20131045","journal-title":"Ann Energy"},{"key":"794_CR36","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1016\/j.engappai.2011.03.009","volume":"22","author":"S Samanta","year":"2011","unstructured":"Samanta S, Chakraborty S (2011) Parametric optimization of some non-traditional machining processes using artificial bee colony algorithm. Eng Appl Artif Intell 22:946\u2013957","journal-title":"Eng Appl Artif Intell"},{"key":"794_CR37","doi-asserted-by":"crossref","first-page":"1465","DOI":"10.1016\/j.cor.2010.10.028","volume":"38","author":"W-C Yeh","year":"2011","unstructured":"Yeh W-C, Hsieh T-J (2011) Solving reliability redundancy allocation problems using an artificial bee colony algorithm. Comput Oper Res 38:1465\u20131473","journal-title":"Comput Oper Res"},{"key":"794_CR38","doi-asserted-by":"crossref","first-page":"2406","DOI":"10.1016\/j.asoc.2010.09.003","volume":"11","author":"M Sonmez","year":"2011","unstructured":"Sonmez M (2011) Artficial bee colony algorithm for optimization of truss structures. Appl Soft Comput 11:2406\u20132418","journal-title":"Appl Soft Comput"},{"key":"794_CR39","doi-asserted-by":"crossref","first-page":"1927","DOI":"10.1016\/j.jfranklin.2011.05.012","volume":"348","author":"H Gozde","year":"2011","unstructured":"Gozde H, Taplamacioglu MC (2011) Comparative performance analysis of artificial bee colony algorithms for automatic voltage regulator (AVR) systems. J Frankl Inst 348:1927\u20131946","journal-title":"J Frankl Inst"},{"key":"794_CR40","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.ejor.2011.06.006","volume":"215","author":"WY Szeto","year":"2011","unstructured":"Szeto WY, Wu Y, Ho SC (2011) An artificial bee colony algorithm for the capacitated vehicle routing problem. Eur J Oper Res 215:126\u2013135","journal-title":"Eur J Oper Res"},{"key":"794_CR41","doi-asserted-by":"crossref","unstructured":"Barnharnsakun A, Achalakul T, Sirinaovakul B (2010) ABC-GSX: a hybrid method for solving the travelling salesman problem. In: Proceedings of the second world congress on nature and biologically inspired computing, pp 7\u201312","DOI":"10.1109\/NABIC.2010.5716308"},{"key":"794_CR42","doi-asserted-by":"crossref","unstructured":"Karaboga D, Gorkemli B (2011) A combinatorial artificial bee colony algorithm for traveling salesman problem. In: Proceedings of the international symposium on innovations in intelligent systems and applications, pp 50\u201353","DOI":"10.1109\/INISTA.2011.5946125"},{"key":"794_CR43","unstructured":"Zhang X, Bai Q, Yun X (2011) A new hybrid artificial bee colony algorithm for the travelling salesman problem. In: Proceedings of the IEEE 3rd international conference on communication software and networks, pp 155\u2013159"},{"key":"794_CR44","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1007\/978-3-540-74205-0_84","volume":"4682","author":"X Liu","year":"2007","unstructured":"Liu X, Su J, Han Y (2007) An improved particle swarm optimization for traveling salesman problem. Lect Notes Comput Sci 4682:803\u2013812","journal-title":"Lect Notes Comput Sci"},{"key":"794_CR45","first-page":"1583","volume":"3","author":"KP Wang","year":"2003","unstructured":"Wang KP, Huang L, Zhou CG, Pang W (2003) Particle swarm optimization for traveling salesman problem. Int Conf Mach Learn Cybern 3:1583\u20131585","journal-title":"Int Conf Mach Learn Cybern"},{"key":"794_CR46","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","volume":"33","author":"S Irnich","year":"2006","unstructured":"Irnich S, Funke B, Gr\u00fcnert T (2006) Sequential search and its application to vehicle-routing problems. Comput Oper Res 33:2405\u20132429","journal-title":"Comput Oper Res"},{"key":"794_CR47","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.cie.2006.09.002","volume":"51","author":"DY Sha","year":"2006","unstructured":"Sha DY, Hsu C-Y (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51:791\u2013808","journal-title":"Comput Ind Eng"},{"issue":"4","key":"794_CR48","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384","journal-title":"ORSA J Comput"},{"key":"794_CR49","unstructured":"Oliver IM, Smith DJ, Holland JRC (1987) A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the second international conference on genetic algorithms on genetic algorithms and their application, pp 224\u2013230"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-011-0794-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-011-0794-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-011-0794-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T04:13:21Z","timestamp":1561176801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-011-0794-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,6]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["794"],"URL":"https:\/\/doi.org\/10.1007\/s00521-011-0794-0","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,6]]}}}