The vehicle routing problem with time windows part II: Genetic search

INFORMS Journal on Computing

Volumn 8, Issue 2, 1996, Pages 165-172

  Potvin, Jean Yves ^a   Bengio, Samy ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 20544477332     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.8.2.165     Document Type: Article

References (7)

1. J.E. BAKER, 1987. Reducing Bias and Inefficiency in the Selection Algorithm, in Proceedings of the Second International Conference on Genetic Algorithms, Cambridge, MA, pp. 14-21.
2. J.L. BLANTON and R.L. WAINWRIGHT, 1993. Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms, in Proceedings of the Fifth International Conference on Genetic Algorithms, Champaign, IL, pp. 452-459.
3. M. DESROCHERS, J. DESROSIERS, and M.M. SOLOMON, 1992. A New Optimization Algorithm for the Vehicle Routing Problem with Tune Windows, Operations Research 40, 342-354.
4. J. DESROSIERS, Y. DUMAS, M.M. SOLOMON, and F. SOUMIS, 1992. Time Constrained Routing and Scheduling, Technical Report G-92-42, Groupe d'études et de recherche en analyse des décisions, Université de Montréal, Montréal, Canada.
5. G. KONTORAVDIS and J. BARD, 1992. Improved Heuristics for the Vehicle Routing Problem with Time Windows, Working Paper, Operations Research Group, University of Texas at Austin, Austin, TX.
6. I. OR, 1976. Traveling Salesman-Type Combinatorial Problems and their relation to the Logistics of Blood Banking, Ph.D. Thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL.
7. J.Y. POTVIN, T. KERVAHUT, B.L. GARCIA and J.M. ROUSSEAU, 1996. The Vehicle Routing Problem with Time Windows - Part I: Tabu Search, INFORMS Journal on Computing (in this issue).