A simple and efficient tabu search heuristic for solving the open vehicle routing problem

Journal of the Operational Research Society

Volumn 60, Issue 12, 2009, Pages 1658-1669

  Derigs, U ^a   Reuter, K ^b  

^a UNIVERSITY OF COLOGNE   (Germany)

^b Seminar for Information Systems and Operations Res   (Germany)

Author keywords

Distribution; Heuristics; Vehicle routing

Indexed keywords

HEURISTIC ALGORITHMS; TABU SEARCH; VEHICLES;

ATTRIBUTE-BASED; DISTRIBUTION; HEURISTICS; OPEN VEHICLE ROUTING PROBLEMS; TABU SEARCH HEURISTIC; VEHICLE ROUTING PROBLEMS;

VEHICLE ROUTING;

EID: 70350277319     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2008.107     Document Type: Article

References (26)

1. Bodin L, Golden B, Assad A and Ball M (1983). Routing and scheduling of vehicles and crews: The state of the art. Comput Oper Res 10: 63-211. (Pubitemid 13577352)
2. Brandäo J (2004). A tabu search algorithm for the open vehicle routing problem. Eur J Opl Res 157: 552-564.
3. Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P and Sandi C (eds). Combinatorial Optimization. Wiley: Chichester, pp 315-338.
4. Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Opns Res 12: 568-581.
5. Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512-522.
6. Derigs U and Kaiser R (2007). Applying the attribute based hill climber heuristic to the vehicle routing problem. Eur J Opl Res 177: 719-732.
7. Fisher ML (1994). Optimal solution of vehicle routing problems using minimum k-trees. Opns Res 42: 626-642.
8. Fleszar K, Osman IH and Hindi KS (2008). A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Opl Res, doi:10.1016/j.ejor.2007.06.064.
9. Fu Z, Eglese R and Li LYO (2005). A new tabu search heuristic for the open vehicle routing problem. J Opl Res Soc 56: 267-274 with Corrigendum in J Opl Res Soc 57: 1018.
10. Gillett BE and Miller LR (1974). A heuristic algorithm for the vehicledispatch problem. Opns Res 22: 340-349.
11. Glover F (1989). Tabu search-part I. ORSA J Comput 1: 190-206.
12. Glover F (1990). Tabu search-part II. ORSA J Comput 2: 4-32.
13. Laporte G (2005). Metaheuristics for the vehicle routing problem. Paper presented at Operations Research, Bremen, Germany.
14. Laporte G and Osman IH (1995). Routing problems: A bibliography. Ann Opns Res 61: 227-262.
15. Letchford AN, Lysgaard J and Eglese RW (2006). A branch-and-cut algorithm for the capacitated open vehicle routing problem. J Opl Res Soc 58: 1642-1651.
16. Li F, Golden B and Wasil E (2005). The open vehicle routing problem: Algorithms, large-scale test problems and computational results. Comput Opns Res 34: 2918-2930.
17. Pisinger D and Ropke S (2007). A general heuristic for vehicle routing problems. Comput Opns Res 34: 2403-2435.
18. Potvin J-Y and Rousseau J-M (1995). An exchange heuristic for routing problems with time windows. J Opl Res Soc 46: 1433-1446.
19. Sariklis D and Powell S (2000). A heuristic method for the open vehicle routing problem. J Opl Res Soc 51: 564-573.
20. Savelsbergh MWP (1992). The vehicle routing problem with time windows: Minimizing route duration. ORSA J Comput 4: 146-154.
21. Schrage L (1981). Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11: 229-232.
22. Tarantilis CD, Diakoulaki D and Kiranoudis CT (2004a). Combination of geographical information system and efficient routing algorithms for real life distribution operations. Eur J Opl Res 152: 437-453.
23. Tarantilis CD, Ioannou G, Kiranoudis CT and Prastacos GP (2004b). A threshold accepting approach to the open vehicle routing problem. RAIRO Opns Res 38: 345-360.
24. Tarantilis CD, Ioannou G, Kiranoudis CT and Prastacos GP (2005). Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. J Opl Res Soc 56: 588-596.
25. Toth P and Vigo D (2002). An overview of vehicle routing problems. In: Toth P and Vigo D (eds). The Vehicle Routing Problem. SIAM-Society for Industrial and Applied Mathematics: Philadelphia, pp 1-25.
26. Whittley IM and Smith GD (2004). The attribute based hill climber. J Math Model Algor 3: 167-178.