{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T11:10:02Z","timestamp":1745925002552,"version":"3.40.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:00:00Z","timestamp":1744329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:00:00Z","timestamp":1744329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106055"],"award-info":[{"award-number":["62106055"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2022A1515011825"],"award-info":[{"award-number":["2022A1515011825"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangzhou Science and Technology Planning Project","award":["2023A04J0388 and 2023A03J0662"],"award-info":[{"award-number":["2023A04J0388 and 2023A03J0662"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s40747-025-01865-1","type":"journal-article","created":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T09:21:59Z","timestamp":1744363319000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A two-stage algorithm based on greedy ant colony optimization for travelling thief problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Zheng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xiao-Yun","family":"Xia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2594-0934","authenticated-orcid":false,"given":"Zi-Jia","family":"Wang","sequence":"additional","affiliation":[]},{"given":"You-Zhen","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Wei-Zhi","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,11]]},"reference":[{"key":"1865_CR1","doi-asserted-by":"crossref","unstructured":"Bonyadi MR, Michalewicz Z, Barone L (2013) The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In: 2013 IEEE congress on evolutionary computation, pp 1037\u20131044","DOI":"10.1109\/CEC.2013.6557681"},{"issue":"4","key":"1865_CR2","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2(4):393\u2013410","journal-title":"J Oper Res Soc Am"},{"issue":"1","key":"1865_CR3","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/BF01580448","volume":"8","author":"D Fayard","year":"1975","unstructured":"Fayard D, Plateau G (1975) Resolution of the 0\u20131 knapsack problem: comparison of methods. Math Program Ser A B 8(1):272\u2013307","journal-title":"Math Program Ser A B"},{"key":"1865_CR4","doi-asserted-by":"crossref","unstructured":"Polyakovskiy S, Bonyadi MR, Wagner M, Michalewicz Z, Neumann F (2014) A comprehensive benchmark set and heuristics for the traveling thief problem. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation, pp 477\u2013484","DOI":"10.1145\/2576768.2598249"},{"issue":"2","key":"1865_CR5","doi-asserted-by":"publisher","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. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"key":"1865_CR6","doi-asserted-by":"crossref","unstructured":"El Yafrani M, Ahiod B (2015) Cosolver2b: an efficient local search heuristic for the travelling thief problem. In: 2015 IEEE\/ACS 12th international conference of computer systems and applications (AICCSA), pp 1\u20135","DOI":"10.1109\/AICCSA.2015.7507099"},{"key":"1865_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00500-014-1487-2","volume":"20","author":"Y Mei","year":"2016","unstructured":"Mei Y, Li X, Yao X (2016) On investigation of interdependence between sub-problems of the travelling thief problem. Soft Comput 20:157\u2013172","journal-title":"Soft Comput"},{"key":"1865_CR8","doi-asserted-by":"crossref","unstructured":"Faulkner H, Polyakovskiy S, Schultz T, Wagner M (2015) Approximate approaches to the traveling thief problem. In: Proceedings of the 2015 annual conference on genetic and evolutionary computation, pp 385\u2013392","DOI":"10.1145\/2739480.2754716"},{"key":"1865_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106284","volume":"93","author":"A Maity","year":"2020","unstructured":"Maity A, Das S (2020) Efficient hybrid local search heuristics for solving the travelling thief problem. Appl Soft Comput 93:106284","journal-title":"Appl Soft Comput"},{"key":"1865_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ins.2017.12.011","volume":"432","author":"M El Yafrani","year":"2018","unstructured":"El Yafrani M, Ahiod B (2018) Efficiently solving the traveling thief problem using hill climbing and simulated annealing. Inf Sci 432:231\u2013244","journal-title":"Inf Sci"},{"key":"1865_CR11","doi-asserted-by":"publisher","first-page":"54056","DOI":"10.1109\/ACCESS.2021.3070204","volume":"9","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Yang L, Kang P, Jia X, Zhang W (2021) Solving the traveling thief problem based on item selection weight and reverse-order allocation. IEEE Access 9:54056\u201354066","journal-title":"IEEE Access"},{"key":"1865_CR12","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10732-017-9328-y","volume":"24","author":"M Wagner","year":"2018","unstructured":"Wagner M, Lindauer M, M\u0131s\u0131r M, Nallaperuma S, Hutter F (2018) A case study of algorithm selection for the traveling thief problem. J Heuristics 24:295\u2013320","journal-title":"J Heuristics"},{"key":"1865_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00500-023-08402-7","volume":"27","author":"M El Yafrani","year":"2023","unstructured":"El Yafrani M, Scoczynski M, Wagner M, Nielsen P (2023) A regression analysis of the impact of routing and packing dependencies on the expected runtime. Soft Comput 27:1\u201317","journal-title":"Soft Comput"},{"key":"1865_CR14","doi-asserted-by":"crossref","unstructured":"Nikfarjam A, Neumann A, Neumann F (2022) Evolutionary diversity optimisation for the traveling thief problem. In: Proceedings of the genetic and evolutionary computation conference, pp 749\u2013756","DOI":"10.1145\/3512290.3528862"},{"key":"1865_CR15","doi-asserted-by":"crossref","unstructured":"Nikfarjam A, Neumann A, Neumann F (2022) On the use of quality diversity algorithms for the traveling thief problem. In: Proceedings of the genetic and evolutionary computation conference, pp 260\u2013268","DOI":"10.1145\/3512290.3528752"},{"key":"1865_CR16","doi-asserted-by":"crossref","unstructured":"Garbaruk J, Logof\u0103tu D, Leon F (2022) Comparative study by using a greedy approach and advanced bio-inspired strategies in the context of the traveling thief problem. In: IFIP international conference on artificial intelligence applications and innovations, pp 383\u2013393","DOI":"10.1007\/978-3-031-08333-4_31"},{"issue":"1","key":"1865_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10462-021-10042-y","volume":"55","author":"Z-H Zhan","year":"2022","unstructured":"Zhan Z-H, Shi L, Tan KC, Zhang J (2022) A survey on evolutionary computation for complex continuous optimization. Artif Intell Rev 55(1):59\u2013110","journal-title":"Artif Intell Rev"},{"key":"1865_CR18","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s10957-015-0706-z","volume":"168","author":"V Stojanovic","year":"2016","unstructured":"Stojanovic V, Nedic N (2016) A nature inspired parameter tuning approach to cascade control for hydraulically driven parallel robot platform. J Optim Theory Appl 168:332\u2013347","journal-title":"J Optim Theory Appl"},{"key":"1865_CR19","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1007\/s00170-016-8627-z","volume":"87","author":"V Stojanovic","year":"2016","unstructured":"Stojanovic V, Nedic N, Prsic D, Dubonjic L, Djordjevic V (2016) Application of cuckoo search algorithm to constrained control problem of a parallel robot platform. Int J Adv Manuf Technol 87:2497\u20132507","journal-title":"Int J Adv Manuf Technol"},{"key":"1865_CR20","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1007\/s11071-015-2252-5","volume":"82","author":"N Nedic","year":"2015","unstructured":"Nedic N, Stojanovic V, Djordjevic V (2015) Optimal control of hydraulically driven parallel robot platform based on firefly algorithm. Nonlinear Dyn 82:1457\u20131473","journal-title":"Nonlinear Dyn"},{"key":"1865_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.111087","volume":"150","author":"L-L Li","year":"2024","unstructured":"Li L-L, Ji B-X, Lim MK, Tseng M-L (2024) Active distribution network operational optimization problem: a multi-objective tuna swarm optimization model. Appl Soft Comput 150:111087","journal-title":"Appl Soft Comput"},{"key":"1865_CR22","doi-asserted-by":"crossref","unstructured":"Mei Y, Li X, Yao X (2014) Improving efficiency of heuristics for the large scale traveling thief problem. In: Asia-Pacific conference on simulated evolution and learning, pp 631\u2013643","DOI":"10.1007\/978-3-319-13563-2_53"},{"issue":"4","key":"1865_CR23","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-023-09518-7","volume":"29","author":"M Namazi","year":"2023","unstructured":"Namazi M, Newton MH, Sanderson C, Sattar A (2023) Solving travelling thief problems using coordination based methods. J Heuristics 29(4):487\u2013544","journal-title":"J Heuristics"},{"key":"1865_CR24","doi-asserted-by":"crossref","unstructured":"Chand S, Wagner M (2016) Fast heuristics for the multiple traveling thieves problem. In: Proceedings of the genetic and evolutionary computation conference 2016, pp 293\u2013300","DOI":"10.1145\/2908812.2908841"},{"key":"1865_CR25","doi-asserted-by":"crossref","unstructured":"Blank J, Deb K, Mostaghim S (2017) Solving the bi-objective traveling thief problem with multi-objective evolutionary algorithms. In: Evolutionary multi-criterion optimization: 9th international conference, EMO 2017, M\u00fcnster, Germany, March 19\u201322, 2017, proceedings vol 9, pp 46\u201360","DOI":"10.1007\/978-3-319-54157-0_4"},{"key":"1865_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105560","volume":"138","author":"JB Chagas","year":"2022","unstructured":"Chagas JB, Wagner M (2022) A weighted-sum method for solving the bi-objective traveling thief problem. Comput Oper Res 138:105560","journal-title":"Comput Oper Res"},{"issue":"3","key":"1865_CR27","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10732-020-09457-7","volume":"27","author":"JB Chagas","year":"2021","unstructured":"Chagas JB, Blank J, Wagner M, Souza MJ, Deb K (2021) A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem. J Heuristics 27(3):267\u2013301","journal-title":"J Heuristics"},{"key":"1865_CR28","doi-asserted-by":"crossref","unstructured":"Wu J, Polyakovskiy S, Wagner M, Neumann F (2018) Evolutionary computation plus dynamic programming for the bi-objective travelling thief problem. In: Proceedings of the genetic and evolutionary computation conference, pp 777\u2013784","DOI":"10.1145\/3205455.3205488"},{"key":"1865_CR29","first-page":"163","volume":"4","author":"T St\u00fctzle","year":"1999","unstructured":"St\u00fctzle T, Dorigo M (1999) Aco algorithms for the traveling salesman problem. Evol Alg Eng Comput Sci 4:163\u2013183","journal-title":"Evol Alg Eng Comput Sci"},{"issue":"5","key":"1865_CR30","doi-asserted-by":"publisher","first-page":"3973","DOI":"10.1007\/s40747-021-00635-z","volume":"8","author":"S Li","year":"2022","unstructured":"Li S, Luo T, Wang L, Xing L, Ren T (2022) Tourism route optimization based on improved knowledge ant colony algorithm. Complex Intell Syst 8(5):3973\u20133988","journal-title":"Complex Intell Syst"},{"issue":"6","key":"1865_CR31","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.3390\/su15065111","volume":"15","author":"C-H Tsai","year":"2023","unstructured":"Tsai C-H, Lin Y-D, Yang C-H, Wang C-K, Chiang L-C, Chiang P-J (2023) A biogeography-based optimization with a greedy randomized adaptive search procedure and the 2-opt algorithm for the traveling salesman problem. Sustainability 15(6):5111","journal-title":"Sustainability"},{"key":"1865_CR32","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.neucom.2021.04.028","volume":"450","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Feng Q, Huang J, Guo Y, Xu J, Wang J (2021) A local search algorithm for k-means with outliers. Neurocomputing 450:230\u2013241","journal-title":"Neurocomputing"},{"key":"1865_CR33","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.neucom.2014.03.066","volume":"148","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Song S, Wu C, Yin W (2015) Variable exponential neighborhood search for the long chain design problem. Neurocomputing 148:269\u2013277","journal-title":"Neurocomputing"},{"key":"1865_CR34","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.future.2021.07.022","volume":"126","author":"X Sun","year":"2022","unstructured":"Sun X, Chou P, Koong C-S, Wu C-C, Chen L-R (2022) Optimizing 2-opt-based heuristics on gpu for solving the single-row facility layout problem. Futur Gener Comput Syst 126:91\u2013109","journal-title":"Futur Gener Comput Syst"},{"issue":"1","key":"1865_CR35","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/s00453-013-9801-4","volume":"68","author":"M Englert","year":"2014","unstructured":"Englert M, R\u00f6glin H, V\u00f6cking B (2014) Worst case and probabilistic analysis of the 2-opt algorithm for the tsp. Algorithmica 68(1):190\u2013264","journal-title":"Algorithmica"},{"issue":"6","key":"1865_CR36","doi-asserted-by":"publisher","first-page":"7075","DOI":"10.1007\/s40747-023-01091-7","volume":"9","author":"F Peng","year":"2023","unstructured":"Peng F, Zheng L (2023) Integrating real-time manufacturing data into a novel serial two-stage adaptive alternate genetic fireworks algorithm for solving stochastic type-ii simple assembly line balancing problem. Complex Intell Syst 9(6):7075\u20137102","journal-title":"Complex Intell Syst"},{"key":"1865_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2021.100993","volume":"69","author":"J Skackauskas","year":"2022","unstructured":"Skackauskas J, Kalganova T, Dear I, Janakiram M (2022) Dynamic impact for ant colony optimization algorithm. Swarm Evol Comput 69:100993","journal-title":"Swarm Evol Comput"},{"key":"1865_CR38","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.swevo.2013.05.005","volume":"13","author":"KV Narasimha","year":"2013","unstructured":"Narasimha KV, Kivelevitch E, Sharma B, Kumar M (2013) An ant colony optimization technique for solving min-max multi-depot vehicle routing problem. Swarm Evol Comput 13:63\u201373","journal-title":"Swarm Evol Comput"},{"key":"1865_CR39","doi-asserted-by":"crossref","unstructured":"Nezhad NHM, Niasar MG, Hagen CW, Kruit P (2023) Tuning parameters in the genetic algorithm optimization of electrostatic electron lenses. In: 2023 IEEE MTT-S international conference on numerical electromagnetic and multiphysics modeling and optimization (NEMO), pp 170\u2013173","DOI":"10.1109\/NEMO56117.2023.10202293"},{"key":"1865_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.swevo.2015.01.002","volume":"22","author":"Q Long","year":"2015","unstructured":"Long Q, Wu C, Huang T, Wang X (2015) A genetic algorithm for unconstrained multi-objective optimization. Swarm Evol Comput 22:1\u201314","journal-title":"Swarm Evol Comput"},{"key":"1865_CR41","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.swevo.2013.11.001","volume":"15","author":"C Changdar","year":"2014","unstructured":"Changdar C, Mahapatra G, Pal RK (2014) An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness. Swarm Evol Comput 15:27\u201337","journal-title":"Swarm Evol Comput"},{"key":"1865_CR42","doi-asserted-by":"publisher","first-page":"3350","DOI":"10.1007\/s10489-020-01722-3","volume":"50","author":"Y Li","year":"2020","unstructured":"Li Y, He Y, Liu X, Guo X, Li Z (2020) A novel discrete whale optimization algorithm for solving knapsack problems. Appl Intell 50:3350\u20133366","journal-title":"Appl Intell"},{"key":"1865_CR43","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ins.2020.07.013","volume":"542","author":"IM Ali","year":"2021","unstructured":"Ali IM, Essam D, Kasmarik K (2021) Novel binary differential evolution algorithm for knapsack problems. Inf Sci 542:177\u2013194","journal-title":"Inf Sci"},{"key":"1865_CR44","first-page":"1","volume":"8","author":"P Agrawal","year":"2021","unstructured":"Agrawal P, Ganesh T, Mohamed AW (2021) Solving knapsack problems using a binary gaining sharing knowledge-based optimization algorithm. Complex Intell Syst 8:1\u201321","journal-title":"Complex Intell Syst"},{"key":"1865_CR45","doi-asserted-by":"crossref","unstructured":"Nguyen H, Le N, Tran K, Luong NH (2023) Simulated annealing with dynamic programming-based vertex insertion for efficiently solving the traveling thief problem. In: Proceedings of the 12th international symposium on information and communication technology, pp 165\u2013172","DOI":"10.1145\/3628797.3628990"},{"key":"1865_CR46","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110144","volume":"260","author":"J Zheng","year":"2023","unstructured":"Zheng J, He K, Zhou J, Jin Y, Li C-M (2023) Reinforced Lin\u2013Kernighan\u2013Helsgaun algorithms for the traveling salesman problems. Knowl-Based Syst 260:110144","journal-title":"Knowl-Based Syst"},{"key":"1865_CR47","doi-asserted-by":"crossref","unstructured":"Whitley D, Ochoa G (2022) Local optima organize into lattices under recombination: an example using the traveling salesman problem. In: Proceedings of the genetic and evolutionary computation conference, pp 757\u2013765","DOI":"10.1145\/3512290.3528747"},{"key":"1865_CR48","doi-asserted-by":"publisher","first-page":"972","DOI":"10.7717\/peerj-cs.972","volume":"8","author":"Y Lu","year":"2022","unstructured":"Lu Y, Hao J-K, Wu Q (2022) Solving the clustered traveling salesman problem via traveling salesman problem methods. PeerJ Comput Sci 8:972","journal-title":"PeerJ Comput Sci"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01865-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-025-01865-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-025-01865-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T10:37:28Z","timestamp":1745923048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-025-01865-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,11]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1865"],"URL":"https:\/\/doi.org\/10.1007\/s40747-025-01865-1","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2025,4,11]]},"assertion":[{"value":"27 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"235"}}