{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:28:23Z","timestamp":1775143703867,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10489-020-01713-4","type":"journal-article","created":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T06:03:37Z","timestamp":1594015417000},"page":"3942-3960","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Multi-objective traveling salesman problem: an ABC approach"],"prefix":"10.1007","volume":"50","author":[{"given":"Indadul","family":"Khan","sequence":"first","affiliation":[]},{"given":"Manas Kumar","family":"Maiti","sequence":"additional","affiliation":[]},{"given":"Krishnendu","family":"Basuli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,6]]},"reference":[{"key":"1713_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.swevo.2015.02.003","volume":"23","author":"IDID Ariyasingha","year":"2015","unstructured":"Ariyasingha IDID, Fernando TGI (2015) Performance analysis of the multi-objective ant colony optimization algorithms for the traveling salesman problem. Swarm and Evolutionary Computation 23:11\u201326","journal-title":"Swarm and Evolutionary Computation"},{"key":"1713_CR2","doi-asserted-by":"crossref","unstructured":"Beed RS, Sarkar S, Roy A, Chatterjee S (2017) A study of the genetic algorithm parameters for solving multi-objective travelling salesman problem. In: International conference on information technology (ICIT). IEEE, pp 23\u201329","DOI":"10.1109\/ICIT.2017.49"},{"key":"1713_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"C Changdar","year":"2014","unstructured":"Changdar C, Mahapatr GS, Pal RK (2014) An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness. Swarm and Evolutionary Computation 15:27\u201337","journal-title":"Swarm and Evolutionary Computation"},{"key":"1713_CR4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.cor.2016.04.025","volume":"79","author":"M Cornu","year":"2017","unstructured":"Cornu M, Cazenave T, Vanderpooten D (2017) Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem. Computers & Operations Research 79:314\u2013330","journal-title":"Computers & Operations Research"},{"issue":"2","key":"1713_CR5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CAC Coello","year":"2005","unstructured":"Coello CAC, Cort\u00e9s NC (2005) Solving multiobjective optimization problems using an artificial immune system. Genetic Programming and Evolvable Machines 6(2):163\u2013190","journal-title":"Genetic Programming and Evolvable Machines"},{"key":"1713_CR6","doi-asserted-by":"crossref","unstructured":"de Souza MZ, Pozo ATR (2014) A GPU implementation of MOEA\/d-ACO for the multiobjective traveling salesman problem. In: 2014 Brazilian conference on intelligent systems. IEEE, pp 324\u2013329","DOI":"10.1109\/BRACIS.2014.65"},{"key":"1713_CR7","volume-title":"Multi-objective optimization using evolutionary algorithm, vol 16","author":"K Deb","year":"2001","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithm, vol 16. Wiley, New York"},{"issue":"2","key":"1713_CR8","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"1713_CR9","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation discussion and generalization. In: Icga, vol 93, pp 416\u2013423"},{"key":"1713_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/11730095","volume-title":"Evolutionary computation in combinatorial optimization (6 conf.)","author":"J Gottlieb","year":"2006","unstructured":"Gottlieb J, Raidl GR (2006) Evolutionary computation in combinatorial optimization (6 conf.) Springer, New York"},{"issue":"3","key":"1713_CR11","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1023\/A:1009690717521","volume":"6","author":"MP Hansen","year":"2000","unstructured":"Hansen MP (2000) Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP. Journal of Heuristics 6(3):419\u2013431","journal-title":"Journal of Heuristics"},{"key":"1713_CR12","doi-asserted-by":"crossref","unstructured":"Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization. In: Proceedings of the first IEEE conference on evolutionary computation. IEEE World Congress on Computational Intelligence, pp 82\u201387","DOI":"10.1109\/ICEC.1994.350037"},{"key":"1713_CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.swevo.2015.06.001","volume":"24","author":"S Iqbal","year":"2015","unstructured":"Iqbal S, Kaykobad M, Rahman MS (2015) Solving the multi-objective vehicle routing problem with soft time windows with the help of bees. Swarm and Evolutionary Computation 24:50\u201364","journal-title":"Swarm and Evolutionary Computation"},{"key":"1713_CR14","unstructured":"Hameed IA (2019) Multi-objective solution of traveling salesman problem with time. In: International conference on advanced machine learning technologies and applications. Springer , pp 121\u2013132"},{"issue":"1","key":"1713_CR15","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0377-2217(01)00104-7","volume":"137","author":"A Jaszkiewicz","year":"2002","unstructured":"Jaszkiewicz A (2002) Genetic local search for multi-objective combinatorial optimization. European Journal of Operational Research 137(1):50\u201371","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1713_CR16","doi-asserted-by":"crossref","first-page":"1845","DOI":"10.1109\/TSMCB.2012.2231860","volume":"43","author":"L Ke","year":"2013","unstructured":"Ke L, Zhang Q, Battiti R (2013) MOEA\/D-ACO: a multiobjective evolutionary algorithm using decomposition and antcolony. IEEE Transactions on Cybernetics 43(6):1845\u20131859","journal-title":"IEEE Transactions on Cybernetics"},{"key":"1713_CR17","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.ins.2014.12.043","volume":"300","author":"MS Kiran","year":"2015","unstructured":"Kiran MS, Hakli H, Gunduz M, Uguz H (2015) Artificial bee colony algorithm with variable search strategy for continuous optimization. Inf Sci 300:140\u2013157","journal-title":"Inf Sci"},{"issue":"1","key":"1713_CR18","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. Applied Mathematics and Computation 214(1):108\u2013132","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"1713_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 (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. Journal of Global Optimization 39(3):459\u2013471","journal-title":"Journal of Global Optimization"},{"key":"1713_CR20","unstructured":"Karaboga D (2005) An idea based on honey bee swarm for numerical optimization (vol 200, pp 1\u201310). Technical report-tr06, Erciyes university, engineering faculty, computer engineering department"},{"issue":"1","key":"1713_CR21","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 (2014) A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif Intell Rev 42(1):21\u201357","journal-title":"Artif Intell Rev"},{"key":"1713_CR22","doi-asserted-by":"crossref","unstructured":"Karaboga D, Gorkemli B (2011) A combinatorial artificial bee colony algorithm for traveling salesman problem. In: 2011 international symposium on innovations in intelligent systems and applications. IEEE, pp 50\u201353","DOI":"10.1109\/INISTA.2011.5946125"},{"issue":"1","key":"1713_CR23","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/JIFS-172127","volume":"36","author":"A Khanra","year":"2019","unstructured":"Khanra A, Pal T, Maiti MK, Maiti M (2019) Multi-objective four dimensional imprecise TSP solved with a hybrid multi-objective ant colony optimization-genetic algorithm with diversity. Journal of Intelligent & Fuzzy Systems 36(1):47\u201365","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"issue":"05","key":"1713_CR24","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1142\/S0218488519500314","volume":"27","author":"I Khan","year":"2019","unstructured":"Khan I, Pal S, Maiti MK (2019) A hybrid PSO-GA algorithm for traveling salesman problems in different environments. International Journal of Uncertainty Fuzziness and Knowledge-Based Systems 27(05):693\u2013717","journal-title":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems"},{"key":"1713_CR25","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1016\/j.swevo.2018.05.006","volume":"44","author":"I Khan","year":"2019","unstructured":"Khan I, Maiti MK (2019) A swap sequence based artificial bee colony algorithm for traveling salesman problem. Swarm and Evolutionary Computation 44:428\u2013438","journal-title":"Swarm and Evolutionary Computation"},{"key":"1713_CR26","doi-asserted-by":"crossref","unstructured":"Khan I, Maiti MK, Maiti M (2017) Coordinating particle swarm optimization, ant colony optimization and K-Opt algorithm for traveling salesman problem. In: International conference on mathematics and computing. Springer, Singapore, pp 103\u2013119","DOI":"10.1007\/978-981-10-4642-1_10"},{"issue":"1","key":"1713_CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s40595-017-0099-z","volume":"5","author":"I Khan","year":"2018","unstructured":"Khan I, Maiti MK (2018) A novel hybrid algorithm for generalized traveling salesman problems in different environments. Vietnam Journal of Computer Science 5(1):27\u201343","journal-title":"Vietnam Journal of Computer Science"},{"key":"1713_CR28","unstructured":"(1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley-Interscience Series in Discrete Mathematics"},{"issue":"2","key":"1713_CR29","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 BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Operations Research 21(2):498\u2013516","journal-title":"Operations Research"},{"issue":"2","key":"1713_CR30","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","volume":"13","author":"H Li","year":"2008","unstructured":"Li H, Zhang Q (2008) Multi-objective optimization problems with complicated Pareto sets, MOEA\/d and NSGA-II. IEEE Transactions on Evolutionary Computation 13(2):284\u2013302","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1713_CR31","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/j.eswa.2015.10.019","volume":"46","author":"S Maity","year":"2016","unstructured":"Maity S, Roy A, Maiti M (2016) An imprecise multi-objective genetic algorithm for uncertain constrained multi-objective solid travelling salesman problem. Expert Systems With Applications 46:196\u2013223","journal-title":"Expert Systems With Applications"},{"issue":"15","key":"1713_CR32","doi-asserted-by":"crossref","first-page":"6157","DOI":"10.1007\/s00500-018-3269-8","volume":"23","author":"DH Moraes","year":"2019","unstructured":"Moraes DH, Sanches DS, da Silva Rocha J, Garbelini JMC, Castoldi MF (2019) A novel multi-objective evolutionary algorithm based on subpopulations for the bi-objective traveling salesman problem. Soft Comput 23(15):6157\u20136168","journal-title":"Soft Comput"},{"key":"1713_CR33","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.knosys.2018.05.005","volume":"154","author":"R Martin-Moreno","year":"2018","unstructured":"Martin-Moreno R, Vega-Rodriguez MA (2018) Multi-objective artificial bee colony algorithm applied to the bi-objective orienteering problem. Knowl-Based Syst 154:93\u2013101","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"1713_CR34","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF03024314","volume":"18","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Hartley SJ (1996) Genetic algorithms+ data structures= evolution programs. Math Intell 18(3):71","journal-title":"Math Intell"},{"issue":"12","key":"1713_CR35","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information sciences 181(12):2455\u20132468","journal-title":"Information sciences"},{"issue":"22","key":"1713_CR36","doi-asserted-by":"crossref","first-page":"8956","DOI":"10.1016\/j.eswa.2015.07.051","volume":"42","author":"ID Psychas","year":"2015","unstructured":"Psychas ID, Delimpasi E, Marinakis Y (2015) Hybrid evolutionary algorithms for the multiobjective traveling salesman problem. Expert Syst Appl 42(22):8956\u20138970","journal-title":"Expert Syst Appl"},{"issue":"4","key":"1713_CR37","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 Journal on Computing 3(4):376\u2013384","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"1713_CR38","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.cie.2008.01.005","volume":"55","author":"F Samanlioglu","year":"2008","unstructured":"Samanlioglu F, Ferrell WG Jr, Kurz ME (2008) A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem. Computers & Industrial Engineering 55(2):439\u2013449","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"1713_CR39","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(2):625\u2013631","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1713_CR40","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multi-objective optimization using non dominated sorting in genetic algorithms. Evolutionary Computation 2(3):221\u2013248","journal-title":"Evolutionary Computation"},{"issue":"03","key":"1713_CR41","doi-asserted-by":"crossref","first-page":"1650009","DOI":"10.1142\/S0218213016500093","volume":"25","author":"L Tang","year":"2016","unstructured":"Tang L, Zhou Y, Xiang Y, Lai X (2016) A multi-objective artificial bee colony algorithm combined with a local search method. International Journal on Artificial Intelligence Tools 25(03):1650009","journal-title":"International Journal on Artificial Intelligence Tools"},{"issue":"03","key":"1713_CR42","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1142\/S0218213010000200","volume":"19","author":"LP Wong","year":"2010","unstructured":"Wong LP, Low MYH, Chong CS (2010) Bee colony optimization with local search for traveling salesman problem. International Journal on Artificial Intelligence Tools 19(03):305\u2013334","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"1713_CR43","doi-asserted-by":"crossref","unstructured":"Wang KP, Huang L, Zhou CG, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: Proceedings of the 2003 international conference on machine learning and cybernetics, vol 3. IEEE, pp 1583\u20131585","DOI":"10.1109\/ICMLC.2003.1259748"},{"issue":"1","key":"1713_CR44","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.swevo.2011.03.001","volume":"1","author":"A Zhou","year":"2011","unstructured":"Zhou A, Qu BY, Li H, Zhao SZ, Suganthan PN, Zhang Q (2011) Multi-objective evolutionary algorithms: a survey of the state of the art. Swarm and Evolutionary Computation 1(1):32\u201349","journal-title":"Swarm and Evolutionary Computation"},{"key":"1713_CR45","doi-asserted-by":"crossref","unstructured":"Zou W, Zhu Y, Chen H, Zhang B (2011) Solving multiobjective optimization problems using artificial bee colony algorithm. Discrete dynamics in nature and society","DOI":"10.1155\/2011\/569784"},{"key":"1713_CR46","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving The strength Pareto evolutionary algorithm. TIK-report, 103"},{"key":"1713_CR47","unstructured":"Zitzler E (1999) Evolutionary algorithms for multi-objective optimization: methods and applications (vol 63). Ithaca: Shaker"},{"key":"1713_CR48","unstructured":"Zitzler E, Thiele L (1998) Multi-objective optimization using evolutionary algorithms\u2014a comparative case study. In: International conference on parallel problem solving from nature. Springer, Berlin, pp 292\u2013301"},{"issue":"4","key":"1713_CR49","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3(4):257\u2013271","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01713-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-020-01713-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-020-01713-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T02:46:55Z","timestamp":1601088415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-020-01713-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":49,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1713"],"URL":"https:\/\/doi.org\/10.1007\/s10489-020-01713-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"6 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}