{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T08:46:32Z","timestamp":1720514792830},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1016\/j.asoc.2023.110219","type":"journal-article","created":{"date-parts":[[2023,3,20]],"date-time":"2023-03-20T23:08:41Z","timestamp":1679353721000},"page":"110219","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Discrete komodo algorithm for traveling salesman problem"],"prefix":"10.1016","volume":"139","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-5435-386X","authenticated-orcid":false,"given":"Gilang Kusuma","family":"Jati","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1836-0886","authenticated-orcid":false,"given":"Garry","family":"Kuwanto","sequence":"additional","affiliation":[]},{"given":"Tahir","family":"Hashmi","sequence":"additional","affiliation":[]},{"given":"Herman","family":"Widjaja","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b1","first-page":"11","article-title":"Das botenproblem","volume":"2","author":"Menger","year":"1932","journal-title":"Ergeb. Eines Math. Kolloqu."},{"issue":"2","key":"10.1016\/j.asoc.2023.110219_b2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1111\/j.2517-6161.1955.tb00192.x","article-title":"A contribution to the \u201ctravelling-salesman\u201d problem","volume":"17","author":"Morton","year":"1955","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"key":"10.1016\/j.asoc.2023.110219_b3","series-title":"On the Hamiltonian Game (A Traveling Salesman Problem)","author":"Robinson","year":"1949"},{"issue":"2","key":"10.1016\/j.asoc.2023.110219_b4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0305-0483(94)00057-H","article-title":"A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem","volume":"23","author":"Ozgur","year":"1995","journal-title":"Omega"},{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6377(95)00008-8","article-title":"Lot sizing in a no-wait flow shop","volume":"17","author":"Emmons","year":"1995","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0305-0548(98)00063-X","article-title":"Scheduling of parts and robot activities in a two machine robotic cell","volume":"26","author":"Aneja","year":"1999","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2023.110219_b7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01324886","article-title":"Sequencing of parts and robot moves in a robotic cell","volume":"4","author":"Sethi","year":"1992","journal-title":"Int. J. Flexible Manuf. Syst."},{"issue":"11","key":"10.1016\/j.asoc.2023.110219_b8","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1016\/S0305-0548(97)00013-0","article-title":"Modeling and solving several classes of arc routing problems as traveling salesman problems","volume":"24","author":"Laporte","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.asoc.2023.110219_b9","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0012-365X(96)00257-9","article-title":"Bounds for the frequency assignment problem","volume":"167\u2013168","author":"Smith","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.asoc.2023.110219_b10","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0012-365X(98)00221-0","article-title":"Lower bounding techniques for frequency assignment","volume":"197\u2013198","author":"Allen","year":"1999","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02294091","article-title":"Applications of combinatorial programming to data analysis: The traveling salesman and related problems","volume":"43","author":"Hubert","year":"1978","journal-title":"Psychometrika"},{"issue":"3","key":"10.1016\/j.asoc.2023.110219_b12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0167-6377(89)90037-0","article-title":"Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation","volume":"8","author":"Bland","year":"1989","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b13","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1287\/opre.36.1.18","article-title":"The nozzle guide vane problem","volume":"36","author":"Plante","year":"1988","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2023.110219_b14","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1287\/opre.31.3.507","article-title":"Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem","volume":"31","author":"Ratliff","year":"1983","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/j.asoc.2023.110219_b15","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.25.5.741","article-title":"Minimizing wallpaper waste, part 1: A class of traveling salesman problems","volume":"25","author":"Garfinkel","year":"1977","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b16","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","article-title":"Dynamic programming treatment of the travelling salesman problem","volume":"9","author":"Bellman","year":"1962","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/j.asoc.2023.110219_b18","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1970","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"10.1016\/j.asoc.2023.110219_b19","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0360-8352(86)90085-9","article-title":"A branch and bound algorithm for the travelling salesman and the transportation routing problems","volume":"11","author":"Radharamanan","year":"1986","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","article-title":"Optimization of a 532-city symmetric traveling salesman problem by branch and cut","volume":"6","author":"Padberg","year":"1987","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b21","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","article-title":"A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery","volume":"145","author":"Hern\u00e1ndez-P\u00e9rez","year":"2004","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.asoc.2023.110219_b22","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: Column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2023.110219_b23","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","article-title":"A cutting plane procedure for the travelling salesman problem on road networks","volume":"21","author":"Fleischmann","year":"1985","journal-title":"European J. Oper. Res."},{"issue":"11","key":"10.1016\/j.asoc.2023.110219_b24","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1057\/jors.1980.188","article-title":"A cutting planes algorithm for the m-salesmen problem","volume":"31","author":"Laporte","year":"1980","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/j.asoc.2023.110219_b25","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem-proving procedures, in: Proceedings of the third annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1971, pp. 151\u2013158, http:\/\/dx.doi.org\/10.1145\/800157.805047.","DOI":"10.1145\/800157.805047"},{"issue":"3","key":"10.1016\/j.asoc.2023.110219_b26","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and the hardness of approximation problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.asoc.2023.110219_b27","series-title":"Optimization models for decision making: Volume 1","author":"Murty","year":"2003"},{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b28","doi-asserted-by":"crossref","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","article-title":"Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search","volume":"11","author":"Geng","year":"2011","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b29","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1504\/IJPMB.2014.059449","article-title":"Improved genetic algorithms for the travelling salesman problem","volume":"4","author":"Ahmed","year":"2014","journal-title":"Int. J. Process Manag. Benchmark."},{"key":"10.1016\/j.asoc.2023.110219_b30","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","article-title":"An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness","volume":"15","author":"Changdar","year":"2014","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2023.110219_b31","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2014.01.015","article-title":"The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem","volume":"70","author":"Wang","year":"2014","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b32","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","article-title":"Solving shortest path problem using particle swarm optimization","volume":"8","author":"Mohemmed","year":"2008","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2023.110219_b33","series-title":"Applied Computing and Information Technology","first-page":"105","article-title":"Improving particle swarm optimization algorithm and its application to physical travelling salesman problems with a dynamic search space","author":"Vallade","year":"2014"},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b34","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"10.1016\/j.asoc.2023.110219_b35","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","article-title":"Ant colonies for the travelling salesman problem","volume":"43","author":"Dorigo","year":"1997","journal-title":"Biosystems"},{"key":"10.1016\/j.asoc.2023.110219_b36","series-title":"International Conference in Swarm Intelligence","first-page":"165","article-title":"High performance ant colony optimizer (HPACO) for travelling salesman problem (TSP)","author":"Sahana","year":"2014"},{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b37","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/17445760.2013.842568","article-title":"Accelerating ant colony optimisation for the travelling salesman problem on the GPU","volume":"29","author":"Uchida","year":"2014","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b38","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.eswa.2014.07.054","article-title":"Ant colony extended: Experiments on the travelling salesman problem","volume":"42","author":"Escario","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2023.110219_b39","series-title":"2011 International Symposium on Innovations in Intelligent Systems and Applications","first-page":"50","article-title":"A combinatorial artificial bee colony algorithm for traveling salesman problem","author":"Karaboga","year":"2011"},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b40","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s00521-011-0794-0","article-title":"The analysis of discrete artificial bee colony algorithm with neighborhood operator on traveling salesman problem","volume":"23","author":"K\u0131ran","year":"2013","journal-title":"Neural Comput. Appl."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b41","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02022093","article-title":"Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem","volume":"21","author":"Malek","year":"1989","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b42","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3906\/elk-1210-147","article-title":"A hierarchic approach based on swarm intelligence to solve the traveling salesman problem","volume":"23","author":"G\u00fcnd\u00fcz","year":"2015","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"10.1016\/j.asoc.2023.110219_b43","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","article-title":"A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem","volume":"30","author":"Mahi","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2023.110219_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.108043","article-title":"Komodo mlipir algorithm","volume":"114","author":"Suyanto","year":"2022","journal-title":"Appl. Soft Comput."},{"issue":"24","key":"10.1016\/j.asoc.2023.110219_b45","doi-asserted-by":"crossref","first-page":"8167","DOI":"10.1007\/s00500-017-2760-y","article-title":"Solving travelling salesman problem using black hole algorithm","volume":"22","author":"Hatamlou","year":"2018","journal-title":"Soft Comput."},{"key":"10.1016\/j.asoc.2023.110219_b46","series-title":"Proceedings of the 31st Chinese Control Conference","first-page":"2481","article-title":"State transition algorithm for traveling salesman problem","author":"Chunhua","year":"2012"},{"key":"10.1016\/j.asoc.2023.110219_b47","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/j.neucom.2015.08.041","article-title":"Discrete state transition algorithm for unconstrained integer optimization problems","volume":"173","author":"Zhou","year":"2016","journal-title":"Neurocomputing"},{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b48","first-page":"879","article-title":"A discrete tree-seed algorithm for solving symmetric traveling salesman problem","volume":"23","author":"Cinar","year":"2020","journal-title":"Eng. Sci. Technol."},{"key":"10.1016\/j.asoc.2023.110219_b49","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107275","article-title":"DJAYA: A discrete Jaya algorithm for solving traveling salesman problem","volume":"105","author":"Gunduz","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2023.110219_b50","series-title":"Swarm Intelligence and Bio-Inspired Computation","first-page":"295","article-title":"Discrete firefly algorithm for traveling salesman problem: A new movement scheme","author":"Jati","year":"2013"},{"key":"10.1016\/j.asoc.2023.110219_b51","series-title":"Traveling Salesman Problem","article-title":"Traveling salesman problem: An overview of applications, formulations, and solution approaches","author":"Matai","year":"2010"},{"issue":"1","key":"10.1016\/j.asoc.2023.110219_b52","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","article-title":"On the computational complexity of combinatorial problems","volume":"5","author":"Karp","year":"1975","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.asoc.2023.110219_b53","doi-asserted-by":"crossref","first-page":"103","DOI":"10.11121\/ijocta.01.2016.00268","article-title":"Using 2-opt based evolution strategy for travelling salesman problem","volume":"6","author":"Karag\u00fcl","year":"2016","journal-title":"Int. J. Optim. Control Theor. Appl. (IJOCTA)"},{"issue":"6","key":"10.1016\/j.asoc.2023.110219_b54","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling-salesman problems","volume":"6","author":"Croes","year":"1958","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.asoc.2023.110219_b55","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSPLIB\u2013a traveling salesman problem library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"issue":"3","key":"10.1016\/j.asoc.2023.110219_b56","doi-asserted-by":"crossref","first-page":"193","DOI":"10.7763\/IJFCC.2015.V4.383","article-title":"Statistical analysis for swarm intelligence\u2014simplified","volume":"4","author":"Aziz","year":"2015","journal-title":"Int. J. Future Comput. Commun."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494623002375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494623002375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,25]],"date-time":"2024-05-25T03:46:51Z","timestamp":1716608811000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494623002375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":56,"alternative-id":["S1568494623002375"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2023.110219","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2023,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Discrete komodo algorithm for traveling salesman problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2023.110219","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"110219"}}