{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T04:25:19Z","timestamp":1654143919789},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2005,9,2]],"date-time":"2005-09-02T00:00:00Z","timestamp":1125619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s00291-005-0002-7","type":"journal-article","created":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T04:26:09Z","timestamp":1125548769000},"page":"241-266","source":"Crossref","is-referenced-by-count":2,"title":["Heuristic algorithms for visiting the customers in a rolling schedule environment"],"prefix":"10.1007","volume":"28","author":[{"given":"S. Y.","family":"Teng","sequence":"first","affiliation":[]},{"given":"H. L.","family":"Ong","sequence":"additional","affiliation":[]},{"given":"H. C.","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,2]]},"reference":[{"key":"2_CR1","volume-title":"Local search in combinatorial optimization","author":"E Aarts","year":"1997","unstructured":"Aarts E, Lenstra JK (1997) Local search in combinatorial optimization. Wiley, New York"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0167-6377(89)90037-0","volume":"8","author":"RG Bland","year":"1989","unstructured":"Bland RG, Shallcross DF (1989) Large traveling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation. Oper Res Lett 8:125\u2013128","journal-title":"Oper Res Lett"},{"issue":"3","key":"2_CR3","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao IM, Golden BL, Wasil EA (1996a) A fast and effective heuristic for the orienteering problem. Eur J Oper Res 88(3):475\u2013489","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2_CR4","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao IM, Golden BL, Wasil EA (1996b) The team orienteering problem. Eur J Oper Res 88(3):464\u2013474","journal-title":"Eur J Oper Res"},{"key":"2_CR5","first-page":"81","volume-title":"Proceedings of the fourth international conference on operations research","author":"J Cloonan","year":"1966","unstructured":"Cloonan J (1966) A heuristic approach to some sales territory problems. In: Little JDC (ed) Proceedings of the fourth international conference on operations research. MIT Press, Cambridge, MA, pp 81\u201384"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"de Vries S, Vohra RV (2003) Combinatorial auctions: a survey. INFORMS J Comput 15:284\u2013309","journal-title":"INFORMS J Comput"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/S0377-2217(03)00263-7","volume":"153","author":"X Delorme","year":"2004","unstructured":"Delorme X, Gandibleux X, Rodriguez J (2004) GRASP for set packing problems. Eur J Oper Res 153:564\u2013580","journal-title":"Eur J Oper Res"},{"issue":"2","key":"2_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M Fischetti","year":"1998","unstructured":"Fischetti M, Gonzalez JJS, Toth P (1998) Solving the orienteering problem through branch-and-cut. INFORMS J Comput 10(2):133\u2013148","journal-title":"INFORMS J Comput"},{"issue":"4","key":"2_CR9","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1080\/05695557808975227","volume":"10","author":"D Gensch","year":"1978","unstructured":"Gensch D (1978) An industrial application of the traveling salesman's sub-tour problem. AIIE Trans 10(4):362\u2013370","journal-title":"AIIE Trans"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"PC Gilmore","year":"1964","unstructured":"Gilmore PC, Gomory RE (1964) Sequencing a one-state variable machine: a solvable case of the traveling salesman problem. Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0305-0483(81)90087-6","volume":"9","author":"BL Golden","year":"1981","unstructured":"Golden BL, Levy L, Dahl R (1981) Two generalizations of the traveling salesman problem. Omega 9:439\u2013445","journal-title":"Omega"},{"issue":"3","key":"2_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"BL Golden","year":"1987","unstructured":"Golden BL, Levy L, Vohra R (1987) The orienteering problem. Nav Res Logist 34(3):307\u2013318","journal-title":"Nav Res Logist"},{"issue":"3","key":"2_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H","volume":"35","author":"BL Golden","year":"1988","unstructured":"Golden BL, Wang Q, Liu L (1988) A multifaceted heuristic for the orienteering problem. Nav Res Logist 35(3):359\u2013366","journal-title":"Nav Res Logist"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/S0360-8352(97)00223-4","volume":"33","author":"SH Kim","year":"1997","unstructured":"Kim SH, Lee KK (1997) An optimization-based decision support system for ship scheduling. Comput Ind Eng 33:689\u2013692","journal-title":"Comput Ind Eng"},{"key":"2_CR15","first-page":"1","volume-title":"Mathematical programming: recent developments and applications","author":"BH Korte","year":"1989","unstructured":"Korte BH (1989) Applications of combinatorial optimization. In: Iri M, Tanabe K (eds) Mathematical programming: recent developments and applications. Kluwer Academic Publishers, Dordrecht, pp 1\u201355"},{"key":"2_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21708-5","volume-title":"Combinatorial optimization: theory and algorithms","author":"BH Korte","year":"2000","unstructured":"Korte BH, Vygen J (2000) Combinatorial optimization: theory and algorithms. Springer, Berlin Heidelberg New York"},{"key":"2_CR17","unstructured":"Lau HC, Goh YG (2002) An intelligent brokering system to support multiagent web-based 4th-party logistics. In: Proceedings of the fourteenth international conference on tools with artificial intelligence, pp 10\u201311"},{"key":"2_CR18","volume-title":"The traveling salesman problem: a guided tour of combinatorial optimization","author":"EL Lawler","year":"1985","unstructured":"Lawler EL, Lenstra JK, Kan Rinnooy AHG, Shmoys DB (1985) The traveling salesman problem: a guided tour of combinatorial optimization. Wiley, Chichester, UK"},{"issue":"3","key":"2_CR19","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/(SICI)1520-6750(200004)47:3<185::AID-NAV1>3.0.CO;2-7","volume":"47","author":"A Mehrotra","year":"2000","unstructured":"Mehrotra A, Murphy KE, Trick MA (2000) Optimal shift scheduling: a branch-and-price approach. Nav Res Logist 47(3):185\u2013200","journal-title":"Nav Res Logist"},{"issue":"5","key":"2_CR20","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A Mingozzi","year":"1998","unstructured":"Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for the project scheduling with resource constraints based on a new mathematical formulation. Manage Sci 44(5):714\u2013729","journal-title":"Manage Sci"},{"issue":"3","key":"2_CR21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1057\/jors.1992.37","volume":"43","author":"J Mittenthal","year":"1992","unstructured":"Mittenthal J, Noon CE (1992) An insert delete heuristic for the traveling salesman subset-tour problem with one additional constraint. J Oper Res Soc 43(3):277\u2013283","journal-title":"J Oper Res Soc"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1287\/ijoc.4.2.155","volume":"4","author":"R Ramesh","year":"1992","unstructured":"Ramesh R, Yong-Seok Y, Karwan MH (1992) An optimal algorithm for the orienteering tour problem. ORSA J Comput 4:155\u2013165","journal-title":"ORSA J Comput"},{"key":"2_CR23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0377-2217(94)00023-6","volume":"83","author":"M R\u00f6nnqvist","year":"1995","unstructured":"R\u00f6nnqvist M (1995) A method for the cutting stock problem with different qualities. Eur J Oper Res 83:57\u201368","journal-title":"Eur J Oper Res"},{"key":"2_CR24","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/S0377-2217(00)00064-3","volume":"131","author":"F Rossi","year":"2001","unstructured":"Rossi F, Smriglio S (2001) A set packing model for the ground holding problem in congested networks. Eur J Oper Res 131:400\u2013416","journal-title":"Eur J Oper Res"},{"issue":"3","key":"2_CR25","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/S0377-2217(99)00421-X","volume":"128","author":"SC Sarin","year":"2001","unstructured":"Sarin SC, Aggarwal S (2001) Modeling and algorithmic development of a staff scheduling problem. Eur J Oper Res 128(3):558\u2013569","journal-title":"Eur J Oper Res"},{"key":"2_CR26","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M Savelsbergh","year":"1998","unstructured":"Savelsbergh M, Sol M (1998) Drive: dynamic routing of independent vehicles. Oper Res 46:474\u2013490","journal-title":"Oper Res"},{"issue":"6","key":"2_CR27","doi-asserted-by":"crossref","first-page":"1379","DOI":"10.1016\/j.cor.2003.11.008","volume":"32","author":"H Tang","year":"2005","unstructured":"Tang H, Hooks EM (2005) A TABU search heuristic for the team orienteering problem. Comput Oper Res 32(6):1379\u20131407","journal-title":"Comput Oper Res"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Smith AE (2000) A genetic algorithm for the orienteering problem. In: Proceedings of the 2000 Congress on evolutionary computation, San Diego, CA, pp 1190\u20131195","DOI":"10.1109\/CEC.2000.870739"},{"issue":"9","key":"2_CR29","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T Tsiligirides","year":"1984","unstructured":"Tsiligirides T (1984) Heuristic methods applied to orienteering. J Oper Res Soc 35(9):797\u2013804","journal-title":"J Oper Res Soc"},{"key":"2_CR30","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/978-1-4613-0303-9_9","volume-title":"Handbook of combinatorial optimization, vol 1","author":"RR Vemuganti","year":"1998","unstructured":"Vemuganti RR (1998) Applications of set covering, set packing and set partitioning models: a survey. In: Du D-Z, Pardalos P (eds) Handbook of combinatorial optimization, vol 1. Kluwer Academic Publishers, Amsterdam, pp 573\u2013746"},{"issue":"3","key":"2_CR31","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1287\/trsc.30.3.181","volume":"30","author":"PJ Zwaneveld","year":"1996","unstructured":"Zwaneveld PJ, Kroon LG, Romeijn HE, Salomon M, Dauz\u00e8re-P\u00e9r\u00e8s S, Van Hoesel SP, Ambergen HW (1996) Routing trains through railway stations: model formulation and algorithms. Transp Sci 30(3):181\u2013194","journal-title":"Transp Sci"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-005-0002-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-005-0002-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-005-0002-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T06:59:52Z","timestamp":1559026792000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-005-0002-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["2"],"URL":"https:\/\/doi.org\/10.1007\/s00291-005-0002-7","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9,2]]}}}