{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T09:25:25Z","timestamp":1743585925629,"version":"3.37.3"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"Ministry of Science, ICT and Future Planning","doi-asserted-by":"publisher","award":["NRF-2020H1D3A2A01085443"],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Engineering Applications of Artificial Intelligence"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1016\/j.engappai.2023.106351","type":"journal-article","created":{"date-parts":[[2023,4,28]],"date-time":"2023-04-28T11:06:22Z","timestamp":1682679982000},"page":"106351","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"PB","title":["Multi-vehicle clustered traveling purchaser problem using a variable-length genetic algorithm"],"prefix":"10.1016","volume":"123","author":[{"given":"Arindam","family":"Roy","sequence":"first","affiliation":[]},{"given":"Samir","family":"Maity","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7072-1351","authenticated-orcid":false,"given":"Ilkyeong","family":"Moon","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.engappai.2023.106351_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104373","article-title":"A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization","volume":"104","author":"Abreu","year":"2021","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2023.106351_b2","article-title":"Influence of statistical feature normalisation methods on K-nearest neighbours and K-means in the context of industry 4.0","volume":"111","author":"Adan","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/s10479-011-0994-0","article-title":"An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem","volume":"199","author":"Almeida","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.cor.2017.01.001","article-title":"The traveling purchaser problem with time-dependent quantities","volume":"82","author":"Angelelli","year":"2017","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"10.1016\/j.engappai.2023.106351_b5","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1016\/j.cor.2011.02.021","article-title":"Look-ahead heuristics for the dynamic traveling purchaser problem","volume":"38","author":"Angelelli","year":"2011","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b6","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1287\/trsc.2015.0627","article-title":"The stochastic and dynamic traveling purchaser problem","volume":"50","author":"Angelelli","year":"2016","journal-title":"Transp. Sci."},{"issue":"8","key":"10.1016\/j.engappai.2023.106351_b7","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1016\/j.cor.2013.02.007","article-title":"The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach","volume":"40","author":"Batista-Galv\u00e1n","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.engappai.2023.106351_b8","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1111\/itor.12330","article-title":"Metaheuristics based on decision hierarchies for the traveling purchaser problem","volume":"25","author":"Bernardino","year":"2018","journal-title":"Int. Trans. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b9","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.dam.2020.08.014","article-title":"A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand","volume":"288","author":"Bianchessi","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ejor.2013.10.018","article-title":"The distance constrained multiple vehicle traveling purchaser problem","volume":"235","author":"Bianchessi","year":"2014","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.engappai.2023.106351_b11","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0305-0548(02)00020-5","article-title":"Heuristics for the traveling purchaser problem","volume":"30","author":"Boctor","year":"2003","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b12","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1016\/j.cor.2006.03.023","article-title":"Ant colony optimization for the traveling purchaser problem","volume":"35","author":"Bontoux","year":"2008","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b13","first-page":"1","article-title":"Sustainable traveling purchaser problem with speed optimization","author":"Cheaitou","year":"2020","journal-title":"Int. J. Sustain. Transp."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0305-0548(75)90015-5","article-title":"The clustered traveling salesman problem","volume":"2","author":"Chisman","year":"1975","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"10.1016\/j.engappai.2023.106351_b15","doi-asserted-by":"crossref","first-page":"9848","DOI":"10.1016\/j.eswa.2011.02.018","article-title":"The multiple traveling purchaser problem for maximizing system\u2019s reliability with budget constraints","volume":"38","author":"Choi","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.engappai.2023.106351_b16","article-title":"A GRASP\/Path-Relinking algorithm for the traveling purchaser problem","author":"Cuellar-Usaqu\u00e9n","year":"2021","journal-title":"Int. Trans. Oper. Res."},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2015.06.073","article-title":"The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach","volume":"248","author":"Gendreau","year":"2016","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.engappai.2023.106351_b18","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","article-title":"Two generalizations of the traveling salesman problem","volume":"9","author":"Golden","year":"1981","journal-title":"Omega"},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b19","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1016\/j.cor.2010.07.016","article-title":"Models for a traveling purchaser problem with additional side-constraints","volume":"38","author":"Gouveia","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b20","series-title":"2017 7th International Conference on Modeling, Simulation, and Applied Optimization","first-page":"1","article-title":"Green traveling purchaser problem model: A bi-objective optimization approach","author":"Hamdan","year":"2017"},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b21","first-page":"100","article-title":"Algorithm AS 136: A k-means clustering algorithm","volume":"28","author":"Hartigan","year":"1979","journal-title":"J. R. Stat. Soc. Ser. C. Appl. Stat."},{"issue":"3","key":"10.1016\/j.engappai.2023.106351_b22","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.ejor.2010.09.012","article-title":"The traveling purchaser problem with stochastic prices: Exact and approximate algorithms","volume":"209","author":"Kang","year":"2011","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105700","article-title":"The traveling purchaser problem with fast service option","author":"Kucukoglu","year":"2022","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"10.1016\/j.engappai.2023.106351_b24","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1016\/S0305-0548(01)00043-0","article-title":"Integration of self-organizing feature map and K-means algorithm for market segmentation","volume":"29","author":"Kuo","year":"2002","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"10.1016\/j.engappai.2023.106351_b25","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1287\/opre.51.6.940.24921","article-title":"A branch-and-cut algorithm for the undirected traveling purchaser problem","volume":"51","author":"Laporte","year":"2003","journal-title":"Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b26","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107924","article-title":"Customer segmentation using K-means clustering and the adaptive particle swarm optimization algorithm","volume":"113","author":"Li","year":"2021","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.engappai.2023.106351_b27","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1111\/j.1467-9671.2008.01105.x","article-title":"A clustering-based approach to the capacitated facility location problem","volume":"12","author":"Liao","year":"2008","journal-title":"Trans. GIS"},{"key":"10.1016\/j.engappai.2023.106351_b28","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.cie.2015.02.023","article-title":"A modified genetic algorithm for solving uncertain constrained solid travelling salesman problems","volume":"83","author":"Maity","year":"2015","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b29","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.21588","article-title":"A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints","volume":"65","author":"Manerba","year":"2015","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","article-title":"The traveling purchaser problem and its variants","volume":"259","author":"Manerba","year":"2017","journal-title":"European J. Oper. Res."},{"issue":"4","key":"10.1016\/j.engappai.2023.106351_b31","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/j.omega.2011.09.001","article-title":"The supplier selection problem with quantity discounts and truckload shipping","volume":"40","author":"Mansini","year":"2012","journal-title":"Omega"},{"key":"10.1016\/j.engappai.2023.106351_b32","series-title":"Innovations in Distribution Logistics","first-page":"267","article-title":"Effective algorithms for a bounded version of the uncapacitated TPP","author":"Mansini","year":"2009"},{"issue":"7","key":"10.1016\/j.engappai.2023.106351_b33","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1016\/j.cor.2008.09.001","article-title":"The traveling purchaser problem with budget constraint","volume":"36","author":"Mansini","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.104795","article-title":"An algorithm to compute time-balanced clusters for the delivery logistics problem","volume":"111","author":"Menchaca-M\u00e9ndez","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"year":"2019","series-title":"Supply Chain Management: Strategy and Organization","author":"Nakano","key":"10.1016\/j.engappai.2023.106351_b35"},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b36","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.engappai.2010.10.001","article-title":"An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering","volume":"24","author":"Niknam","year":"2011","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.engappai.2023.106351_b37","series-title":"Metaheuristics International Conference","first-page":"489","article-title":"Metaheuristics based on GRASP and VNS for solving traveling purchaser problem","author":"Ochi","year":"2001"},{"issue":"5","key":"10.1016\/j.engappai.2023.106351_b38","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(82)90041-4","article-title":"Approximate algorithms for the travelling purchaser problem","volume":"1","author":"Ong","year":"1982","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b39","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.ejor.2018.08.039","article-title":"The bi-objective traveling purchaser problem with deliveries","volume":"273","author":"Palomo-Mart\u00ednez","year":"2019","journal-title":"European J. Oper. Res."},{"year":"1991","series-title":"On the traveling purchaser problem","author":"Pearn","key":"10.1016\/j.engappai.2023.106351_b40"},{"issue":"11","key":"10.1016\/j.engappai.2023.106351_b41","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0305-0548(98)00032-X","article-title":"Improved solutions for the traveling purchaser problem","volume":"25","author":"Pearn","year":"1998","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b42","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106578","article-title":"Imprecise modified solid green traveling purchaser problem for substitute items using quantum-inspired genetic algorithm","volume":"147","author":"Pradhan","year":"2020","journal-title":"Comput. Ind. Eng."},{"issue":"1\u20133","key":"10.1016\/j.engappai.2023.106351_b43","first-page":"78","article-title":"Traveling purchaser problem","volume":"18","author":"Ramesh","year":"1981","journal-title":"Opsearch"},{"year":"1995","series-title":"TSPLIB","author":"Reinelt","key":"10.1016\/j.engappai.2023.106351_b44"},{"key":"10.1016\/j.engappai.2023.106351_b45","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2021.104535","article-title":"K-means\u2013Laplacian clustering revisited","volume":"107","author":"Rengasamy","year":"2022","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"10.1016\/j.engappai.2023.106351_b46","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.ejor.2003.10.003","article-title":"The biobjective travelling purchaser problem","volume":"160","author":"Riera-Ledesma","year":"2005","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b47","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.ejor.2003.10.032","article-title":"A heuristic approach for the travelling purchaser problem","volume":"162","author":"Riera-Ledesma","year":"2005","journal-title":"European J. Oper. Res."},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b48","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s10479-006-0014-y","article-title":"Solving the asymmetric traveling purchaser problem","volume":"144","author":"Riera-Ledesma","year":"2006","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b49","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.cor.2011.04.015","article-title":"Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach","volume":"39","author":"Riera-Ledesma","year":"2012","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b50","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/j.cor.2012.08.011","article-title":"A column generation approach for a school bus routing problem with resource constraints","volume":"40","author":"Riera-Ledesma","year":"2013","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b51","first-page":"17","article-title":"A noble genetic algorithm to solve a solid green traveling purchaser problem with uncertain cost parameters","volume":"40","author":"Roy","year":"2020","journal-title":"Amer. J. Math. Management Sci."},{"issue":"3","key":"10.1016\/j.engappai.2023.106351_b52","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","article-title":"A branch and bound algorithm for the traveling purchaser problem","volume":"97","author":"Singh","year":"1997","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b53","doi-asserted-by":"crossref","DOI":"10.1088\/1757-899X\/336\/1\/012017","article-title":"Integration K-means clustering method and elbow method for identification of the best customer profile cluster","volume":"336","author":"Syakur","year":"2018","journal-title":"IOP Conf. Ser.: Mater. Sci. Eng."},{"issue":"1","key":"10.1016\/j.engappai.2023.106351_b54","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0305-0548(02)00193-4","article-title":"Improved heuristics for the traveling purchaser problem","volume":"31","author":"Teeninga","year":"2004","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.engappai.2023.106351_b55","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02125457","article-title":"Dynamic tabu search strategies for the traveling purchaser problem","volume":"63","author":"Vo\u00df","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.engappai.2023.106351_b56","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2019.105763","article-title":"Improving K-means clustering with enhanced firefly algorithms","volume":"84","author":"Xie","year":"2019","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.engappai.2023.106351_b57","doi-asserted-by":"crossref","first-page":"36073","DOI":"10.1109\/ACCESS.2022.3163715","article-title":"Multi-parking lot and shelter heterogeneous vehicle routing problem with split pickup under emergencies","volume":"10","author":"Xu","year":"2022","journal-title":"IEEE Access"},{"key":"10.1016\/j.engappai.2023.106351_b58","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1016\/j.asoc.2017.08.032","article-title":"Two improved k-means algorithms","volume":"68","author":"Yu","year":"2018","journal-title":"Appl. Soft Comput."}],"container-title":["Engineering Applications of Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197623005353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0952197623005353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,11,16]],"date-time":"2024-11-16T05:34:01Z","timestamp":1731735241000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0952197623005353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":58,"alternative-id":["S0952197623005353"],"URL":"https:\/\/doi.org\/10.1016\/j.engappai.2023.106351","relation":{},"ISSN":["0952-1976"],"issn-type":[{"type":"print","value":"0952-1976"}],"subject":[],"published":{"date-parts":[[2023,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Multi-vehicle clustered traveling purchaser problem using a variable-length genetic algorithm","name":"articletitle","label":"Article Title"},{"value":"Engineering Applications of Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.engappai.2023.106351","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"106351"}}