{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T15:39:47Z","timestamp":1761752387059,"version":"build-2065373602"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T00:00:00Z","timestamp":1758672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2023MF092"],"award-info":[{"award-number":["ZR2023MF092"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. King Saud Univ. Comput. Inf. Sci."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s44443-025-00205-0","type":"journal-article","created":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T16:09:24Z","timestamp":1758730164000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Edge assembly combined with arc-based crossover for undirected traveling salesman with profits"],"prefix":"10.1007","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-9624-9544","authenticated-orcid":false,"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueshi","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,24]]},"reference":[{"key":"205_CR1","doi-asserted-by":"publisher","first-page":"19976","DOI":"10.1007\/s11227-024-06169-8","volume":"80","author":"S Anwar","year":"2024","unstructured":"Anwar S, Azeem M, Jamil MK et al (2024) Single-valued neutrosophic fuzzy Sombor numbers and their applications in trade flows between different countries via sea route. J Supercomput 80:19976\u201320019","journal-title":"J Supercomput"},{"issue":"6","key":"205_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621\u2013636","journal-title":"Networks"},{"key":"205_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1002\/net.3230250406","volume":"25","author":"E Balas","year":"1995","unstructured":"Balas E (1995) The prize collecting traveling salesman problem: II. polyhedral results. Networks 25:199\u2013216","journal-title":"Networks"},{"issue":"1","key":"205_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/net.20307","volume":"54","author":"J-F B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9 J-F, Gendreau M, Potvin J-Y (2009) A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1):56\u201367","journal-title":"Networks"},{"key":"205_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock D, Goemans MX, Simchi-Levi D, Williamson D (1993) A note on the prize collecting traveling salesman problem. Math Program 59:413\u2013420","journal-title":"Math Program"},{"issue":"12","key":"205_CR6","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1057\/jors.2013.156","volume":"65","author":"V Campos","year":"2014","unstructured":"Campos V, Mart\u00ed R, S\u00e1nchez-Oro J, Duarte A (2014a) Grasp with path relinking for the orienteering problem. J Oper Res Soc 65(12):1800\u20131813","journal-title":"J Oper Res Soc"},{"key":"205_CR7","doi-asserted-by":"publisher","first-page":"1800","DOI":"10.1057\/jors.2013.156","volume":"65","author":"V Campos","year":"2014","unstructured":"Campos V, Mart\u00ed R, S\u00e1nchez-Oro J, Duarte A (2014b) Grasp with path relinking for the orienteering problem. J Oper Res Soc 65:1800\u20131813","journal-title":"J Oper Res Soc"},{"key":"205_CR8","doi-asserted-by":"publisher","first-page":"S719","DOI":"10.1051\/ro\/2020002","volume":"55","author":"G Cl\u00edmaco","year":"2020","unstructured":"Cl\u00edmaco G, Simonetti L, Rosseti I (2020) A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem. RAIRO Oper Res 55:S719\u2013S726","journal-title":"RAIRO Oper Res"},{"issue":"6","key":"205_CR9","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791\u2013812","journal-title":"Oper Res"},{"key":"205_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125610","volume":"262","author":"X Dong","year":"2025","unstructured":"Dong X, Ma L, Zhao X, Shan Y, Wang J, Xu Z (2025) Hybrid genetic algorithm with Wiener process for multi-scale colored balanced traveling salesman problem. Expert Syst Appl 262:125610","journal-title":"Expert Syst Appl"},{"issue":"6","key":"205_CR11","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.23919\/cje.2023.00.040","volume":"33","author":"X Dong","year":"2024","unstructured":"Dong X (2024) Hybrid IT\u00d6 algorithm for large-scale colored traveling salesman problem. Chin J Electron 33(6):1337\u20131345","journal-title":"Chin J Electron"},{"issue":"2","key":"205_CR12","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax P, Gendreau M (2005a) Traveling salesman problems with profits. Transp Sci 39(2):188\u2013205","journal-title":"Transp Sci"},{"key":"205_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet D, Dejax PJ, Gendreau MJTS (2005b) Traveling salesman problems with profits. Transp Sci 39:188\u2013205","journal-title":"Transp Sci"},{"key":"205_CR14","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti M, Gonz\u00e1lez JJS, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J Comput 10:133\u2013148","journal-title":"INFORMS J Comput"},{"issue":"3","key":"205_CR15","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden BL, Levy L, Vohra R (1987) The orienteering problem. Nav Res Logist 34(3):307\u2013318","journal-title":"Nav Res Logist"},{"key":"205_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-23247-3_6","volume":"379","author":"J-K Hao","year":"2012","unstructured":"Hao J-K (2012) Memetic algorithms in discrete optimization. Handbook of Memetic Algorithms 379:73\u201394","journal-title":"Handbook of Memetic Algorithms"},{"issue":"3","key":"205_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/net.22167","volume":"82","author":"P He","year":"2023","unstructured":"He P, Hao JK, Wu Q (2023) Hybrid genetic algorithm for undirected traveling salesman problems with profits. Networks 82(3):189\u2013221","journal-title":"Networks"},{"issue":"2","key":"205_CR18","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2307\/2531823","volume":"43","author":"BS Holland","year":"1987","unstructured":"Holland BS, Copenhaver MD (1987) An improved sequentially rejective Bonferroni test procedure. Biometrics 43(2):417\u2013423","journal-title":"Biometrics"},{"issue":"2","key":"205_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10852-008-9080-2","volume":"7","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez N, Glover F, Laguna M (2008) Multi-objective meta-heuristics for the traveling salesman problem with profits. J Math Model Algorithms 7(2):177\u2013195","journal-title":"J Math Model Algorithms"},{"issue":"5","key":"205_CR20","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s10732-016-9316-7","volume":"22","author":"M Keshtkaran","year":"2016","unstructured":"Keshtkaran M, Ziarati K (2016) A novel GRASP solution approach for the orienteering problem. J Heuristics 22(5):699\u2013726","journal-title":"J Heuristics"},{"key":"205_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2017.09.003","volume":"90","author":"G Kobeaga","year":"2018","unstructured":"Kobeaga G, Merino M, Lozano JA (2018) An efficient evolutionary algorithm for the orienteering problem. Comput Oper Res 90:42\u201359","journal-title":"Comput Oper Res"},{"key":"205_CR22","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ejor.2023.07.034","volume":"313","author":"G Kobeaga","year":"2024","unstructured":"Kobeaga G, Rojas-Delgado J, Merino M, Lozano JA (2024) A revisited branch-and-cut algorithm for large-scale orienteering problems. Eur J Oper Res 313:44\u201368","journal-title":"Eur J Oper Res"},{"key":"205_CR23","first-page":"43","volume":"3","author":"M L \u0301opez-Ib \u0301a \u0303nez","year":"2016","unstructured":"L \u0301opez-Ib \u0301a \u0303nez M, Dubois-Lacoste J, C \u0301aceres LP, Birattari M, St \u0308utzle T (2016) The irace package: iterated racing for automatic algorithm configuration. Oper Res Perspect 3:43\u201358","journal-title":"Oper Res Perspect"},{"key":"205_CR24","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata Y, Br\u00e4ysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37:724\u2013737","journal-title":"Comput Oper Res"},{"issue":"2","key":"205_CR25","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1287\/ijoc.1120.0506","volume":"25","author":"Y Nagata","year":"2013","unstructured":"Nagata Y, Kobayashi S (2013) A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS J Comput 25(2):346\u2013363","journal-title":"INFORMS J Comput"},{"unstructured":"Nagata Y (1997) Edge assembly crossover: a high-power genetic algorithm for the traveling salesman problem. In: Proceedings of the 7th international conference on genetic algorithms. Morgan Kaufmann Publishers Inc. Francisco, USA, pp 450\u2013457","key":"205_CR26"},{"key":"205_CR27","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.20333","volume":"54","author":"N NagataYuichi","year":"2009","unstructured":"NagataYuichi N, Br\u00e4ysyOlli B (2009) Edge assembly-based memetic algorithm for the capacitated vehicle routing problem. Networks 54:205\u2013215","journal-title":"Networks"},{"key":"205_CR28","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.endm.2013.05.101","volume":"41","author":"O Pedro","year":"2013","unstructured":"Pedro O, Saldanha R, Camargo R (2013) A tabu search approach for the prize collecting traveling salesman problem. Electron Notes Discrete Math 41:261\u2013268","journal-title":"Electron Notes Discrete Math"},{"unstructured":"Piwo\u0144ska A (2010) Genetic algorithm finds routes in travelling salesman problem with profits[J]. Zeszyty Naukowe Politechniki Bia\u0142ostockiej. Informatyka 51\u201365","key":"205_CR29"},{"key":"205_CR30","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31:1985\u20132002","journal-title":"Comput Oper Res"},{"key":"205_CR31","first-page":"291","volume":"214","author":"H Qin","year":"2009","unstructured":"Qin H, Lim A, Xu D (2009) The selective traveling salesman problem with regular working time windows. Studies in Computational Intelligence, Opportunities and Challenges for next-Generation Applied Intelligence 214:291\u2013296","journal-title":"Studies in Computational Intelligence, Opportunities and Challenges for next-Generation Applied Intelligence"},{"issue":"3","key":"205_CR32","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TEVC.2008.2011740","volume":"13","author":"PP Repoussis","year":"2009","unstructured":"Repoussis PP, Tarantilis CD, Ioannou G (2009) Arc-guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE Trans Evol Comput 13(3):624\u2013647","journal-title":"IEEE Trans Evol Comput"},{"key":"205_CR33","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.eswa.2018.12.050","volume":"123","author":"A Santini","year":"2019","unstructured":"Santini A (2019) An adaptive large neighbourhood search algorithm for the orienteering problem. Expert Syst Appl 123:154\u2013167","journal-title":"Expert Syst Appl"},{"issue":"3","key":"205_CR34","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10732-009-9104-8","volume":"16","author":"J Silberholz","year":"2010","unstructured":"Silberholz J, Golden B (2010) The effective application of a new approach to the generalized orienteering problem. J Heuristics 16(3):393\u2013415","journal-title":"J Heuristics"},{"doi-asserted-by":"crossref","unstructured":"Sevkli Z, Sevilgen FE (2006) Variable neighborhood search for the orienteering problem. Computer and Information Sciences \u2013 ISCIS 2006, Lecture Notes in Computer Science, pp 134\u2013143","key":"205_CR35","DOI":"10.1007\/11902140_16"},{"key":"205_CR36","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T, Crainic TG, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60:611\u2013624","journal-title":"Oper Res"},{"issue":"3","key":"205_CR37","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658\u2013673","journal-title":"Eur J Oper Res"},{"key":"205_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105643","volume":"140","author":"T Vidal","year":"2022","unstructured":"Vidal T (2022) Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood. Comput Oper Res 140:105643","journal-title":"Comput Oper Res"},{"issue":"4","key":"205_CR39","doi-asserted-by":"publisher","first-page":"5229","DOI":"10.1109\/TII.2023.3330340","volume":"20","author":"J Zhang","year":"2024","unstructured":"Zhang J, Li Y, Li Q, Xiao W (April 2024) Variance-constrained local-global modeling for device-free localization under uncertainties. IEEE Trans Ind Inform 20(4):5229\u20135240. https:\/\/doi.org\/10.1109\/TII.2023.3330340","journal-title":"IEEE Trans Ind Inform"},{"issue":"8","key":"205_CR40","doi-asserted-by":"publisher","first-page":"7773","DOI":"10.1109\/TMC.2025.3552538","volume":"24","author":"J Zhang","year":"2025","unstructured":"Zhang J, Xue J, Li Y, Cotton SL (2025) Leveraging online learning for domain-adaptation in Wi-Fi-based device-free localization. IEEE Trans Mob Comput 24(8):7773\u20137787. https:\/\/doi.org\/10.1109\/TMC.2025.3552538","journal-title":"IEEE Trans Mob Comput"}],"container-title":["Journal of King Saud University Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00205-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44443-025-00205-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44443-025-00205-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T15:37:35Z","timestamp":1761752255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44443-025-00205-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,24]]},"references-count":40,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["205"],"URL":"https:\/\/doi.org\/10.1007\/s44443-025-00205-0","relation":{},"ISSN":["1319-1578","2213-1248"],"issn-type":[{"type":"print","value":"1319-1578"},{"type":"electronic","value":"2213-1248"}],"subject":[],"published":{"date-parts":[[2025,9,24]]},"assertion":[{"value":"12 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"232"}}