• 论文 •    

带模糊预约时间的车辆路径问题的多目标禁忌搜索算法

王君,李波   

  1. 天津大学 管理与经济学部,天津300072
  • 出版日期:2011-04-15 发布日期:2011-04-25

Multi-objective tabu search algorithm for vehicle routing problem with fuzzy due-time

WANG Jun, LI Bo   

  1. College of Management and Economics, Tianjin University, Tianjin 300072, China
  • Online:2011-04-15 Published:2011-04-25

摘要: 为优化具有模糊预约时间的车辆路径问题,应用模糊事件给出了车队服务满意度的一个新的度量方法和求最大满意度的计算方法。建立了多目标数学规划模型,并提出多目标禁忌搜索算法求解Pareto最优解。采用随机车辆配载方法生成初始解放入候选解池中,提出插入可行邻域和2-Opt可行邻域进行邻域搜索。对池中的Pareto解进行并行的禁忌搜索得到局部Pareto解再注入池中,最后求得一组Pareto解。通过Solomon的benchmark算例,与非支配排序遗传算法Ⅱ进行对比实验,说明了所提算法的优越性。

关键词: 模糊预约时间, 车辆路径问题, 多目标禁忌搜索, Pareto最优解, 可行邻域结构

Abstract: To optimize vehicle routing problem with fuzzy due-time, a new method to measure and calculate the maximum satisfaction was proposed by using fuzzy event. A multi-objective mathematical programming model was designed, and a multi-objective tabu search algorithm to solve Pareto optimal solutions was proposed. Initial solutions were generated by random vehicle loading method, which were put into candidate solution pool. And the neighborhood search was carried out based on insertion and 2-Opt feasible neighborhoods. Each Pareto solution in the pool was optimized by parallel tabu search. Compared to the Nondominated Sorting Genetic Algorithm II (NSGA-Ⅱ), the effectiveness of the proposed method was verified by computational experiments on Solomon benchmarks.

Key words: fuzzy due-time, vehicle routing problem, multi-objective tabu search, Pareto optimal solution, feasible neighborhood

中图分类号: