{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:09:00Z","timestamp":1770988140206,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"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 & Operations Research"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0305-0548(94)00031-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"553-565","source":"Crossref","is-referenced-by-count":26,"title":["A new heuristic for the period traveling salesman problem"],"prefix":"10.1016","volume":"22","author":[{"given":"I-Ming","family":"Chao","sequence":"first","affiliation":[]},{"given":"Bruce L.","family":"Golden","sequence":"additional","affiliation":[]},{"given":"Edward A.","family":"Wasil","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)00031-3_BIB1","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(94)00031-3_BIB2","series-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"Lawler","year":"1985"},{"key":"10.1016\/0305-0548(94)00031-3_BIB3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The traveling salesman problem: an overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(94)00031-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\/0305-0548(94)00031-3_BIB5","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":"Comp. Ops Res."},{"key":"10.1016\/0305-0548(94)00031-3_BIB6","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0305-0548(94)00031-3_BIB7","article-title":"Algorithms and solutions to multi-level vehicle routing problems","author":"Chao","year":"1993"},{"key":"10.1016\/0305-0548(94)00031-3_BIB8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","article-title":"Implementing vehicle routing algorithms","volume":"7","author":"Golden","year":"1977","journal-title":"Networks"},{"key":"10.1016\/0305-0548(94)00031-3_BIB9","article-title":"New optimization heuristics, the great deluge algorithm and the record-to-record travel","author":"Dueck","year":"1990"},{"key":"10.1016\/0305-0548(94)00031-3_BIB10","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","article-title":"Computer solutions of the traveling salesman problem","volume":"44","author":"Lin","year":"1965","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0305-0548(94)00031-3_BIB11","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/355972.355976","article-title":"The design of the XMP linear programming library","volume":"7","author":"Marsten","year":"1981","journal-title":"ACM Trans. Math. Software"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894000313?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894000313?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:59:30Z","timestamp":1556351970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894000313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0305054894000313"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)00031-3","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}