分布式并行遗传算法求解多车型车辆路径问题  

Distributed Parallel Genetic Algorithm for Solving Heterogeneous Vehicle Routing Problems

作　　者：王超[1] 袁杰红[1] WANG Chao;YUAN Jiehong(College of Aerospace Science and Engineering,National University of Defense Technology,Changsha 410073,China)

机构地区：[1]国防科技大学空天科学学院

出　　处：《物流科技》2019年第10期18-20,共3页Logistics Sci-Tech

摘　　要：传统遗传算法在求解HVRP问题时寻优效率不高,在搜索过程中易陷入局部最优,发生早熟。为解决上述问题,文章在传统遗传算法的基础上,采用多个子算法并行分布、同时迭代的方式调整算法结构,并引入迁移算子实现迭代过程中各子算法间的信息共享,以提升寻优效率。The traditional genetic algorithm is not efficient in solving heterogeneous vehicle routing problems,and it is easy to fall into local optimum and prematurely in the search process.In order to solve the above problems,based on the traditional genetic algorithm,multiple sub-algorithms are used to adjust the algorithm structure in parallel and iteratively,and the migration operator is introduced to realize the information sharing among the sub-algorithms in the iterative process to improve the optimization.effectiveness.

关 键 词：车辆路径问题 多车型车辆路径 迁移算子 并行遗传 

分 类 号：U116.2[交通运输工程]