An Improving Genetic Algorithm for Vehicle Routing Problem with Time Windows
In this paper, the vehicle routing problem with time windows (VRPTW) was considered, and a mixed integer programming mathematic model of VRPTW was proposed in detail. Meantime, an improved genetic algorithm (IGA) was proposed to overcome the shortcomings of premature convergence and slow convergence of conventional genetic algorithm (GA). The novel crossover-operator、 swapping operator and inversion operator as the core of IGA were constructed to solve VRPTW. The experiment results showed that the IGA can solve VRPTW effectively.
vehicle routing problem improved genetic algorithm (IGA) integer programming logistics optimization
Tang Chunhua
Business College of Hunan International Economics University, Changsha 410205, China
国际会议
长沙
英文
603-606
2010-05-11(万方平台首次上网日期,不代表论文的发表时间)