摘要
针对当前算法在求解带时间窗车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTW)时存在精度、效率方面的不足,提出一种改进的离散花朵授粉算法.算法在基本花朵授粉算法的基础上进行离散化,使其适合求解带时间窗车辆路径问题,重新定义花朵授粉算子操作.为了提高求解精度和效率,设计了随机插入、路径内的2-opt、交换和逆序操作,为了增加种群间信息的交互,结合改进的遗传算子.通过11个测试算例表明,改进的离散花朵授粉算法在求解VRPTW是行之有效的,与文献中其他算法比较,算法在精度、效率和鲁棒性方面具有优势.
Aiming at the problems such as low efficiency,low accuracy of current algorithms in solving vehicle routing problem with time windows,an improved discrete flower pollination algorithm is proposed.The basic algorithm is discretized on the basis of the basic flower pollination algorithm,make it suitable for solving vehicle routing problem with time windows,redefining flower pollination operator operations.In order to improve the accuracy and efficiency of solution,random insertion,2-opt in path,switching and reverse operation are designed,in order to increase information interaction between populations,and combining improved genetic operators.The results of 11 test examples are indicated that the improved discrete flower pollination algorithm is effective in solving VRPTW.Comparisons with other algorithms in literature,this algorithm has advantages such as in accuracy,efficiency and robustness.
作者
魏小迪
郑洪清
WEI Xiao-di;ZHENG Hong-qing(College of Information Engineering,Guangxi University of Foreign Languages,Nanning 530222,China)
出处
《数学的实践与认识》
北大核心
2020年第2期193-200,共8页
Mathematics in Practice and Theory
基金
广西高校中青年教师基础能力提升项目(2018KY0732).
关键词
时间窗
车辆路径问题
花朵授粉算法
路径优化
time window
vehicle routing problem
flower pollination algorithm
route optimization
