{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:34:52Z","timestamp":1757313292365,"version":"3.41.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:00:00Z","timestamp":1747180800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s10732-025-09559-0","type":"journal-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T05:38:33Z","timestamp":1747201113000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A biased-randomised iterated local search for the team orienteering arc routing problem allowing different origin and destination"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4182-0120","authenticated-orcid":false,"given":"Xabier A.","family":"Martin","sequence":"first","affiliation":[]},{"given":"Peter","family":"Keenan","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Panadero","sequence":"additional","affiliation":[]},{"given":"Sean","family":"McGarraghy","sequence":"additional","affiliation":[]},{"given":"Angel A.","family":"Juan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,14]]},"reference":[{"key":"9559_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Akella, S.: The correlated arc orienteering problem. In: Algorithmic Foundations of Robotics XV: Proceedings of the Fifteenth Workshop on the Algorithmic Foundations of Robotics, pp. 402\u2013418. Springer, Berlin (2022)","DOI":"10.1007\/978-3-031-21090-7_24"},{"issue":"11","key":"9559_CR2","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1016\/j.cor.2009.05.005","volume":"37","author":"C Archetti","year":"2010","unstructured":"Archetti, C., Feillet, D., Hertz, A., Speranza, M.G.: The undirected capacitated arc routing problem with profits. Comput. Oper. Res. 37(11), 1860\u20131869 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9559_CR3","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/trsc.2013.0484","volume":"48","author":"C Archetti","year":"2014","unstructured":"Archetti, C., Speranza, M.G., Corber\u00e1n, \u00c1ngel., Sanchis, J.M., Plana, I.: The team orienteering arc routing problem. Transp. Sci. 48(3), 442\u2013457 (2014)","journal-title":"Transp. Sci."},{"issue":"2","key":"9559_CR4","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ejor.2015.03.022","volume":"245","author":"C Archetti","year":"2015","unstructured":"Archetti, C., Corber\u00e1n, \u00c1ngel., Plana, I., Sanchis, J.M., Speranza, M.G.: A matheuristic for the team orienteering arc routing problem. Eur. J. Oper. Res. 245(2), 392\u2013401 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"9559_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105653","volume":"140","author":"N Bianchessi","year":"2022","unstructured":"Bianchessi, N., Corber\u00e1n, \u00c1., Plana, I., Reula, M., Sanchis, J.M.: The profitable close-enough arc routing problem. Comput. Oper. Res. 140, 105653 (2022)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9559_CR6","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I-M Chao","year":"1996","unstructured":"Chao, I.-M., Golden, B.L., Wasil, E.A.: The team orienteering problem. Eur. J. Oper. Res. 88(3), 464\u2013474 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9559_CR7","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/net.21965","volume":"77","author":"A Corber\u00e1n","year":"2021","unstructured":"Corber\u00e1n, A., Eglese, R., Hasle, G., Plana, I., Sanchis, J.M.: Arc routing problems: a review of the past, present, and future. Networks 77(1), 88\u2013115 (2021)","journal-title":"Networks"},{"issue":"1","key":"9559_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10479-018-2777-3","volume":"273","author":"J de Armas","year":"2019","unstructured":"de Armas, J., Keenan, P., Juan, A.A., McGarraghy, S.: Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics. Ann. Oper. Res. 273(1), 135\u2013162 (2019)","journal-title":"Ann. Oper. Res."},{"key":"9559_CR9","doi-asserted-by":"crossref","unstructured":"do C. Martins, L., Hirsch, P., and Juan, A. A.: Agile optimization of a two-echelon vehicle routing problem with pickup and delivery. Int. Trans. Oper. Res. 28(1), 201\u2013221 (2021)","DOI":"10.1111\/itor.12796"},{"issue":"1","key":"9559_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1057\/jors.2015.48","volume":"67","author":"O Dominguez","year":"2016","unstructured":"Dominguez, O., Juan, A.A., De La Nuez, I.A., Ouelhadj, D.: An ILS-biased randomization algorithm for the two-dimensional loading HFVRP with sequential loading and items rotation. J. Oper. Res. Soc. 67(1), 37\u201353 (2016)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"9559_CR11","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1111\/itor.12625","volume":"26","author":"A Estrada-Moreno","year":"2019","unstructured":"Estrada-Moreno, A., Savelsbergh, M., Juan, A.A., Panadero, J.: Biased-randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility. Int. Trans. Oper. Res. 26(4), 1293\u20131314 (2019)","journal-title":"Int. Trans. Oper. Res."},{"issue":"4","key":"9559_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1287\/trsc.1040.0106","volume":"39","author":"D Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: The profitable arc tour problem: solution with a branch-and-price algorithm. Transp. Sci. 39(4), 539\u2013552 (2005)","journal-title":"Transp. Sci."},{"issue":"2","key":"9559_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1504\/EJIE.2017.083257","volume":"11","author":"A Gruler","year":"2017","unstructured":"Gruler, A., Quintero-Ara\u00fajo, C.L., Calvet, L., Juan, A.A.: Waste collection under uncertainty: a simheuristic based on variable neighbourhood search. Eur. J. Ind. Eng. 11(2), 228\u2013255 (2017)","journal-title":"Eur. J. Ind. Eng."},{"key":"9559_CR14","doi-asserted-by":"crossref","unstructured":"Ke, L., Yang, W.: Reformulation and metaheuristic for the team orienteering arc routing problem. In: Advances in Swarm Intelligence: 8th International Conference, ICSI 2017, Fukuoka, Japan, July 27\u2013August 1, 2017, Proceedings, Part II 8, pp. 494\u2013501. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-61833-3_52"},{"issue":"6","key":"9559_CR15","first-page":"99","volume":"2","author":"K Magzhan","year":"2013","unstructured":"Magzhan, K., Jani, H.M.: A review and evaluations of shortest path algorithms. Int. J. Sci. Technol. Res. 2(6), 99\u2013104 (2013)","journal-title":"Int. J. Sci. Technol. Res."},{"issue":"2","key":"9559_CR16","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0377-2217(93)90335-K","volume":"65","author":"C Malandraki","year":"1993","unstructured":"Malandraki, C., Daskin, M.S.: The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem. Eur. J. Oper. Res. 65(2), 218\u2013234 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9559_CR17","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1504\/EJIE.2020.108581","volume":"14","author":"J Panadero","year":"2020","unstructured":"Panadero, J., Juan, A.A., Bayliss, C., Currie, C.: Maximising reward from a team of surveillance drones: a simheuristic approach to the stochastic team orienteering problem. Eur. J. Ind. Eng. 14(4), 485\u2013516 (2020)","journal-title":"Eur. J. Ind. Eng."},{"key":"9559_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120513","volume":"230","author":"M Reula","year":"2023","unstructured":"Reula, M., Mart\u00ed, R.: Heuristics for the profitable close-enough arc routing problem. Expert Syst. Appl. 230, 120513 (2023)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"9559_CR19","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ejor.2017.03.027","volume":"262","author":"J Riera-Ledesma","year":"2017","unstructured":"Riera-Ledesma, J., Salazar-Gonz\u00e1lez, J.J.: Solving the team orienteering arc routing problem with a column generation approach. Eur. J. Oper. Res. 262(1), 14\u201327 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"9559_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)"},{"issue":"1","key":"9559_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: a survey. Eur. J. Oper. Res. 209(1), 1\u201310 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"9559_CR22","doi-asserted-by":"publisher","first-page":"2086","DOI":"10.1080\/13658816.2022.2045605","volume":"36","author":"K Wang","year":"2022","unstructured":"Wang, K., Wu, Q., He, X., Hu, C., Chen, N.: Optimizing UAV traffic monitoring routes during rush hours considering spatiotemporal variation of monitoring demand. Int. J. Geogr. Inf. Sci. 36(10), 2086\u20132111 (2022)","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"1","key":"9559_CR23","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1016\/j.ejor.2022.05.046","volume":"305","author":"G Zhang","year":"2023","unstructured":"Zhang, G., Jia, N., Zhu, N., Adulyasak, Y., Ma, S.: Robust drone selective routing in humanitarian transportation network assessment. Eur. J. Oper. Res. 305(1), 400\u2013428 (2023)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09559-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-025-09559-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-025-09559-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T05:42:33Z","timestamp":1749620553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-025-09559-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,14]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["9559"],"URL":"https:\/\/doi.org\/10.1007\/s10732-025-09559-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2025,5,14]]},"assertion":[{"value":"1 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"24"}}