计算机技术与发展2018，Vol.28Issue(2)：54-58,5.DOI:10.3969/j.issn.1673-629X.2018.02.013
基于遗传算法的多目标路径优化算法的研究
Research on Multi-target Path Optimization Algorithm Based on Genetic Algorithm
摘要
Abstract
There are many constraints in the development of the logistics industry,such as vehicle routing problem(VRP),the goal of which is to serve a range of service points at a minimum cost.For this,we propose a path optimization algorithm based on genetic algorithm for the VRP with orderly service point and time constraints.First of all,we establish the corresponding model according to the problem,and apply the genetic algorithm for problem solving.Then,the genetic algorithm is improved by adding operator adjustment and other operations,in-creasing its application range,accelerating its convergence speed and rising its efficiency.Finally,the algorithm is applied to real life and compared with traditional genetic algorithm,which shows that it can effectively solve the VRP with service point order and time constraints, with faster convergence speed and higher efficiency.关键词
物流/车辆路由问题/时间约束/遗传算法/收敛Key words
logistics/vehicle routing problem/time constraints/genetic algorithm/convergence分类
信息技术与安全科学引用本文复制引用
金仙力,李金刚..基于遗传算法的多目标路径优化算法的研究[J].计算机技术与发展,2018,28(2):54-58,5.基金项目
国家自然科学基金(61373139) （61373139）
