An open vehicle routing problem metaheuristic for examining wide solution neighborhoods

Computers and Operations Research

Volumn 37, Issue 4, 2010, Pages 712-723

  Zachariadis, Emmanouil E ^a   Kiranoudis, Chris T ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Computational complexity; Metaheuristics; Open vehicle routing; Tabu search

Indexed keywords

CANDIDATE SOLUTION; COMPUTATIONAL EFFORT; CUSTOMER DEMANDS; DELIVERY SERVICE; DESCRIPTORS; FIBONACCI HEAP; INSERTIONS AND DELETIONS; LOCAL SEARCH; LOCAL SEARCH OPERATORS; METAHEURISTIC; METAHEURISTICS; MINIMUM COST; OPEN VEHICLE ROUTING; OPEN VEHICLE ROUTING PROBLEMS; PRACTICAL TRANSPORTATION; PRIORITY QUEUES;

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; NETWORK ROUTING; ROUTING ALGORITHMS; TABU SEARCH; VEHICLES;

VEHICLE ROUTING;

EID: 70350575200     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.06.021     Document Type: Article

References (32)

1. Li F., Golden B., and Wasil E. Very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32 5 (2005) 1165-1179
2. Fu Z., Eglese R.W., and Li L.Y.O. A new tabu search heuristic for the open vehicle routing problem. J Oper Res Soc 56 (2005) 267-274
3. Fu Z., Eglese R.W., and Li L.Y.O. Corrigendum. A new tabu search heuristic for the open vehicle routing problem. J Oper Res Soc 57 (2006) 1018
4. Brandão J. A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157 3 (2004) 552-564
5. Russell R., Chiang W.-C., and Zepeda D. Integrating multi-product production and distribution in newspaper logistics. Comput Oper Res 35 5 (2008) 1576-1588
6. Bodin L., Golden B., Assad A., and Ball M. Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10 2 (1983) 63-211
7. Fu Z., and Wright M. Train plan model for British rail freight services through the channel tunnel. J Oper Res Soc 45 (1994) 384-391
8. Li L.Y.O., and Fu Z. The school bus routing problem: a case study. J Oper Res Soc 53 (2002) 552-558
9. Zachariadis EE, Kiranoudis CT. A strategy for reducing the computational complexity of local search-based methods, and its application to the vehicle routing problem, under review. Available at: 〈http://users.ntua.gr/ezach/〉.
10. Schrage L. Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11 2 (1981) 229-232
11. Sariklis D., and Powell S. A heuristic method for the open vehicle routing problem. J Oper Res Soc 51 5 (2000) 564-573
12. Tarantilis C.D., Ioannou G., Kiranoudis C.T., and Prastacos G.P. A threshold accepting approach to the open vehicle routing problem. RAIRO 38 (2004) 345-360
13. Tarantilis C.D., Kiranoudis C.T., Ioannou G., and Prastacos G.P. Solving the open vehicle routing problem via a single parameter metaheuristic algorithm. J Oper Res Soc 56 (2005) 588-596
14. Tarantilis C.D., Diakoulaki D., and Kiranoudis C.T. Combination of geographical information system and effective routing algorithms for real life distribution operations. Eur J Oper Res 152 (2004) 437-453
15. Li F., Golden B., and Wasil E. The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34 10 (2004) 2918-2930
16. Dueck G. New optimization heuristics: the great deluge algorithm and the record-to-record travel. J Comput Phys 104 (1993) 86-92
17. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Comput Oper Res 34 8 (2007) 2403-2435
18. Derigs U, Reuter K. A simple and efficient tabu search heuristic for solving the open vehicle routing problem. J Oper Res Soc, doi:10.1057/jors.2008.107.
19. Whittley I.M., and Smith G.D. The attribute based hill climber. J Math Model Algor 3 2 (2004) 167-178
20. Repoussis PP, Tarantilis CD, Bräysy O, Ioannou G. A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res, doi:10.1016/j.cor.2008.11.003.
21. Glover F. Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13 (1998) 533-549
22. Voudouris C., and Tsang E. Guided local search. Eur J Oper Res 113 (1998) 80-119
23. Fleszar K., Osman I.H., and Hindi K.S. A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res 195 (2009) 803-809
24. Hansen P., and Mladenović N. Variable neighborhood search: principles and applications. Eur J Oper Res 130 (2001) 449-467
25. Li X.-Y., Tian P., and Leung S.C.H. An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. J Oper Res Soc 60 7 (2009) 1012-1025
26. Letchford A.N., Lysgaard J., and Eglese R.W. A branch-and-cut algorithm for the capacitated open vehicle routing problem. J Oper Res Soc 58 (2007) 1642-1651
27. Fredman M., and Tarjan R. Fibonacci heaps and their uses in improved network optimization algorithms. J ACM 34 (1987) 596-615
28. Cordeau J.-F., Gendreau M., and Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30 (1997) 105-119
29. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12 (1964) 568-589
30. Toth P., and Vigo D. The granular tabu search (and its application to the vehicle routing problem). INFORMS J Comput 15 (2003) 333-348
31. Christofides N., Mingozzi A., and Toth P. The vehicle routing problem. In: Christofides N., Mingozzi A., Toth P., and Sandi C. (Eds). Combinatorial optimization (1979), Wiley, Chichester, UK 315-338
32. Fisher M. Optimal solution of vehicle routing problems using minimum k-trees. Oper Res 42 (1994) 626-642