Competitive decision algorithm for the split vehicle routing problem with simultaneous pickup and delivery and time windows

In this paper, we had a research about split vehicle routing problem with simultaneous pickup and delivery and time windows (SVRPSPDTW) and developed a interger progamming formulation of the problem. We presented a detail description for the competitive decision algorithm (CDA) to solve this problem. Then we constructed the benchmark of SVRPSPDTW problem based on Solomn´s benchmark. In the end, we did the computational experiments on delphi 7.0 IDE and got Table 1. From Table 1, we find CDA has good results in solving SVRPSPDTW problem compared with greedy algorithm and two stage algorithm.