首页 | 官方网站   微博 | 高级检索  
     

带时间窗车辆路径问题的差分进化混合算法
引用本文:王君.带时间窗车辆路径问题的差分进化混合算法[J].计算机工程与应用,2013,49(2):24-28,66.
作者姓名:王君
作者单位:天津财经大学商学院,天津,300222
基金项目:国家社科基金资助项目,天津财经大学科研发展基金资助项目
摘    要:研究了带时间窗的车辆路径问题(Vehicle Routing Problem with Time Windows,VRPTW),建立了数学模型,并设计了求解VRPTW的离散差分进化混合算法。算法采用随机车辆配载方法构造初始解,并通过构造新的变异和交叉算子进行改进。进一步,利用插入可行邻域和2-Opt可行邻域两种搜索可行解的邻域结构,引入禁忌搜索进一步进行局部搜索以提高算法的寻优能力。实验结果表明该算法是求解VRPTW的一种有效方法。

关 键 词:车辆路径问题  时间窗  差分进化算法  禁忌搜索

Differential evolution hybrid algorithm for vehicle routing problem with time windows
WANG Jun.Differential evolution hybrid algorithm for vehicle routing problem with time windows[J].Computer Engineering and Applications,2013,49(2):24-28,66.
Authors:WANG Jun
Affiliation:WANG Jun School of Business,Tianjin University of Finance & Economics,Tianjin 300222,China
Abstract:The Vehicle Routing Problem with Time Windows(VRPTW)is addressed in this paper.A mathematical model is built and a discrete differential evolution hybrid algorithm for VRPTW is designed.In the algorithm,the population is initialized by a random vehicle loading method,and improved by new discrete mutation and crossover operators.Moreover,the tabu search is introduced to enhance the local searching capability of the algorithm,in which insertion and 2-Opt feasible neighborhoods are used to search feasible solutions.Experimental results show the effectiveness of the proposed approach for the VRPTW.
Keywords:Vehicle Routing Problem(VRP)  time window  differential evolution algorithm  tabu search
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号