Solving Capacitated Vehicle Routing Problem Based on Improved Genetic Algorithm
Aiming at the capacitated vehicle routing problem (CVRP) in the matter stream delivery field, an improved genetic algorithm (GA) based on local mutation operator is adopted. Two layers chromosome coding scheme is designed which can improve initial solutions. This coding method can insure that the sub-routing is effective to satiety the vehicle capacitated constraints. These improved measures have important significance to depress procedural intricacy degree, advance convergence of algorithm velocity and algorithmic local search ability. The simulation experiment results show the improved genetic algorithm compared with BGA can achieve better optimization results and has better efficiency to solve CVRP.
Capability Vehicle Routing Problem Genetic Algorithm Two Layers Chromosome Local Mutation
Wang Jie-sheng Liu Chang Zhang Ying
School of Electronic and Information Engineering, Liaoning University of Science & Technology, Ansha School of Electronic and Information Engineering, Liaoning University of Science & Technology, Ansha
国际会议
2011 China Control and Decision Conference(2011中国控制与决策会议 CCDC)
四川绵阳
英文
60-64
2011-05-23（万方平台首次上网日期，不代表论文的发表时间）