{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:21:09Z","timestamp":1773656469859,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":[[2003,4]]},"DOI":"10.1016\/s0305-0548(02)00020-5","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T19:05:42Z","timestamp":1038855942000},"page":"491-504","source":"Crossref","is-referenced-by-count":52,"title":["Heuristics for the traveling purchaser problem"],"prefix":"10.1016","volume":"30","author":[{"given":"Fayez F.","family":"Boctor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Renaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00020-5_BIB1","first-page":"78","article-title":"Traveling purchaser problem","volume":"18","author":"Ramesh","year":"1981","journal-title":"Opsearch"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB2","unstructured":"Laporte G, Riera-Ledesma J, Salazar-Gonz\u00e1lez J-J. A branch-and-cut algorithm for the undirected traveling purchaser problem. 2000, Unpublished paper."},{"key":"10.1016\/S0305-0548(02)00020-5_BIB3","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(96)00313-X","article-title":"A branch and bound algorithm for the traveling purchaser problem","volume":"97","author":"Singh","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/nav.3800180106","article-title":"Sequencing many jobs on a multipurpose facility","volume":"18","author":"Buzacott","year":"1971","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB5","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0377-2217(97)00142-2","article-title":"An efficient composite heuristic for the symmetric generalized traveling salesman problem","volume":"108","author":"Renaud","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB6","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","article-title":"Two generalizations of the traveling salesman problem","volume":"9","author":"Golden","year":"1981","journal-title":"Omega"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(82)90041-4","article-title":"Approximate algorithms for the travelling purchaser problem","volume":"1","author":"Ong","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB8","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/S0305-0548(98)00032-X","article-title":"Improved solutions for the traveling purchaser problem","volume":"25","author":"Pearn","year":"1998","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02125457","article-title":"Dynamic tabu search strategies for the traveling purchaser problem","volume":"63","author":"Vo\u00df","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(89)90072-0","article-title":"An approximate algorithm for the TSP","volume":"31","author":"Basart","year":"1989","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB11","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1287\/ijoc.8.2.134","article-title":"A fast composite heuristic for the symmetric traveling salesman problem","volume":"8","author":"Renaud","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB12","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1057\/jors.1996.60","article-title":"Genetic algorithms\u2014a tool for OR?","volume":"47","author":"Dowsland","year":"1996","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(02)00020-5_BIB13","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/S0305-0548(00)00109-X","article-title":"Perturbation heuristics for the pickup and delivery traveling salesman problem","volume":"29","author":"Renaud","year":"2002","journal-title":"Computers & Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000205?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000205?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T23:21:30Z","timestamp":1557098490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0305054802000205"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00020-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}