The heterogeneous pickup and delivery problem with configurable vehicle capacity

Transportation Research Part C: Emerging Technologies

Volumn 32, Issue , 2013, Pages 1-20

  Qu, Yuan ^a   Bard, Jonathan F ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Adaptive large neighborhood search; Configurable vehicle capacity; Dial a ride problem; Heterogeneous vehicles; Pickup and delivery problem

Indexed keywords

CUSTOMER SATISFACTION; PICKUPS; TRUCKS;

ADAPTIVE LARGE NEIGHBORHOOD SEARCHES; DIAL-A-RIDE PROBLEM; HETEROGENEOUS VEHICLES; PICKUP AND DELIVERY PROBLEMS; VEHICLE CAPACITY;

INTEGER PROGRAMMING;

HEURISTICS; NEIGHBORHOOD; PUBLIC TRANSPORT; TRANSPORT VEHICLE; TRANSPORTATION PLANNING;

EID: 84877057920     PISSN: 0968090X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trc.2013.03.007     Document Type: Article

References (36)

1. Baldacci R., Battarra M., Vigo D. Routing a heterogeneous fleet of vehicles. The Vehicle Routing Problem: Latest Advances and New Challenges 2008, 3-27. Springer, New York. B.L. Golden, S. Raghavan, E.A. Wasil (Eds.).
2. Baldacci R., Bartolini E., Mingozzi A. An exact algorithm for the pickup and delivery problem with time windows. Operations Research 2011, 59(2):414-426.
3. Baldacci R., Mingozzi A. A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming 2009, 120(2):347-380.
4. Bard J.F., Jarrah A.I. A large-scale constrained clustering for rationalizing pickup and delivery operations. Transportation Research Part B 2009, 43(5):542-561.
5. Bard J.F., Kontoravdis G., Yu G. A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 2002, 36(2):250-269.
6. Berbeglia G., Cordeau J.-F., Gribkovskaia I., Laporte G. Static pickup and delivery problems: a classification scheme and survey. TOP 2007, 15(2a):1-31.
7. Cordeau J.F. A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 2006, 54(3):573-586.
8. Cordeau, J.F., Laporte, G., 2003. The dial-a-ride problem (DARP): variants, modeling issues and algorithms. 4OR 1, 89-101.
9. Cordeau J.F., Laporte G., Savelsbergh M.W.P., Vigo D. Vehicle routing. Transportation, Handbooks in Operations Research and Management Science 2007, 367-428. North-Holland, Amsterdam. C. Barnhart, G. Laporte (Eds.).
10. Dantzig G.B., Ramser J.M. The truck dispatching problem. Management Science 1959, 6(1):81-91.
11. Desaulniers G. Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Operations Research 2010, 58(1):179-192.
12. Desrochers M., Desrosiers J., Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 1992, 40(2):342-354.
13. Golden B., Assad A., Levy L., Gheysens F. The fleet size and mix vehicle routing problem. Computers & Operations Research 1984, 11(1):49-66.
14. Hansen P., Mladenovic N. Variable neighborhood search: principles and applications. European Journal of Operational Research 2001, 130(3):449-467.
15. Hoff A., Andersson H., Christiansen M., Hasle G., Løkketangen A. Industrial aspects and literature survey: fleet composition and routing. Computers & Operations Research 2010, 37(12):2041-2061.
16. Jain, S., Hentenryck, P.V., 2011. Large neighborhood search for dial-a-ride problems. Lecture Notes in Computer Science 6876. In: Lee, J. (Ed.), Principles and Practice of Constraint Programming, pp. 400-413.
17. Kontoravdis G., Bard J.F. A GRASP for the vehicle routing problem with time windows. ORSA Journal on Computing 1995, 7(2a):10-23.
18. Lee Y.H., Kim J.I., Kang K.H., Kim K.H. A heuristic for vehicle fleet mix problem using tabu search and set partitioning. Journal of the Operational Research Society 2008, 59(6):833-841.
19. Li, H., Lim. A., 2001. A metaheuristic for the pickup and delivery problem with time windows. In: ICTAI-2001, 13th IEEE Conf. Tools Artificial Intelligence, Dallas, TX, pp. 160-170.
20. Masson R., Lehuédé F., Péton O. An adaptive large neighborhood search for the pickup and delivery problem with transfers. Transportation Science 2012, 10.1287/trsc.1120.0432.
21. Nanry W.P., Barnes J.W. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B 2000, 34(2b):107-121.
22. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 1993, 41(4):421-451.
23. Parragh S.N. Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C 2011, 19(5):912-930.
24. Parragh S.N., Cordeau J.F., Doerner K.F., Hartl R.F. Models and algorithms for the heterogeneous dial-a-ride problem with driver related constraints. OR Spectrum 2012, 34(3):593-633.
25. Parragh S.N., Doerner K.F., Hartl R.F. A survey on pickup and delivery problems. Part II: transportation between pickup and delivery locations. Journal für Betriebswirtschaft 2008, 58(2):81-117.
26. Parragh S.N., Doerner K.F., Hartl R.F. Variable neighborhood search for the dial-a-ride problem. Computer & Operations Research 2010, 37(6):1129-1138.
27. Prins C. Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case. Journal of Mathematical Modelling and Algorithms 2002, 1(2):135-150.
28. Qu Y., Bard J.F. A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Computers & Operations Research 2012, 39(10):2439-2456.
29. Ropke S., Pisinger D. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 2006, 40(4):455-472.
30. Ropke S., Cordeau J.F. Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science 2009, 43(3):267-286.
31. Savelsbergh M., Sol M. The general pickup and delivery problem. Transportation Science 1995, 29(1):17-29.
32. Shang J.S., Cuff C.K. Multicriteria pickup and delivery problem with transfer opportunity. Computers & Industrial Engineering 1996, 30(4):631-645.
33. Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Lecture Notes in Computer Science 1520. Principles and Practice of Constraint Programming 1998, 417-431. Springer-Verlag, Berlin. M. Maher, J.F. Puget (Eds.).
34. Taillard E.D. A heuristic column generation method for the heterogeneous fleet VRP. Recherche Operationnelle 1999, 33(1):1-14.
35. Toth, P., Vigo, D. (Eds.), 2002. The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
36. Xu H., Chen Z.-L., Rajagopal S., Arunapuram S. Solving a practical pickup and delivery problem. Transportation Science 2003, 37(3):347-364.