{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:08:59Z","timestamp":1770988139796,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2004,7,1]],"date-time":"2004-07-01T00:00:00Z","timestamp":1088640000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2004,7]]},"DOI":"10.1016\/s0305-0548(03)00075-3","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T18:23:46Z","timestamp":1051727026000},"page":"1215-1222","source":"Crossref","is-referenced-by-count":23,"title":["An improved heuristic for the period traveling salesman problem"],"prefix":"10.1016","volume":"31","author":[{"given":"Luca","family":"Bertazzi","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Paletta","sequence":"additional","affiliation":[]},{"given":"M.Grazia","family":"Speranza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00075-3_BIB1","first-page":"149","article-title":"The state of the art in the routing and scheduling of vehicles and crews","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB2","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":"1997","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB3","series-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB4","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"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB5","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/0305-0548(92)90018-Z","article-title":"A multiperiod traveling salesman problem","volume":"19","author":"Paletta","year":"1992","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB6","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 and Operations Research"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB7","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.1016\/S0305-0548(01)00035-1","article-title":"The period traveling salesman problem","volume":"29","author":"Paletta","year":"2002","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","article-title":"New optimization heuristics, the great deluge algorithm and the record-to-record travel","volume":"104","author":"Dueck","year":"1993","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB9","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00075-3_BIB10","unstructured":"Chao IM. Algorithms and solutions to multi-level vehicle routing problems. Ph.D. dissertation, Applied Mathematics Program, University of Maryland, College Park, MD, 1993."},{"key":"10.1016\/S0305-0548(03)00075-3_BIB11","unstructured":"Cordeau JF, Gendreau M, Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Publication CRT-95-76, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, 1995."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000753?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000753?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:50:46Z","timestamp":1553183446000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000753"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7]]},"references-count":11,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2004,7]]}},"alternative-id":["S0305054803000753"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00075-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,7]]}}}