{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:57:22Z","timestamp":1761893842986},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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":[[1991,1]]},"DOI":"10.1016\/0305-0548(91)90086-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"151-165","source":"Crossref","is-referenced-by-count":76,"title":["An efficient four-phase heuristic for the generalized orienteering problem"],"prefix":"10.1016","volume":"18","author":[{"given":"R.","family":"Ramesh","sequence":"first","affiliation":[]},{"given":"Kathleen M.","family":"Brown","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(91)90086-7_BIB1","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic methods applied to orienteering","volume":"35","author":"Tsiligirides","year":"1984","journal-title":"J. Ops Res. Soc."},{"key":"10.1016\/0305-0548(91)90086-7_BIB2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","article-title":"The orienteering problem","volume":"34","author":"Golden","year":"1987","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90086-7_BIB3","article-title":"A time relaxed version of the orienteering problem","author":"Golden","year":"1986"},{"issue":"4","key":"10.1016\/0305-0548(91)90086-7_BIB4","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\/0305-0548(91)90086-7_BIB5","series-title":"Paper presented at the ITORSA\/TIMS Conf.","article-title":"The prize collecting traveling salesman problem","author":"Balas","year":"1986"},{"issue":"5","key":"10.1016\/0305-0548(91)90086-7_BIB6","doi-asserted-by":"crossref","DOI":"10.2514\/3.20327","article-title":"Efficiency-guided method for traveling salesman-like resource allocation problems","volume":"11","author":"Press","year":"1988","journal-title":"J. Guid. Control"},{"issue":"5","key":"10.1016\/0305-0548(91)90086-7_BIB7","doi-asserted-by":"crossref","DOI":"10.2514\/3.20334","article-title":"Expert systems approach for generalized traveling salesman problem","volume":"11","author":"Lirov","year":"1988","journal-title":"J. Guid. Control"},{"issue":"5","key":"10.1016\/0305-0548(91)90086-7_BIB8","doi-asserted-by":"crossref","DOI":"10.2514\/3.20332","article-title":"Birth of a salesman","volume":"11","author":"Shaw","year":"1988","journal-title":"J. Guid. Control"},{"issue":"5","key":"10.1016\/0305-0548(91)90086-7_BIB9","doi-asserted-by":"crossref","DOI":"10.2514\/3.20329","article-title":"Rapid solution of constrained traveling salesman problems","volume":"11","author":"DeJong","year":"1988","journal-title":"J. Guid. Control"},{"key":"10.1016\/0305-0548(91)90086-7_BIB10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1057\/jors.1972.53","article-title":"Computer scheduling of vehicles from one or more depots to a number of delivery points","volume":"23","author":"Wren","year":"1972","journal-title":"Ops Res. Q."},{"key":"10.1016\/0305-0548(91)90086-7_BIB11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H","article-title":"A multifaceted heuristic for the orienteering problem","volume":"35","author":"Golden","year":"1988","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/0305-0548(91)90086-7_BIB12","series-title":"ROLL-A-ROUND: software package for scheduling the rounds of a rolling mill","author":"Balas","year":"1985"},{"key":"10.1016\/0305-0548(91)90086-7_BIB13","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. Technol. J."},{"key":"10.1016\/0305-0548(91)90086-7_BIB14","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","article-title":"An effective heuristic algorithm for the traveling salesman problem","volume":"21","author":"Lin","year":"1973","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(91)90086-7_BIB15","article-title":"An optimal algorithm for the orienteering tour problem using problem reformulation and Lagrangian relaxation","author":"Ramesh","year":"1988"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054891900867?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054891900867?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:21:18Z","timestamp":1552915278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054891900867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["0305054891900867"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(91)90086-7","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}