{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T11:53:54Z","timestamp":1772020434814,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540472421","type":"print"},{"value":"9783540472438","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11902140_16","type":"book-chapter","created":{"date-parts":[[2006,10,26]],"date-time":"2006-10-26T13:35:29Z","timestamp":1161869729000},"page":"134-143","source":"Crossref","is-referenced-by-count":37,"title":["Variable Neighborhood Search for the Orienteering Problem"],"prefix":"10.1007","author":[{"given":"Z\u00fclal","family":"Sevkli","sequence":"first","affiliation":[]},{"given":"F. Erdo\u011fan","family":"Sevilgen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks\u00a019, 621\u2013636 (1989)","journal-title":"Networks"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Brimberg, J., Urosevic, D., Mladenovic, N.: Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur. J. Oper. Res. (2004)","DOI":"10.1016\/S0305-0548(03)00073-X"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/0377-2217(95)00035-6","volume":"88","author":"I.-M. Chao","year":"1996","unstructured":"Chao, I.-M., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res.\u00a088(3), 475\u2013489 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/trsc.1030.0079","volume":"39","author":"D. Feillet","year":"2005","unstructured":"Feillet, D., Dejax, P., Gendreau, M.: Traveling Salesman Problems with Profits. Transportation Science\u00a039, 188\u2013205 (2005)","journal-title":"Transportation Science"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","volume":"10","author":"M. Fischetti","year":"1998","unstructured":"Fischetti, M., Gonzalez, J.S., Toth, P.: Solving the orienteering problem through branch-and-cut. Informs J. Comput.\u00a010(2), 133\u2013148 (1998)","journal-title":"Informs J. Comput."},{"key":"16_CR6","first-page":"181","volume":"7","author":"B.L. Golden","year":"1984","unstructured":"Golden, B.L., Assad, A., Dahl, R.: Analysis of a large-scale vehicle routing problem with inventory component. Large Scale Systems\u00a07, 181\u2013190 (1984)","journal-title":"Large Scale Systems"},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1002\/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D","volume":"34","author":"B.L. Golden","year":"1987","unstructured":"Golden, B.L., Levy, V.R.: The Orienteering Problem. Naval Res. Logist\u00a034(3), 307\u2013318 (1987)","journal-title":"Naval Res. Logist"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/1520-6750(198806)35:3<359::AID-NAV3220350305>3.0.CO;2-H","volume":"35","author":"B.L. Golden","year":"1988","unstructured":"Golden, B.L., Wang, Q., Liu, L.: A Multifaced heuristic for the orienteering problem. Naval Res. Logist\u00a035, 359\u2013366 (1988)","journal-title":"Naval Res. Logist"},{"key":"16_CR9","first-page":"433","volume-title":"An introduction to variable neighborhood search, in Metaheuristics, advances and in local search paradigms for optimization, i.S.V.e. al","author":"P. Hansen","year":"1999","unstructured":"Hansen, P., Mladenovic, N.: An introduction to variable neighborhood search, in Metaheuristics, advances and in local search paradigms for optimization, i.S.V.e. al, pp. 433\u2013458. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search: principles and applicatons. Eur. J. Oper. Res.\u00a0130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P. Hansen","year":"1997","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search for the p-Median. Location Sci.\u00a05, 207\u2013226 (1997)","journal-title":"Location Sci."},{"issue":"9","key":"16_CR12","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1057\/jors.1984.161","volume":"35","author":"M. Hayes","year":"1984","unstructured":"Hayes, M., Norman, J.M.: Dynamic Programming in Orienteering:Route Choice and the Siting of Controls. J. Oper. Res. Soc.\u00a035(9), 791\u2013796 (1984)","journal-title":"J. Oper. Res. Soc."},{"issue":"6","key":"16_CR13","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1057\/jors.1992.88","volume":"43","author":"M.G. Kantor","year":"1992","unstructured":"Kantor, M.G., Rosenwein, M.B.: The orienteering problem with time windows. J. Oper. Res. Soc.\u00a043(6), 629\u2013635 (1992)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"16_CR14","first-page":"515","volume":"31","author":"S. Kataoka","year":"1988","unstructured":"Kataoka, S., Morito, S.: An algorithm for the single constraint maximum collection problem. J. Oper. Res. Soc.\u00a031(4), 515\u2013530 (1988)","journal-title":"J. Oper. Res. Soc."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0377-2217(89)90388-3","volume":"41","author":"C.P. Keller","year":"1989","unstructured":"Keller, C.P.: Algorithms to solve orienteering problem: A Comparision. Eur. J. Oper. Res.\u00a041, 224\u2013231 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0166-218X(90)90100-Q","volume":"26","author":"G. Laporte","year":"1990","unstructured":"Laporte, G., Martello, S.: The selective traveling salesman problem. Discrete Applied M\u00a026, 193\u2013207 (1990)","journal-title":"Discrete Applied M"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/0377-2217(94)90247-X","volume":"73","author":"A.C. Leifer","year":"1994","unstructured":"Leifer, A.C., Rosenwein, M.B.: Strong Lineer Programming relaxations for orienteering problem. Eur. J. Oper. Res.\u00a073, 517\u2013523 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR18","unstructured":"Liang, Y.-C., Kulturel-Konak, S., Smith, A.E.: Meta Heuristic For the Orienteering Problem. In: Proceeding of the 2002 Congress on Evolutionary Computation (CEC 2002), Hawaii (2002)"},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0305-0548(91)90086-7","volume":"18","author":"R. Ramesh","year":"1991","unstructured":"Ramesh, R., Brown, K.M.: An efficient four-phase heuristic for the generalized orienteering problem. Comput. Oper. Res.\u00a018(2), 151\u2013165 (1991)","journal-title":"Comput. Oper. Res."},{"issue":"42","key":"16_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1287\/ijoc.4.2.155","volume":"4","author":"R. Ramesh","year":"1992","unstructured":"Ramesh, R., Yoon, Y.-S., Karwan, M.H.: An optimal algorithm for the orienteering problem. ORSA J. Comput.\u00a04(42), 155\u2013165 (1992)","journal-title":"ORSA J. Comput."},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0166-218X(01)00255-4","volume":"118","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Souza, M.C.: Variable Neighborhood Search for the degree-constrained minumum spaning tree problem. Discrete Applied M\u00a0118, 43\u201354 (2002)","journal-title":"Discrete Applied M"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Tasgetiren, F.M., Smith, A.E.: A genetic algorithm for the orienteering problem. In: Congress Evolutionary Comput. San Diego, CA (2000)","DOI":"10.1109\/CEC.2000.870739"},{"issue":"9","key":"16_CR23","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1057\/jors.1984.162","volume":"35","author":"T. Tsiligirides","year":"1984","unstructured":"Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc.\u00a035(9), 797\u2013809 (1984)","journal-title":"J. Oper. Res. Soc."},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02098284","volume":"61","author":"Q. Wang","year":"1995","unstructured":"Wang, Q., Sun, X., Golden, B.L., Jia, J.: Using artificial neural network to solve orienteering problem. Ann. Oper. Res.\u00a061, 111\u2013120 (1995)","journal-title":"Ann. Oper. Res."},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1057\/jors.1972.53","volume":"23","author":"A. Wren","year":"1972","unstructured":"Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. Oper. Res. Quart.\u00a023, 333\u2013344 (1972)","journal-title":"Oper. Res. Quart."}],"container-title":["Lecture Notes in Computer Science","Computer and Information Sciences \u2013 ISCIS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11902140_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:56:23Z","timestamp":1605642983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11902140_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472421","9783540472438"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11902140_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}