A hybrid evolution strategy for the open vehicle routing problem

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 443-455

  Repoussis, P P ^a   Tarantilis, C D ^a   Braysy O ^b   Ioannou, G ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

Evolution strategies; Guided local search; Open vehicle routing; Tabu search

Indexed keywords

BENCHMARK DATA; CAPACITATED VEHICLES; COMBINATORIAL OPTIMIZATION PROBLEMS; EVOLUTION STRATEGIES; FLEET SIZES; FREQUENCY OF APPEARANCE; GUIDED LOCAL SEARCH; HYBRID EVOLUTION; LOCAL SEARCH ALGORITHM; META HEURISTIC ALGORITHM; MUTATION RATES; OPEN VEHICLE ROUTING; OPEN VEHICLE ROUTING PROBLEMS; RECOMBINATION OPERATORS; SELF ADAPTATION; SET OF CUSTOMERS; SOLUTION METHODS;

COMBINATORIAL OPTIMIZATION; COMPETITION; EVOLUTIONARY ALGORITHMS; FLEET OPERATIONS; HEURISTIC METHODS; LEARNING ALGORITHMS; MATHEMATICAL OPERATORS; NETWORK ROUTING; ONLINE SEARCHING; POPULATION STATISTICS; ROUTING ALGORITHMS; SET THEORY; TABU SEARCH; VEHICLES;

VEHICLE ROUTING;

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

References (37)

1. Sariklis D., and Powell S. A heuristic method for the open vehicle routing problem. J Oper Res Soc 51 (2000) 564-573
2. Repoussis P.P., Tarantilis C.D., and Ioannou G. The open vehicle routing problem with time windows. J Oper Res Soc 58 (2007) 355-367
3. Li F., Golden B., and Wasil E. The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34 (2007) 2918-2930
4. 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
5. 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
6. Russell R., Chiang W.-C., and Zepeda D. Integrating multi-product production and distribution in newspaper logistics. Eur J Oper Res 35 (2008) 1576-1588
7. Repoussis P.P., Paraskevopoulos D.C., Zobolas G., Tarantilis C.D., and Ioannou G. A web-based decision support system for waste lube oils collection and recycling. Eur J Oper Res 195 3 (2009) 676-700
8. Homberger J., and Gehring H. Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37 (1999) 297-318
9. Glover F. Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13 (1986) 533-549
10. Voudouris C., and Tsang E. Guided local search. Eur J Oper Res 113 (1998) 80-119
11. 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
12. 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
13. Brandão J. A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157 6 (2004) 552-564
14. Kindervater G.A.P., and Savelsbergh M.W.P. Vehicle routing: handling edge exchanges. In: Aarts E., and Lenstra J.K. (Eds). Local search in combinatorial optimization (1998), Wiley, UK 337-360
15. Pisinger D., and Ropke S. A general heuristic for vehicle routing problems. Comput Oper Res 34 (2006) 2403-2435
16. Kirkpatrick S., Gelatt C.D., and Vecchi P.M. Optimization by simulated annealing. Science 220 (1983) 671-680
17. 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
18. 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
19. 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
20. Dueck G., and Scheurer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90 (1990) 161-175
21. Taillard E.D., Gambardella L.M., Gendreau M., and Potvin J.-Y. Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135 (2001) 1-16
22. Li X., and Tian P. An ant colony system for the open vehicle routing problem. In: Dorigo M., et al. (Ed). Lecture Notes in Computer Science (ANTS 2006) vol. 4150 (2006), Springer, Berlin 356-363
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 3 (2007) 803-809
24. 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
25. Tarantilis C.D., and Kiranoudis C.T. BoneRoute: an adaptive memory-based method for effective fleet management. Ann Oper Res 115 (2002) 227-241
26. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Comput Oper Res 32 (2005) 2309-2327
27. Liu F.-H., and Shen S.-Y. A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. Eur J Oper Res 118 (1999) 485-504
28. Feo T., and Resende M.G.C. Greedy randomized adaptive search procedures. J Global Optim 6 (1995) 109-154
29. Ho S.C., and Gendreau M. Path relinking for the vehicle routing problem. J Heuristics 12 (2006) 55-72
30. Gendreau M., and Potvin J.Y. Metaheuristics in combinatorial optimization. Ann Oper Res 140 (2005) 189-213
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 31538
32. Fisher M. Optimal solution of vehicle routing problems using minimum k-trees. Oper Res 42 (1994) 626-642
33. Repoussis P.P., Paraskevopoulos D.C., Tarantilis C.D., and Ioannou G. A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. In: Almeida F., et al. (Ed). Workshop on hybrid metaheuristics 2006. Lecture notes in computer science vol. 4030 (2006), Springer, Berlin 124-138
34. Dongarra JJ. Performance of various computers using standard linear equations software. Technical Report UT-CS-04-526, UT-CS-89-95, Computer Science Department, University of Tennessee, Knoxville, 2006.
35. Bäck T., Hammel U., and Schwefel H.-P. Evolutionary computation: comments on the history and current state. IEEE Trans Evol Comput 1 1 (1997) 3-17
36. Mladenović N., and Hansen P. Variable neighborhood search. Comput Oper Res 24 (1997) 1097-1100
37. Paraskevopoulos D.C., Repoussis P.P., Tarantilis C.D., Ioannou G., and Prastacos G.P. A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. J Heuristics 14 5 (2008) 425-455