运筹与管理2012，Vol.21Issue(2)：83-88,6.
带时间窗分车运输同时收发车辆路径问题及其启发式算法
Split Vehicle Routing Problem with Time Windows and Simultaneous Pickup and Delivery and Its Heuristic Algorithms
摘要
Abstract
In this paper, a kind of vehicle routing problem, split vehicle routing problem with time windows and simultaneous pickup and delivery (SVRPSPDTW) , is provided. Then the mathematic model of this problem and two heuristic algorithms are given. In the end, the computational experiments are done. As there are no instances for this type of problem to be tested, we construct the benchmark of the new problem based on Solomn benchmark. The results show the computation time of all the instances is no more than one second and the algorithm 1 is better than algorithm 2 both in terms of the total used vehicle numbers and the total length of routes, which shows that the algorithm 1 is a more effective algorithm to search for the initial feasible solution of SVRPSPDTW.关键词
运筹学/带时间窗分车运输同时收发车辆路径问题/启发式算法/Solomn算例Key words
operational research/ SVRPSPDTW/ heuristic algorithm/ solomn benchmark分类
数理科学引用本文复制引用
王科峰,叶春明,唐国春..带时间窗分车运输同时收发车辆路径问题及其启发式算法[J].运筹与管理,2012,21(2):83-88,6.基金项目
国家自然科学基金资助项目(20710015,70731160015) （20710015,70731160015）
上海市重点学科建设项目(S30504) （S30504）
高等学校博士点基金资助项目(20093120110008) （20093120110008）
上海市研究生创新基金资助项目(JWCXSL1001) （JWCXSL1001）
