An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem

Computers and Operations Research

Volumn 36, Issue 11, 2009, Pages 3041-3050

  Battarra, M ^a   Monaci, M ^b   Vigo, D ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Heuristics; Multiple trip; Time windows; Vehicle routing

Indexed keywords

ADAPTIVE GUIDANCES; COMPUTATIONAL EXPERIMENTS; COMPUTING TIME; HEURISTIC SOLUTIONS; HEURISTICS; ITERATIVE SOLUTIONS; MULTIPLE TRIP; OPTIMAL ROUTES; PROBLEM OBJECTIVES; REAL-WORLD; REAL-WORLD APPLICATIONS; REGIONAL SCALE; SET OF CUSTOMERS; TIME WINDOWS; VEHICLE ROUTING PROBLEMS;

COMBINATORIAL OPTIMIZATION; FLEET OPERATIONS; HEURISTIC METHODS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK ROUTING; ROUTING ALGORITHMS; VEHICLES; WINDOWS;

VEHICLE ROUTING;

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

References (26)

1. Alonso F., Alvarez M.J., and Beasley J.E. A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of the Operational Research Society 178 (2008) 963-976
2. Avella P., Boccia M., and Sforza A. Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operational Research 152 (2004) 170-179
3. Azi N., Gendreau M., and Potvin J.-Y. An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research 178 (2007) 755-766
4. Baldacci R., Toth P., and Vigo D. Recent advances in vehicle routing exact algorithms. 4OR 5 (2007) 269-298
5. Battiti R., Brunato M., and Mascia F. Reactive search and intelligent optimization. Operations research/computer science interfaces vol. 45 (2008), Springer, Berlin
6. Brandao J., and Mercer A. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. European Journal of Operational Research 100 (1997) 180-191
7. Brandao J., and Mercer A. The multi-trip vehicle routing problem. Journal of the Operational Research Society 49 (1998) 799-805
8. Bräysy O, Gendreau M, Hasle G, Lokketangen A. A survey of heuristics for the vehicle routing problem, part I: basic problems and supply side extensions. Technical Report, SINTEF, Oslo, Norway; 2003.
9. Bräysy O, Gendreau M, Hasle G, Lokketangen A. A survey of heuristics for the vehicle routing problem, part II: demand side extensions. Technical Report, SINTEF, Oslo, Norway; 2003.
10. Burke E., Kendall G., Newall J., Hart E., Ross P., and Schulenburg S. Hyper-heuristics: an emerging direction in modern search technology. In: Glover F., and Kochenberger G.A. (Eds). Handbook of metaheuristics. International series in operations research & management science vol. 57 (2003), Springer, New York 457-474
11. 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
12. Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D. Vehicle routing. In: Barnhart C, Laporte G, editors. Handbook in OR&MS, 2007. p. 367-428. [chapter 6].
13. Cornillier F., Laporte G., Boctor F.F., and Renaud J. The petrol station replenishment problem with time windows. Computers & Operations Research 36 (2009) 919-935
14. Fleischmann B. The vehicle routing problem with multiple use of vehicles (1990), Fachbereich Wirtschaftswissenschaften, Universität Hamburg
15. Golden B, Raghavan S, Wasil EA, editors. The vehicle routing problem: latest advances and new challenges. Berlin: Springer; 2008.
16. Jeon G., Leep H.R., and Shim J.Y. A vehicle routing problem solved by using a hybrid genetic algorithm. Computers & Industrial Engineering 53 (2007) 680-692
17. Koskosidis Y.A., and Powell W.B. Application of optimization based models on vehicle routing and scheduling problems with time windows constraints. Journal of Business Logistics 11 2 (1992) 101-128
18. Kramer O, editor. Self-adaptive heuristics for evolutionary computation. Berlin: Springer; 2008.
19. Martello S., and Toth P. Knapsack problems: algorithms and computer implementations (1990), Wiley, Chichester
20. Monaci M, Vigo D. A heuristic algorithm for trip aggregation in vehicle routing applications. In: Proceedings Odysseus 2003, freight transportation and logistics. Palermo, Italy, 2003.
21. Olivera A., and Viera O. Adaptive memory programming for the vehicle routing problem with multiple trips. Computers & Operations Research 34 (2007) 28-47
22. Petch R.J., and Salhi S. A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics 133 (2003) 69-92
23. Salhi S., and Petch R. A GA based heuristic for the vehicle routing problem with multiple trips. Journal of Mathematical Modelling and Algorithms 6 (2007) 591-613
24. Taillard E.D., Laporte G., and Gendreau M. Vehicle routing with multiple use of vehicles. Journal of the Operational Research Society 47 (1996) 1065-1070
25. Toth P, Vigo D, editors. The vehicle routing problem. Philadelphia: SIAM; 2002.
26. Vliet A., Boender C.G.E., and Rinnooy Kan A.H.G. Interactive optimization of bulk sugar deliveries. Interfaces 22 3 (1992) 4-14