基于并行遗传算法的车辆路径问题  

Solution to Vehicle Routing Problem Based on Parellel Genetic Algorithm

作　　者：姚锦宝[1] 夏禾[1] 姚宝珍[1] 

机构地区：[1]北京交通大学土木建筑工程学院,北京100044

出　　处：《物流技术》2010年第5期64-66,共3页Logistics Technology

基　　金：国家自然科学基金重点项目(50538010)

摘　　要：提出两种改进策略来提高遗传算法的性能,首先通过粗粒度并行机制以避免遗传算法在进化过程中易产生过早收敛现象,同时提出了一个主从式迁移策略来提高"优质"个体在交换过程的生存能力,有效的提高优化的速度和解的精度。最后,通过若干著名的车辆路径问题对该算法进行了验证,结果表明提出的并行遗传算法可以有效的提高优化速度和求解质量。The paper proposes two improvement strategies for the genetic algorithm （GA） in logistics research. The first strategy is the coarse-grain parallel mechanism which can enhance the solution quality by exchanging high-quality genus among sub-colonies, thus avoiding premature convergence in the iteration process and the second one a primary-subordinate migration strategy which potently improves the speed of optimization and the accuracy of solution. Finally, through typical vehicle routing problems, the algorithm proposed in the paper is validated as effective in improving the speed and quality of GA.

关 键 词：遗传算法 粗粒度并行机制 主从式迁移策略 

分 类 号：F224.0[经济管理—国民经济]