|
|||||
|
|
| 单车场大规模车辆路径优化问题研究 | |
| 引用本文： | 李松,刘兴,李瑞彩.单车场大规模车辆路径优化问题研究[J].铁道运输与经济,2007,29(11):86-89. |
| 作者姓名： | 李松 刘兴 李瑞彩 |
| 作者单位： | 1. 河北大学,管理学院,河北,保定,071002 2. 军事交通学院,军事交通系,天津,300161 3. 河北软件职业技术学院,信息工程系,河北,保定,071000 |
| 摘 要： | 针对传统优化技术在解决大规模车辆路径问题中存在的缺陷,提出了一种解决单车场大规模车辆路径优化问题的综合启发式算法。首先,采用Sweep技术将区域分解成几个子区。其次,设计了分区的禁忌搜索算法,并采用相邻区域综合优化技术,提高了算法的全局搜索能力。仿真试验表明,该算法能够有效解决大规模车辆路径优化问题。 |
| 关 键 词： | 车辆路径 优化 分区协作 禁忌搜索算法 |
| 文章编号： | 1003-1421（2007）11-0086-04 |
| 修稿时间： | 2007-07-09 |
Study on Optimizing the Routing for Large Scale Vehicles in Single Depot |
|
| LI Song,LIU Xing,LI Rui-cai.Study on Optimizing the Routing for Large Scale Vehicles in Single Depot[J].Rail Way Transport and Economy,2007,29(11):86-89. | |
| Authors: | LI Song LIU Xing LI Rui-cai |
| Institution: | 1. School of Management, Hebei University, Baoding, Hebei 071002, China, 2. Department of Military Traffic, Military Traffic Institute, Tianjin 300161, China;3. Department of Information Enghieering, Hebei Software Institute, Baoding, Hebei 071000, China |
| Abstract: | Targeting with the limitation of traditional optimization technologies in the field of solving routing problem of large scale vehicles, a hybrid heuristics for solving large-scale vehicle routing problem in single depot is proposed. First, the whole area is split into several sub-areas by the Sweep technology. Second, the divisional tabu search algorithm is designed for the splitting of area, and the comprehensive optimization technology of adjacent area is applied in order to improve the global search capability of the algorithm. The simulation test shows the algorithm can efficiently solve the large-scale vehicle routing problem. |
| Keywords: | Vehicle Routing Optimization Splitting and Coordination Tabu Search Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |