改进遗传算法下的车辆路径问题研究  

Research on Vehicle Routing Problem Based on Improved Genetic Algorithm

作　　者：陈果[1] 

机构地区：[1]天津大学管理与经济学部,300072

出　　处：《电子测试》2016年第2期56-57,33,共3页Electronic Test

摘　　要：车辆路径问题是一种典型的组合优化类问题,随着客户对物流要求的不断提升,基本的遗传算法已经很难满足客户的需求。基本的遗传算法在求解这类问题的时候,经常会出现早熟收敛,以及对车辆的运送时间存在限制等方面的缺陷,不能够对这类问题进行最优化求解,所以本文采用改进的遗传算法就车辆路径问题进行研究,并探究改进下的遗传算法在求解车辆路径问题时的有效性。The vehicle routing problem is a typical combinatorial optimization problem.With the continuous improvement of logistics requirements, the basic genetic algorithm has been difficult to meet the needs of customers.The basic genetic algorithm in solving this kind of problem,often appear premature convergence, and delivery time of the vehicle has the defects of limited,can not to solve the optimization of this kind of problem,so this paper uses improved genetic algorithm on vehicle routing problem were studied,and explore the improved genetic algorithm in solving the vehicle routing problem is effective.

关 键 词：遗传算法 车辆 路径问题 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]