{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T04:30:35Z","timestamp":1784521835840,"version":"3.55.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0377-2217(99)00323-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"69-77","source":"Crossref","is-referenced-by-count":34,"title":["The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm"],"prefix":"10.1016","volume":"127","author":[{"given":"Ray","family":"Deitch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaul P","family":"Ladany","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2\u20133","key":"10.1016\/S0377-2217(99)00323-9_BIB1","first-page":"61","article-title":"A heuristic improvement process algorithm for the touring problem","volume":"23","author":"Deitch","year":"1994","journal-title":"SCIMA"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB2","unstructured":"R. Deitch, S.P. Ladany, Determination of optimal one-period tourist bus tours with identical starting and terminal points, International Journal of Technology Management, Special Issue on Yield Management (to be published)"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB3","first-page":"13","article-title":"Determination of optimal two-period tourist bus tours with identical starting and terminal points","volume":"5","author":"Deitch","year":"1997","journal-title":"Studies in Regional and Urban Planning"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB4","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":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB5","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":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB6","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0160-7383(90)90087-8","article-title":"Application of the Delphi technique in tourism","volume":"17","author":"Green","year":"1990","journal-title":"Annals of Tourism Research"},{"issue":"6","key":"10.1016\/S0377-2217(99)00323-9_BIB7","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1057\/jors.1992.88","article-title":"The orienteering problem with time windows","volume":"43","author":"Kantor","year":"1992","journal-title":"Journal of the Operations Research Society"},{"issue":"2","key":"10.1016\/S0377-2217(99)00323-9_BIB8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1177\/135481669900500204","article-title":"Optimal tourist bus tours","volume":"5","author":"Ladany","year":"1999","journal-title":"Tourism Economics"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB9","unstructured":"S. Makridakis, S.C. Wheelwright, V.E. McGee, The Delphi approach, in: Forecasting Methods and Applications, 2nd ed., Wiley, New York, 1983, pp. 652\u2013655"},{"issue":"2","key":"10.1016\/S0377-2217(99)00323-9_BIB10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1287\/ijoc.4.2.155","article-title":"An optimal algorithm for the orienteering problem","volume":"4","author":"Ramesh","year":"1992","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB11","unstructured":"E.S. Linns, Linear Programming Models with LINDO, Scientific Press, Palo Alto, CA, 1981"},{"issue":"9","key":"10.1016\/S0377-2217(99)00323-9_BIB12","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":"Journal of the Operations Research Society"},{"key":"10.1016\/S0377-2217(99)00323-9_BIB13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02098284","article-title":"Using artificial neural networks to solve the orienteering problem","volume":"61","author":"Wang","year":"1995","journal-title":"Annals of Operation Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003239?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003239?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:54:33Z","timestamp":1556452473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799003239"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0377221799003239"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00323-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}