论文信息 - Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

Solving Vehicle Routing Problem with Time Windows by Genetic Algorithm

Based on the analysis to the vehicle routing problem with time windows (VRPTW), this paper builds up a mathematical model of VRPTW and proposes a genetic algorithm. By constructing chromosomes reasonably and using a feasible procedure and other genetic operators to make the search for the optimal solution proceed within the feasible space, this genetic algorithm has a good performance proved by the provided experience.

Feng Wang | Mingshan Zhang | Dali Jiang

[1] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .

[2] Jean-Yves Potvin,et al. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows , 1993 .

[3] K. Dejong,et al. An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[4] Robert A. Russell,et al. Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[5] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6] Warren B. Powell,et al. An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[7] Paul M. Thompson,et al. Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems , 1993, Oper. Res..