Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming

Transportation Research Part C: Emerging Technologies

Volumn 18, Issue 5, 2010, Pages 695-712

  Repoussis, P P ^a   Tarantilis, C D ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Adaptive memory; Distribution logistics; Fleet management; Tabu Search; Vehicle routing; Vehicle scheduling

Indexed keywords

HEURISTIC METHODS; SCHEDULING; TABU SEARCH; VEHICLE ROUTING; VEHICLES;

ADAPTIVE MEMORY; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL REQUIREMENTS; DISTRIBUTION LOGISTICS; FLEET MANAGEMENT; TABU SEARCH ALGORITHMS; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS; VEHICLE SCHEDULING;

FLEET OPERATIONS;

ALGORITHM; BENCHMARKING; COMPUTER SIMULATION; HEURISTICS; LINEAR PROGRAMING; LOGISTICS; NUMERICAL MODEL; OPTIMIZATION; PLANNING METHOD; PROBABILITY; TRANSPORTATION PLANNING;

EID: 77953359101     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2009.08.004     Document Type: Article

References (35)

1. Badeau F., Guertin F., Gendreau M., Potvin J.Y., Taillard E. A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies 1997, 5(2):109-122.
2. Baldacci R., Battara M., Vigo D. Routing a heterogeneous fleet of vehicles. The Vehicle Routing Problem: Latest Advances and New Challenges, Operation Research/Computer Science Interfaces 2008, 3-28. Springer, New York. B. Golden, S. Raghavan, E. Wasil (Eds.).
3. Bräysy O., Dullaert W., Hasle G., Mester D., Gendreau M. An effective multi-restart deterministic annealing metaheuristic for the fleet size and mix vehicle routing problem with time windows. Transportation Science 2008, 42(3):371-386.
4. Bräysy O., Porkka P., Dullaert W., Repoussis P.P., Tarantilis C.D. A well-scalable metaheuristic for the fleet size and mix vehicle routing. Expert Systems with Applications 2009, 36:8460-8475.
5. Calvete H.I., Galé C., Oliveros M.-J., Sánchez-Valverde B. A goal programming approach to vehicle routing problems with soft time windows. European Journal of Operations Research 2007, 177(3):1720-1730.
6. Dell-Amico M., Monaci M., Pagani C., Vigo D. Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transportation Science 2007, 41(4):516-526.
7. Dondo R., Cerdá J. A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operations Research 2007, 176(3):1478-1507.
8. Dongarra, J.J., 2006. 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.
9. Dueck G., Scheurer T. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. Journal of Computational Physics 1990, 90:161-175.
10. Dullaert W., Janssens G.K., Sörensen K., Vernimmen B. New heuristics for the fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society 2002, 53:1232-1238.
11. Gendreau M., Guertin F., Potvin J-Y., Séguin R. Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies 2006, 14(3):157-174.
12. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 1986, 13:533-549.
13. Glover F. Tabu search and adaptive memory programming - advances, applications and challenges. Interfaces in Computer Science and Operation Research: Advances in Metaheuristics 1997, 1-75. Kluwer, Boston. R.S. Barr, R.V. Helgason, J.L. Kennington (Eds.).
14. Golden B., Assad A., Levy L., Gheysens F. The fleet size and mix vehicle routing problem. Computers and Operations Research 1984, 11:49-66.
15. The Vehicle Routing Problem: Latest Advances and New Challenges. Operation Research/Computer Science Interfaces 2008, Springer, New York. B. Golden, S. Raghavan, E. Wasil (Eds.).
16. Kindervater G.A.P., Savelsbergh M.W.P. Vehicle routing: handling edge exchanges. Local Search in Combinatorial Optimization 1998, 337-360. Wiley Publications, UK. E. Aarts, J.K. Lenstra (Eds.).
17. Liu F.H., Shen S.Y. The fleet size and mix routing problem with time windows. Journal of the Operational Research Society 1999, 50(7):721-732.
18. Lourenço H.R., Martin O., Stützle T. Iterated local search. International Series in Operations Research and Management Science 2002, 321-353. Kluwer Academic Publishers., Norwell. F. Glover, G. Kochenberger (Eds.).
19. Mladenović N., Hansen P. Variable neighborhood search. Computers and Operations Research 1997, 24:1097-1100.
20. Paraskevopoulos D.C., Repoussis P.P., Tarantilis C.D., Ioannou G., Prastacos G.P. A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows. Journal of Heuristics 2007, 14(5):247-254.
21. Privé J., Renaud J., Boctor F.F., Laporte G. Solving a vehicle routing problem arising in soft drink distribution. Journal of the Operational Research Society 2006, 57:1046-1052.
22. Repoussis P.P., Paraskevopoulos D.C., Tarantilis C.D., Ioannou G. A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. Lecture Notes in Computer Science 4030 2006, 124-138. Springel. F. Almeida (Ed.).
23. Repoussis P.P., Paraskevopoulos D.C., Zobolas G., Tarantilis C.D., Ioannou G. A web-based decision support system for waste lube oils collection and recycling. European Journal of Operational Research 2009, 195(3):676-700.
24. Repoussis P.P., Tarantilis C.D., Ioannou G. Arc-Guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE Transactions on Evolutionary Computation 2009, 13(3):624-647.
25. Salhi S., Sari M., Touati N. Adaptation of some vehicle fleet mix heuristics. OMEGA 1992, 20:653-660.
26. Semet F. A Two-phase algorithm for the partial accessibility constrained vehicle routing. Annals of Operations Research 1995, 61:45-65.
27. Solomon M.M. Algorithms for the vehicle routing and scheduling with time windows constraints. Operations Research 1987, 35:254-265.
28. Taillard E.D., Gambardella L.M., Gendreau M., Potvin J.-Y. Adaptive memory programming: a unified view of metaheuristics. European Journal of Operations Research 2001, 135:1-16.
29. Taillard E.D. A heuristic column generation method for the heterogeneous fleet VRP. RAIRO 1999, 33:1-14.
30. Tarantilis C.D., Kiranoudis C.T. Boneroute: an adaptive memory-based method for effective fleet management. Annals of Operations Research 2002, 115:227-241.
31. Tarantilis C.D., Kiranoudis C.T., Vassiliadis V.S. A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Journal of the Operational Research Society 2003, 54:65-71.
32. Tarantilis C.D., Kiranoudis C.T., Vassiliadis V.S. A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. European Journal of Operational Research 2004, 152:148-158.
33. Tarantilis C.D. Solving the vehicle routing problem with adaptive memory programming methodology. Computers and Operations Research 2005, 32:2309-2327.
34. Toth, P., Vigo, D. (Eds.), 2002. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
35. Voudouris C., Tsang E. Guided local search. European Journal of Operational Research 1999, 113(2):469-499.