摘要
针对传统优化技术在解决大规模车辆路径问题中存在的缺陷,提出了一种解决单车场大规模车辆路径优化问题的综合启发式算法。首先,采用Sweep技术将区域分解成几个子区。其次,设计了分区的禁忌搜索算法,并采用相邻区域综合优化技术,提高了算法的全局搜索能力。仿真试验表明,该算法能够有效解决大规模车辆路径优化问题。
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.
出处
《铁道运输与经济》
北大核心
2007年第11期86-89,共4页
Railway Transport and Economy
关键词
车辆路径
优化
分区协作
禁忌搜索算法
Vehicle Routing
Optimization
Splitting and Coordination
Tabu Search Algorithm
