Improved genetic algorithm for vehicle routing problem with time windows

Proceedings - 2010 International Conference on Intelligent Computing and Cognitive Informatics, ICICCI 2010

Volumn , Issue , 2010, Pages 203-206

  Wang, Wenjun ^a  

^a NANCHANG INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Genetic algorithm; Time window; Vehicle routing problem

Indexed keywords

BENCH-MARK PROBLEMS; COMPLEX COMBINATORIAL PROBLEM; GENETIC OPERATORS; IMPROVED GENETIC ALGORITHMS; SIMULATION RESULT; TEST INSTANCES; TIME WINDOWS; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

GENETIC ALGORITHMS; INFORMATION SCIENCE; INTELLIGENT COMPUTING; MATHEMATICAL OPERATORS; ROUTING ALGORITHMS; VEHICLES;

VEHICLE ROUTING;

EID: 77958453265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICCI.2010.42     Document Type: Conference Paper

References (13)

1. G. Dangtzig, J. Ramser, "The truck dispatching problem," Management Science, vol. 6, pp. 80-91, 1959.
2. P. Toth, D. Vigo, "Exact solution of the vehicle routing problem," In: Crainic TG, Laporte G, editors. Fleet management and logistics. Dordrecht: Kluwer, 1998, pp. 1-31.
3. J. L. Blanton, R. L. Wainwright, "Multiple vehicle routing with time and capacity constraints using genetic algorithms," In Proceedings of the fifth international conference on genetic algorithms Los Altas, CA, 1993, pp. 452-459.
4. G. B. Alvarenga, G. R. Mateus, G. Tomi, "A genetic and set partitioning twophase approach for the vehicle routing problem with time windows". In Proceedings of Fourth Intenational Conference on Hybrid Intelligent Systems, Kitakyushu, Japan, 2004, pp. 410-415.
5. J. Berger, M. Barkaoui, O. Bräysy, "A route directed hybrid GA approach for the VRPTW," Information Systems and Operational Research, vol. 41, pp. 179-194, 2003.
6. M. M. Solomon, "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, vol. 35, no. 2, pp. 254-265, 1987.
7. J. H. Holland, Adaptive in natural and artificial systems. 1st MIT Press, 1992.
8. Y. Marinakis, A. Migdalas, P. M. Pardalos, "Multiple phase neighborhood search GRASP based on Lagrangean relaxation and random backtracking Lin Kernighan for the traveling salesman problem.," Journal of Combinatorial Optimization, vol. 17, No. 2, 2007.
9. É., Taillard, P. Badeau, M. Gendreau, F. Guertin and J.Y. Potvin, "A tabu search heuristic for the vehicle routing problem with soft time windows," Transportat. Science, vol. 31, pp. 170-186, 1997. (Pubitemid 127597092)
10. L. M. Rousseau, M. Gendreau and G. Pesant, "Using constraint-based operators with variable neighborhood search to solve the vehicle routing problem with time windows," In Proceedings of the 1st Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Feb. 1999.
11. K. C. Tan, L.H. Lee and K. Ou, "Hybrid genetic algorithms in solving vehicle routing problems with time window constraints," Asia-Pacific Journal of Operational Research, vol. 18, pp. 121-130, 2001. (Pubitemid 32618426)
12. H. Gehring, J. Homberger, "Parallelization of a two-phase metaheuristic for routing problems with time windows," Journal of Heuristics, vol. 8, pp. 251-276, 2002.
13. J. Berger, M. Barkaoui, "A parallel hybrid genetic algorithm for the vehicle routing problem with time windows," Computers & Operations Research, vol. 31, pp. 2037-2053, 2004.