Vehicle routing problem

Transportation Research Record

Volumn , Issue 2378, 2013, Pages 120-128

  Wang, Yong ^a   Ma, Xiaolei ^b   Lao, Yunteng ^b   Wang, Yinhai ^b   Mao, Haijun ^c  

^a CHONGQING JIAOTONG UNIVERSITY   (China)

^b University of Washington   (United States)

^c SOUTHEAST UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; PROBLEM SOLVING; VEHICLE ROUTING; VEHICLES;

COST SAVING; HYBRID HEURISTIC ALGORITHMS; INTEGER PROGRAMMING PROBLEMS; MIXED-INTEGER PROGRAMMING; RESEARCH INTERESTS; SOLUTION ALGORITHMS; SPLIT-LOAD; TIME WINDOWS; VEHICLE CAPACITY CONSTRAINTS; VEHICLE ROUTING PROBLEMS;

PICKUPS;

EID: 84893078879     PISSN: 03611981     EISSN: None     Source Type: Journal    
DOI: 10.3141/2378-13     Document Type: Article

References (32)

1. Paessens, H. The Savings Algorithm for the Vehicle Routing Problem. European Journal of Operational Research, Vol. 34, No. 3, 1988, pp. 336-344.
2. Belenguer, J. M., M. C. Martinez, and E. Mota. A Lower Bound for the Split Delivery Vehicle Routing Problem. Operations Research, Vol. 48, No. 5, 2000, pp. 801-810.
3. Archetti, C., M. W. P. Savelsbergh, and M. G. Speranza. To Split or Not to Split: That Is the Question. Transportation Research Part E, Vol. 44, No. 1, 2008, pp. 114-123.
4. Solomon, M. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research, Vol. 35, No. 2, 1987, pp. 254-265.
5. Goetschalckx, M., and C. Jacobs-Blecha. The Vehicle Routing Problem with Backhauls. European Journal of Operational Research, Vol. 42, No. 1, 1989, pp. 39-51.
6. Laporte, G. The Vehicle Routing Problem: An Over View of Exact and Approximate Algorithms. European Journal of Operational Research, Vol. 59, No. 3, 1992, pp. 345-358.
7. Dror, M., and P. Trudeau. Savings by Split Delivery Routing. Transportation Science, Vol. 23, No. 2, 1989, pp. 141-145.
8. Dror, M., G. Laporte, and P. Trudeau. Vehicle Routing with Split Deliveries. Discrete Applied Mathematics, Vol. 50, No. 3, 1994, pp. 239-254.
9. Gulczynski, D., B. Golden, and E. Wasil. The Split Delivery Vehicle Routing Problem with Minimum Delivery Amounts. Transportation Research Part E, Vol. 46, No. 5, 2010, pp. 612-626.
10. Ting, C.-J., and C.-H. Chen. Combination of Multiple Ant Colony System and Simulated Annealing for the Multidepot Vehicle-Routing Problem with Time Windows. In Transportation Research Record: Journal of the Transportation Research Board, No. 2089, Transportation Research Board of the National Academies, Washington, D. C., 2008, pp. 85-92.
11. Archetti, C., M. G. Speranza, and A. Hertz. A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science, Vol. 40, No. 1, 2006, pp. 64-73.
12. Jin, M. Z., K. Liu, and R. O. Bowden. A Two-Stage Algorithm with Valid Inequalities for the Split Delivery Vehicle Routing Problem. International Journal of Production Economics, Vol. 105, No. 1, 2007, pp. 228-242.
13. Jin, M. Z., K. Liu, and B. Eksioglu. A Column Generation Approach for the Split Delivery Vehicle Routing Problem. Operations Research Letters, Vol. 58, No. 4, 2008, pp. 265-270.
14. Lee, C. G., M. Epelman, C. C. White III, and Y. A. Bozer. A Shortest Path Approach to the Multiple-Vehicle Routing Problem with Split Pick-Ups. Transportation Research Part B, Vol. 40, No. 4, 2006, pp. 265-284.
15. Frizzell, P. W., and J. W. Giffin. The Split Delivery Vehicle Scheduling Problem with Time Windows and Grid Network Distance. Computers & Operations Research, Vol. 22, No. 6, 1995, pp. 655-667.
16. Ho, S. C., and D. Haugland. A Tabu Search Heuristic for Vehicle Routing Problem with Time Windows and Split Deliveries. Computers & Operations Research, Vol. 31, No. 12, 2004, pp. 1947-1964.
17. Belfiore, P., and H. T. Y. Yoshizaki. Scatter Search for a Real-Life Heterogeneous Fleet Vehicle Routing Problem with Time Windows and Split Deliveries in Brazil. European Journal of Operational Research, Vol. 199, No. 3, 2009, pp. 750-758.
18. Salani, M., and I. Vacca. Branch and Price for the Vehicle Routing Problem with Discrete Split Deliveries and Time Windows. European Journal of Operational Research, Vol. 213, No. 3, 2011, pp. 470-477.
19. Archetti, C., M. Bouchard, and G. Desaulniers. Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. Transportation Science, Vol. 45, No. 3, 2011, pp. 285-298.
20. Chen, J. F., and T. H. Wu. Vehicle Routing Problem with Simultaneous Deliveries and Pickups. Journal of the Operational Research Society, Vol. 57, No. 5, 2006, pp. 579-587.
21. Mitra, S. A Parallel Clustering Technique for the Vehicle Routing Problem with Split Deliveries and Pickups. Journal of the Operational Research Society, Vol. 59, No. 11, 2008, pp. 1532-1546.
22. Kumar, R., A. Unnikrishnan, and S. T. Waller. Capacitated-Vehicle Routing Problem with Backhauls on Trees: Model, Properties, Formulation, and Algorithm. In Transportation Research Record: Journal of the Transportation Research Board, No. 2263, Transportation Research Board of the National Academies, Washington, D. C., 2011, pp. 92-102.
23. Nanry, W. P., and J. W. Barnes. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search. Transportation Research Part B, Vol. 34, No. 2, 2000, pp. 107-121.
24. Lu, Q., and M. D. Maged. A New Insertion-Based Construction Heuristic for Solving the Pickup and Delivery Problem with Time Windows. European Journal of Operational Research, Vol. 175, No. 2, 2006, pp. 672-687.
25. Nowak, M., O. Ergun, and C. C. White III. An Empirical Study on the Benefit of Split Loads with the Pickup and Delivery Problem. European Journal of Operational Research, Vol. 198, No. 3, 2009, pp. 734-740.
26. Korsvik, J. E., K. Fagerholt, and G. Laporte. A Large Neighbourhood Search Heuristic for Ship Routing and Scheduling with Split Loads. Computers & Operations Research, Vol. 38, No. 2, 2011, pp. 474-483.
27. Mullaseril, P. A., M. Dror, and J. Leung. Split-Delivery Routing Heuristics in Livestock Feed Distribution. Journal of the Operational Research Society, Vol. 48, No. 2, 1997, pp. 107-116.
28. Potvin, J. Y., T. Kervahut, B. L. Garcia, and J. M. Rousseau. A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows. Technical report CRT-855. University de Montreal, Montreal, Quebec, Canada, 1992.
29. Lin, S. Computer Solution of the TSP. Bell System Technical Journal, Vol. 44, No. 1, 1965, pp. 2245-2269.
30. Or, I. Traveling Salesman-Type Combinational Problems and Their Relation to the Logistics of Blood Banking. PhD thesis. Northwestern University, Chicago, Ill., 1976.
31. Kim, C., Y. Park, and S. Sang. Spatial and Temporal Analysis of Urban Traffic Volume. ESRI International User Conference, Vol. 12, No. 1, 2008, pp. 1-24. proceedings.esri.com/library/userconf/proc08/papers/papers/pap-1613.pdf.
32. Figliozzi, M. A. The Time Dependent Vehicle Routing Problem with Time Windows: Benchmark Problems, an Efficient Solution Algorithm, and Solution Characteristics. Transportation Research Part E, Vol. 48, No. 3, 2012, pp. 616-636.