Study on the Improvement of Genetic Algorithm by Using Vehicle Routing Problem

Abstract:

mprove the existing genetic algorithm, make the vehicle path planning problem solving can be higher quality and faster solution. The mathematic model for study of VRP with genetic algorithms was established. An improved genetic algorithm was proposed, which consist of a new method of initial population and partheno genetic algorithm revolution operation.Exploited Computer Aided Platform and Validated VRP by simulation software. Compared this improved genetic algorithm with the existing genetic algorithm and approximation algorithms through an example, convergence rate Much faster and the Optimal results from 117.0km Reduced to 107.8km,proved that this article improved genetic algorithm can be faster to reach an optimal solution. The results showed that the improved GA can keep the variety of cross and accelerate the search speed.

• Periodical: Applied Mechanics and Materials (Volumes 365-366)
• Pages: 194-198
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.365-366.194
• Online since: August 2013
• Authors: Mei Ni Guo
• Keywords: Genetic Algorithm (GA), Initial Population, Parthenon Genetic Algorithm, VRP

References

[1] Tang Kun vehicle routing problem genetic algorithm design [J]. Donghua University (Natural Science), 2002, 28 (1) : 66-70.

[2] Li Jun, Xie Binglei, Yao-Huang Guo non-fully loaded vehicle scheduling problem genetic algorithm [J]. Theoretical Methods of Systems Engineering, 2000, 9 (3) : 235-239.

[3] Lang Maoxiang hybrid genetic algorithm for solving the logistics path optimization problem research [J] Chinese Journal of Management Science, 2002, 10 (5) : 51-56.

[4] Lang Maoxiang hybrid genetic algorithm for solving the logistics path optimization problem research [J] Chinese Journal of Management Science, 2002, 10 (5) : 51-56.