Variable neighborhood search for the orienteering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4263 LNCS, Issue , 2006, Pages 134-143

  Sevkli, Zülal ^a   Sevilgen, F Erdoǧan ^b  

^a FATIH UNIVERSITY   (Turkey)

^b GEBZE TECHNICAL UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; PROBLEM SOLVING;

LOCAL SEARCH PHASES; ORIENTEERING PROBLEM (OP); VARIABLE NEIGHBORHOOD SEARCH (VNS);

ALGORITHMS;

EID: 33845247059     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11902140_16     Document Type: Conference Paper

References (25)

1. Balas, E.: The prize collecting traveling salesman problem. Networks, 19 (1989) 621-636.
2. Brimberg, J., Urosevic, D., Mladenovic, N.: Variable neighborhood search for the vertex weighted k-cardinality tree problem. Eur. J. Oper. Res., 2004.
3. Chao, I.-M., B. L. Golden, E. A. Wasil: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res., 88(3) (1996) 475-489.
4. Feillet, D., Dejax, P., Gendreau, M.: Traveling Salesman Problems with Profits. Transportation Science, 39 (2005) 188-205.
5. Fischetti, M., Gonzalez, J. S., Toth, P.: Solving the orienteering problem through branch-and-cut. INFORMS J. Comput., 10(2) (1998)133-148.
6. Golden, B.L., Assad A., Dahl, R.: Analysis of a large-scale vehicle routing problem with inventory component. Large Scale Systems, 7 (1984) 181-190.
7. Golden, B.L., Levy, Vohra, R.: The Orienteering Problem. Naval Res. Logist, 34(3) (1987) 307-318.
8. Golden, B.L., Wang, Q., Liu, L.: A Multifaced heuristic for the orienteering problem. Naval Res. Logist, 35 (1988) 359-366.
9. 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, KJuwer Academic Publishers: Dordrecht. (1999) 433-458.
10. Hansen, P., Mladenovic, N.:Variable neighborhood search: principles and applicatons. Eur. J. Oper. Res., 130 (2001) 449-467.
11. Hansen, P., Mladenovic, N.: Variable neighborhood search for the p-Median. Location Sci., 5 (1997) 207-226.
12. Hayes, M., Norman., J., M.:Dynamic Programming in Orienteering:Route Choice and the Siting of Controls. J. Oper. Res. Soc., 35(9) (1984) 791-796.
13. Kantor, M.G., Rosenwein, M., B.: The orienteering problem with time windows. J. Oper. Res. Soc., 43(6) (1992) 629-635.
14. Kataoka, S., Morito, S.: An algorithm for the single constraint maximum collection problem. J. Oper. Res. Soc., 31(4) (1988) 515-530.
15. Keller, C.P.: Algorithms to solve orienteering problem: A Comparision. Eur. J. Oper. Res., 41 (1989) 224-231.
16. Laporte, G., Martello, S.: The selective traveling salesman problem. Discrete Applied M. 26 (1990)193-207.
17. Leifer, A.C., Rosenwein, M., B.: Strong Lineer Programming relaxations for orienteering problem. Eur. J. Oper. Res., 73 (1994) 517-523.
18. 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'02). (2002), Hawaii.
19. Ramesh, R., Brown, K. M.: An efficient four-phase heuristic for the generalized orienteering problem. Comput. Oper. Res., 18(2) (1991)151-165.
20. Ramesh, R., Yoon, Y.-S., Karwan, M. H.: An optimal algorithm for the orienteering problem. ORSA J. Comput., 4(42) (1992) 155-165.
21. Ribeiro, C., C., Souza, M.,C: Variable Neighborhood Search for the degree-constrained minumum spaning tree problem. Discrete Applied M, 118 (2002) 43-54.
22. Tasgetiren, P.M., Smith, A. E.: A genetic algorithm for the orienteering problem, in Congress Evolutionary Comput. (2000) San Diego, CA.
23. Tsiligirides, T.: Heuristic methods applied to orienteering. J. Oper. Res. Soc., 35(9) (1984) 797-809.
24. Wang, Q., Sun, X., Golden, B. L., Jia, J.: Using artificial neural network to solve orienteering problem. Ann. Oper. Res., 61 (1995)111-120.
25. Wren, A., Holliday, A.: Computer scheduling of vehicles from one or more depots to a number of delivery points. Oper. Res. Quart., 23 (1972) 333-344.