Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

References

• Christofides N., Mingozzi A., Toth P., Christofides N., Mingozzi A., Toth P., Sandi C. The vehicle routing problem. Combinatorial Optimization (1979) (John Wiley & Sons, Chichester, UK) 315–338Google Scholar
• Clarke G., Wright J. Scheduling of vehicles from a central depot to a number of delivery point. Oper. Res. (1964) 12:568–581Link, Google Scholar
• Dongarra J. J. Performance of various computers using standard linear equations software. (2006) . Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TNGoogle Scholar
• Dullaert W., Janssens G. K., Sorensen K., Vernimmen B. New heuristics for the fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. (2002) 53:1232–1238Crossref, Google Scholar
• Fisher M. L., Jaikumar R. A generalized assignment heuristic for the vehicle routing problem. Networks (1981) 11:109–124Crossref, Google Scholar
• Golden B., Assad A., Levy L., Gheysens F. The fleet size and mix vehicle routing problem. Comput. Oper. Res. (1984) 11:49–66Crossref, Google Scholar
• Liu F. H., Shen S. Y. The fleet size and mix vehicle routing problem with time windows. J. Oper. Res. Soc. (1999) 50:721–732Crossref, Google Scholar
• Lodi A., Martello S., Vigo D. Heuristic and meta-heuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. (1999) 11:345–357Link, Google Scholar
• Pisinger D., Ropke S. A general heuristic for vehicle routing problems. Comput. Oper. Res. (2007) 34(8):2403–2435Crossref, Google Scholar
• Potvin J. Y., Rousseau J. M. A parallel route building algorithm for the vehicle routing scheduling problem with time windows. Eur. J. Oper. Res. (1993) 66:331–340Crossref, Google Scholar
• Renaud J., Boctor F. A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res. (2002) 140:618–628Crossref, Google Scholar
• Ropke S., Pisinger D. A unified heuristic for a large class of vehicle routing problems with backhauls. Eur. J. Oper. Res. (2007) 171:750–775Crossref, Google Scholar
• Savelsbergh M. W. P.Computer Aided Routing (1992) (CWI Tract 75, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands) Google Scholar
• Schrimpf G., Schneider J., Stamm-Wilmbrandt H., Dueck G. Record breaking optimization results using the ruin and recreate principle. J. Computational Phys. (2000) 159:139–171Crossref, Google Scholar
• Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Principles and Practice of Constraint Programming—CP98, Vol. 1520. Lecture Notes in Computer Science (1998) (Springer, New York) 417–431Crossref, Google Scholar
• Solomon M. M. Algorithms for the vehicle routing and scheduling problems with time windows constraints. Oper. Res. (1987) 35:254–265Link, Google Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2002) (Society for Industrial and Applied Mathematic Monographs on Discrete Mathematics and Applications, Philadelphia, PA) Crossref, Google Scholar