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.

[1]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[2]  Mingyong Lai,et al.  An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows , 2010, Eng. Appl. Artif. Intell..

[3]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[4]  Dag Haugland,et al.  A tabu search heuristic for the vehicle routing problem with time windows and split deliveries , 2004, Comput. Oper. Res..

[5]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[6]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[7]  Subrata Mitra,et al.  A parallel clustering technique for the vehicle routing problem with split deliveries and pickups , 2008, J. Oper. Res. Soc..

[8]  Lai Ming-yong,et al.  An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows , 2010, Eng. Appl. Artif. Intell..

[9]  Xiangtong Qi,et al.  A practical split vehicle routing problem with simultaneous pickup and delivery , 2009, 2009 16th International Conference on Industrial Engineering and Engineering Management.

[10]  L. V. Wassenhove,et al.  Quantitative approaches to distribution logistics and supply chain management , 2002 .

[11]  Mei-Shiang Chang,et al.  REAL-TIME VEHICLE ROUTING PROBLEM WITH TIME WINDOWS AND SIMULTANEOUS DELIVERY/PICKUP DEMANDS , 2003 .

[12]  Enrico Angelelli,et al.  The Vehicle Routing Problem with Time Windows and Simultaneous Pick-up and Delivery , 2002 .

[13]  Jacques Desrosiers,et al.  Routing with time windows by column generation , 1983, Networks.

[14]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[15]  Subrata Mitra,et al.  An Algorithm for the generalized Vehicle Routing Problem with Backhauling , 2005, Asia Pac. J. Oper. Res..

[16]  Q Ma.  Vehicle Routing Problem with Simultaneous Pick-up and Delivery with Hard Time Windows based on Hybrid Algorithm , 2009 .