A CONSTRAINT PROGRAMMING HEURISTIC FOR A HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH SPLIT DELIVERIES

REFERENCES

• Archetti , C. , M. W. P. Savelsbergh , and M. G. Speranza . 2008 . To split or not to split: that is the question . Transportation Research Part E , 44 : 114 – 123 .
   Google Scholar
• Archetti , C. , M. G. Speranza , and A. A. Hertz 2006 . Tabu search algorithm for the split delivery vehicle routing problem . Transportation Science 40 : 64 – 73 .
   Web of Science ®Google Scholar
• Belenguer , J. M. , M. C. Martinez , and E. Mota . 2000 . A lower bound fort he split delivery vehicle routing problem . Operations Research , 48 : 801 – 810 .
   Web of Science ®Google Scholar
• Burchett , D. , and E. Campion . 2002 . Mix fleet vehicle routing problem–An application of tabu search in the grocery delivery industry. Management Science Honors Project. University of Canterbury.
   Google Scholar
• Chen , H. K. , C. F. Hsueh , and M. S. Chang . 2006 . The real-time time-dependent vehicle routing problem . Transportation Research Part E , 42 : 383 – 408 .
   Google Scholar
• Choi , E. , and D. W. Tcha . 2007. A column generation approach to the heterogeneous fleet vehicle routing problem. Computers & Operations Research , 34:2080–2095.
   Web of Science ®Google Scholar
• Cordeau , J. F. , G. Desaulniers , J. Desrosiers , M. M. Solomon , and F. Soumis . 2002 . VRP with time windows . In The Vehicle Routing Problem , eds. P. Toth and D. Vigo , 157 – 193 . Philadelphia : SIAM .
   Google Scholar
• Desrochers , M. , and T. W. Verhoog . 1991 . A new heuristic for the fleet size and mix vehicle routing problem . Computers & Operations Research , 18 : 263 – 274 .
   Web of Science ®Google Scholar
• Dror , M. , G. Laporte , and P. Trudeau . 1994 . Vehicle routing with split deliveries . Discrete Applied Mathematics , 50 : 239 – 254 .
   Web of Science ®Google Scholar
• Du , T. , F. K. Wang , and P. Y. Lu . 2007 . A real-time vehicle-dispatching system for consolidating milk runs . Transportation Research Part E , 43 : 565 – 577 .
   Google Scholar
• Faulin , J. 2003 . Applying MIXALG procedure in a routing problem to optimize food product delivery . Omega , 31 : 387 – 395 .
   Web of Science ®Google Scholar
• Ferrari , E. , R. Manzini , A. Pareschi , A. Persona , and A. Regattieri . 2003 . The car pooling problem: heuristic algorithms based on savings functions . Journal of Advanced Transportation , 37 : 243 – 272 .
   Web of Science ®Google Scholar
• Frizzell , P. W. , and J. W. Giffin . 1995 . The split delivery vehicle scheduling problem with time windows and grid network distances . Computers & Operations Research , 22 : 655 – 667 .
   Web of Science ®Google Scholar
• Gendreau , M. , G. Laporte , C. Musaraganyi , and E. D. Taillard . 1999 . A tabu search heuristic for the heterogeneous fleet vehicle routing problem . Computers & Operations Research , 26 : 1153 – 1173 .
   Web of Science ®Google Scholar
• Golden , B. L. , A. A. Assad , L. Levy , and F. Gheysens . 1984 . The fleet size and mix vehicle routing problem . Computers & Operations Research , 11 : 49 – 66 .
   Web of Science ®Google Scholar
• Ho , S. C. , and D. Haugland . 2004 . A tabu search heuristic for the vehicle routing problem with time windows and split deliveries . Computers & Operations Research , 31 : 1947 – 1964 .
   Web of Science ®Google Scholar
• ILOG S.A. 2003 . ILOG OPL Studio 3.7 Language Manual . France .
   Google Scholar
• Laporte , G. , and F. Semet . 2002 . Classical heuristics for the capacitated VRP . In The Vehicle Routing Problem , eds. P. Toth and D. Vigo , 109 – 128 . Philadelphia : SIAM .
   Google Scholar
• Lee , C. G. , M. Epelman , C. C. White , and Y. A. Bozer . 2002 . A shortest path approach to the multiple-vehicle routing problem with split pick-ups. In 17th International Symposium on Mathematical Programming. University of Michigan.
   Google Scholar
• Li , F. , B. Golden , and E. Wasil . 2007 . A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem . Computers & Operations Research , 34 : 2734 – 2742 .
   Web of Science ®Google Scholar
• Lima , C. M. R. R. , M. C. Goldbarg , and E. F. G. Goldbarg . 2004 . A memetic algorithm for the heterogeneous fleet vehicle routing problem . Electronic Notes in Discrete Mathematics , 18 : 171 – 176 .
   Google Scholar
• Liu , F. H. , and S. Y. Shen . 1999 . A method for vehicle routing problem with multiple vehicle types and time windows . Proceedings of National Science Council ROC , 23 : 526 – 536 .
   Google Scholar
• Moghaddam , R. T. , N. Safaei , and Y. Gholipour . 2006 . A hybrid simulated annealing for capacitated vehicle routing problems with independent route length . Applied Mathematics and Computation , 176 : 445 – 454 .
   Google Scholar
• Moghaddam , R. T. , N. Safaei , M. M. O. Kah , and M. Rabbani . 2007 . A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing . Journal of the Franklin Institute , 344 : 406 – 425 .
   Google Scholar
• Ochi , L. S. , D. S. Vianna , L. M. A. Drummond , and A. O. Victor . 1998 . A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet . Future Generation Computer Systems , 14 : 285 – 292 .
   Web of Science ®Google Scholar
• Pisinger , D. , and S. Ropke . 2006 . A general heuristic for vehicle routing problems . Computers & Operations Research , 171 : 750 – 775 .
   Google Scholar
• Salhi , S. , and M. Sari . 1997 . A multi level composite heuristic for the multi depot vehicle fleet mix problem . European Journal of Operations Research , 103 : 95 – 112 .
   Web of Science ®Google Scholar
• Shaw , P. 1998 . Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming, Italy , 417 – 431 .
   Google Scholar
• Tarantilis , C. D. , and C. T. Kiranoudis . 2001 . A meta-heuristic algorithm for the efficient distribution of perishable foods . Journal of Food Engineering , 50 : 1 – 9 .
   Web of Science ®Google Scholar
• Thangiah , S. R. , and S. Salhi . 2001 . Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem . Applied Artificial Intelligence , 15 : 361 – 383 .
   Web of Science ®Google Scholar
• Ulusoy , G. 1985 . The fleet size and mix problem for capacitated arc routing . European Journal of Operational Research , 22 : 329 – 337 .
   Google Scholar
• Taillard , E. D. 1999 . A heuristic column generation method for the heterogeneous fleet VRP . RAIRO , 3 : 1 – 4 .
   Google Scholar