Article

Article title ABOUT ONE GENETIC ALGORITHM FOR SOLVING VEHICLE ROUTING PROBLEM WITH TIME WINDOW
Authors T.S. Emelyanova
Section SECTION I. EVOLUTIONARY MODELING, GENETIC AND BIONIC ALGORITHMS
Month, Year 04, 2008 @en
Index UDC 004.023
DOI
Abstract In given article the new genetic algorithm for solving of vehicle routing problem with time window is represented. This article contains the problem definition, the basic genetic operators, and the genetic algorithm for problem solving. Efficiency of algorithm is estimated by solving Solomon test problems. The results of tests prove the efficiency of algorithm.

Download PDF

Keywords vehicle routing problem with time window, heuristic methods, genetic algorithms; solution coding, crossover, mutation, optimization methods, Solomon problems.
References 1. Tobias Babb. Pickup and Delivery Problem with Time Windows, Coordinated Transportation Systems: The State of the Art. Department of Computer Science University of Central Florida Orlando, Florida, 2005.
2. J.-F. Cordeau, Guy Desaulniers, Jacques Gesrosiers, Marius M. Solomon, Francois Soumis. The VRP with Time Windows. Chapter 7, Paolo Toth and Daniel Vigo (eds), SIAM, Monographs on Discrete Mathematics and Applications, 2001.
3. Емельянова T.C. Применение генетических алгоритмов для решения транспортной задачи линейного программирования // Перспективные информационные технологии и интеллектуальные системы. – Таганрог, №3(27), 2006. – С. 15-29.
4. Емельянова T.C. Об одном генетическом алгоритме решения транспортной задачи. // Известия ТРТУ. – 2007. – №1(73), – С. 65-70.
5. Генетические алгоритмы: Учебное пособие. Под ред. В. М. Курейчика. – Ростов-на-Дону: OOO «Ростиздат», 2004.
6. K.C. Tan, L. H. Lee, K. Q. Zhu. Heuristic Methods for Vehicle Routing Problem with Time Windows. Proceedings of the 6th Internayional Symposium on Artifical Intelligence & Mathematics, Ft. Lauderdale, Florida, 2000.
7. Olli Brдysy, Michel Gendreau. Route Construction and Local Search Algorithms for the Vehicle Routing Problem with Time Windows. Internal Report STF42 A01024, SINTEF Applied Mathematics, 2001.
8. EricTaillard, Philippe Badeau, Michel Gendreau, Francois Guertin and Jean-Yves Potvin. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science 31, pp. 170 – 186, 1997.
9. EricTaillard, Philippe Badeau, Michel Gendreau, Francois Guertin and Jean-Yves Potvin. A
Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Trans-
portation Research – C 5, pp. 109 – 122, 1997.
10. http://web.cba.neu.edu/~msolomon/problems.htm.
11. http://web.cba.neu.edu/~msolomon/heuristi.htm.

Comments are closed.