计算机工程与应用Issue(24)：58-64,7.DOI:10.3778/j.issn.1002-8331.1303-0092
模糊时间窗VRP的动态规划和禁忌搜索混合算法
Dynamic programming and tabu search hybrid algorithm for Vehicle Routing Problem with fuzzy time windows
摘要
Abstract
The Vehicle Routing Problem with Fuzzy Time Windows is addressed. A multi-objective mathematical model is designed with the objectives of logistics cost and average customer satisfaction. Based on Pareto dominance theory, a multi-objective tabu search algorithm is proposed to solve multi-objective optimization problems. Moreover, a dynamic program-ming method is embedded in the algorithm to optimize the customer satisfaction, which simplifies the original problem into tight path optimization sub-problems with the use of phasing. While fuzzy time windows are in piecewise linear and nonlinear convex membership function forms, customer beginning service time is optimized by proposed limited iteration subgradient algorithm and median iteration subgradient algorithm, respectively. Computational experiments on Solomon’s benchmark not only verify that the dynamic programming is more effective than projected subgradient methods to optimize the service level, but also show the advantages of the proposed multi-objective tabu search approach when compared with the well-known NSGA-II method.关键词
车辆路径问题/模糊时间窗/动态规划/多目标禁忌搜索/Pareto最优Key words
vehicle routing problem/fuzzy time windows/dynamic programming/multi-objective tabu search/Pareto optimization分类
信息技术与安全科学引用本文复制引用
王君..模糊时间窗VRP的动态规划和禁忌搜索混合算法[J].计算机工程与应用,2014,(24):58-64,7.基金项目
国家社科基金资助项目（No.11CGL102）；教育部人文社科青年项目（No.13YJC630195）；天津市科技发展战略研究计划项目（No.13ZLZLZF04600）；天津财经大学科研发展基金资助项目（No.Q1208）。 （）
