Improved Genetic Algorithm For Capacitated Vehicle Routing Problem
Capacitated vehicle routing problem (CVRP) is an NPhard problem. When the traditional optimization method is used to resolve it, a time-dimensional disaster problem will emerge along with broadening of the scale of the problem. An improved genetic algorithm is developed in this work to solve the problem. In the improved genetic algorithm, a new chromosome representation and initial population creation makes shortened chromosomes to improve calculation efficiency; multiple 2-opt mutation operator is to get better solutions within fewer generations. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem.
capacitated routing problem genetic algorithm
DAI Shouyu DONG Shunli WANG Zhimin YU Dianxiang
Department of Automobile Command, Academy of Military Transportation, Tianjin, P. R. China,300161 Department of Automobile Command, Academy of Military Transportation, Tianjin, P. R. China, 300161
国际会议
2010 International Conference on Management(2010管理国际大会)
上海
英文
89-94
2010-07-24（万方平台首次上网日期，不代表论文的发表时间）