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.%本文结合汽车零部件第三方物流的实际背景,提出了带时间窗的可分车运输同时收发车辆路径问题(简称SVRPSPDTW),并给出了问题的数学模型,同时提出两个求解该问题的启发式算法,最后进行了数值试验.由于没有可以利用的算例,本文在Solomn测试基准库的基础上构建了针对新问题的算例.计算结果表明,所有算例计算时间均不超过1秒,且算法1无论是从车辆的使用数还是从车辆行驶的路径总长度上都明显优于算法2,从而说明算法1是寻找SVRPSPDTW问题初始可行解的较为有效的算法.
展开▼
