{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T04:56:39Z","timestamp":1777870599102,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Foundation for Science and Technology","doi-asserted-by":"publisher","award":["UID\/04561\/2025"],"award-info":[{"award-number":["UID\/04561\/2025"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejor.2026.02.009","type":"journal-article","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T16:41:49Z","timestamp":1770914509000},"page":"365-380","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A matheuristic and a hybrid algorithm for the asymmetric period travelling salesman problem"],"prefix":"10.1016","volume":"333","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5718-8717","authenticated-orcid":false,"given":"Sofia","family":"Henriques","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1339-1974","authenticated-orcid":false,"given":"Ana","family":"Paias","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/j.ejor.2026.02.009_bib0001","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","article-title":"Kernel search: A general heuristic for the multi-dimensional knapsack problem","volume":"37","author":"Angelelli","year":"2010","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2026.02.009_bib0002","series-title":"The traveling salesman problem: A computational study","author":"Applegate","year":"2007"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.009_bib0003","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.ejor.2010.09.008","article-title":"Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs","volume":"208","author":"Bassetto","year":"2011","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.009_bib0004","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/net.3230040106","article-title":"Networks and vehicle routing for municipal waste collection","volume":"4","author":"Beltrami","year":"1974","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.009_bib0005","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/itor.12771","article-title":"Heuristic approaches for the family traveling salesman problem","volume":"28","author":"Bernardino","year":"2021","journal-title":"International Transactions in Operational Research"},{"issue":"8","key":"10.1016\/j.ejor.2026.02.009_bib0006","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1016\/S0305-0548(03)00075-3","article-title":"An improved heuristic for the period traveling salesman problem","volume":"31","author":"Bertazzi","year":"2004","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.009_bib0007","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1008608828763","article-title":"The two-period travelling salesman problem applied to milk collection in Ireland","volume":"7","author":"Butler","year":"1997","journal-title":"Computational Optimization and Applications"},{"issue":"1","key":"10.1016\/j.ejor.2026.02.009_bib0008","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.ejor.2025.04.047","article-title":"Formulations and branch-and-cut algorithms for cycle covers with up to p cycles","volume":"327","author":"Canas","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.009_bib0009","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1016\/0305-0548(94)00031-3","article-title":"A new heuristic for the period traveling salesman problem","volume":"22","author":"Chao","year":"1995","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.009_bib0010","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","article-title":"The period routing problem","volume":"14","author":"Christofides","year":"1984","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.009_bib0011","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1998","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.009_bib0012","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1007\/s12065-023-00858-8","article-title":"Solving a new application of asymmetric TSP by modified migrating birds optimization algorithm","volume":"17","author":"Duman","year":"2024","journal-title":"Evolutionary Intelligence"},{"key":"10.1016\/j.ejor.2026.02.009_bib0013","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Mathematical Programming"},{"issue":"5","key":"10.1016\/j.ejor.2026.02.009_bib0014","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1016\/j.cor.2006.08.004","article-title":"Repairing MIP infeasibility through local branching","volume":"35","author":"Fischetti","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.009_bib0015","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","article-title":"A variable neighborhood search heuristic for periodic routing problems","volume":"195","author":"Hemmelmayr","year":"2009","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.009_bib0016","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.ejor.2025.01.015","article-title":"Formulations and branch-and-cut algorithms for the period travelling salesman problem","volume":"323","author":"Henriques","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2026.02.009_bib0017","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2025.02.024","article-title":"An iterated local search algorithm for the traveling purchaser problem","volume":"324","author":"Kapancioglu","year":"2025","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.009_bib0018","series-title":"Handbook of metaheuristics","first-page":"320","article-title":"Iterated local search","author":"Louren\u00e7o","year":"2003"},{"key":"10.1016\/j.ejor.2026.02.009_bib0019","series-title":"Matheuristics: Algorithms and implementations","first-page":"189","article-title":"Kernel search","author":"Maniezzo","year":"2021"},{"issue":"8","key":"10.1016\/j.ejor.2026.02.009_bib0020","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/0305-0548(92)90018-Z","article-title":"A multiperiod traveling salesman problem: Heuristic algorithms","volume":"19","author":"Paletta","year":"1992","journal-title":"Computers & Operations Research"},{"issue":"10","key":"10.1016\/j.ejor.2026.02.009_bib0021","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1016\/S0305-0548(01)00035-1","article-title":"The period traveling salesman problem: A new heuristic algorithm","volume":"29","author":"Paletta","year":"2002","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.02.009_bib0022","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1016\/j.ejor.2014.02.011","article-title":"An iterated local search algorithm for the vehicle routing problem with backhauls","volume":"237","author":"Palhazi Cuervo","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.02.009_bib0023","unstructured":"Reinelt, G. (1995). TSPLIB: A library of sample instances for the TSP (and related problems) from various sources and of various types. URL: http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95."},{"key":"10.1016\/j.ejor.2026.02.009_bib0024","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10.1016\/j.ejor.2026.02.009_bib0025","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1287\/opre.4.4.443","article-title":"A two-phase method for the simplex tableau","volume":"4","author":"Wagner","year":"1956","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001475?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726001475?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:25:35Z","timestamp":1777566335000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726001475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0377221726001475"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.009","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A matheuristic and a hybrid algorithm for the asymmetric period travelling salesman problem","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.02.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}