| 求解多车型车辆路径问题的变邻域搜索算法 |
| |
| 引用本文： | 陈萍,黄厚宽,董兴业.求解多车型车辆路径问题的变邻域搜索算法[J].系统仿真学报,2011,23(9):1945-1950. |
| |
| 作者姓名： | 陈萍 黄厚宽 董兴业 |
| |
| 作者单位： | 北京交通大学计算机与信息技术学院,北京,100044 |
| |
| 基金项目： | 中央高校基本科研业务费专项资金资助(NKZXB10104) |
| |
| 摘 要： | 多车型车辆路径问题（FSMVRP）是车辆类型不同的车辆路径问题（VRP）,基于变邻域搜索,提出一种启发式算法VNS_FSM求解FSMVRP。该算法设计了实现变邻域搜索中的＂抖动＂和局部优化过程的邻域结构组合,同时,还提出了一种新的车型调整策略。在通用的基准测试问题的实验验证了VNS_FSM算法的有效性,并给出问题G_07-G_12的正确解。实验结果表明,VNS_FSM算法能够获得大多数测试问题的已知最好解。与已有算法相比,VNS_FSM算法性能相当或更优。
|
| 关 键 词： | 多车型车辆路径问题 启发式算法 变邻域搜索 抖动 |
Variable Neighborhood Search Algorithm for Fleet Size and Mixed Vehicle Routing Problem |
| |
| CHEN Ping,HUANG Hou-kuan,DONG Xing-ye.Variable Neighborhood Search Algorithm for Fleet Size and Mixed Vehicle Routing Problem[J].Journal of System Simulation,2011,23(9):1945-1950. |
| |
| Authors: | CHEN Ping HUANG Hou-kuan DONG Xing-ye |
| |
| Institution: | CHEN Ping1,2,HUANG Hou-kuan3,DONG Xing-ye3(1.Department of Logistics Management,TEDA College,Nankai University,Tianjin 300457,China.2.Modern Logistics Research Center,Tianjin 300071,China,3.School of Computer and Information Technology,Beijing Jiaotong University,Beijing 100044,China) |
| |
| Abstract: | The fleet size and mixed vehicle routing problem(FSMVRP) is a variant of the Vehicle Routing Problem(VRP),in which the vehicles are heterogeneous.Based on the variable neighborhood search,a heuristic algorithm VNS_FSM was proposed for solving the FSMVRP.In the VNS_FSM,the neighborhood structure combinations were designed to implement the shaking and local search procedure in the VNS.Additionally,a new vehicle type adjustment method was presented.Computational experiments were carried out on benchmark proble... |
| |
| Keywords: | fleet size and mixed vehicle routing problem heuristic variable neighborhood search shaking |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
