Mathematical formulations for a 1-full-truckload pickup-and-delivery problem

European Journal of Operational Research

Volumn 242, Issue 3, 2015, Pages 1008-1016

  Gendreau, Michel ^a   Nossack, Jenny ^b   Pesch, Erwin ^b  

^a INTERUNIVERSITY RESEARCH CENTRE ON ENTERPRISE NETWORKS   (Canada)

^b UNIVERSITY OF SIEGEN   (Germany)

Author keywords

Asymmetric traveling salesman problem; Classical benders decomposition; Generalized benders decomposition; Pickup and delivery problem

Indexed keywords

CUSTOMER SATISFACTION; INTEGER PROGRAMMING; PICKUPS; SALES; STOCHASTIC PROGRAMMING;

ASYMMETRIC TRAVELING SALESMAN PROBLEM; BENDERS DECOMPOSITION; BRANCH-AND-CUT ALGORITHMS; GENERALIZED BENDERS DECOMPOSITIONS; MATHEMATICAL FORMULATION; MODEL FORMULATION; PICKUP AND DELIVERY PROBLEMS; SOLUTION APPROACH;

TRAVELING SALESMAN PROBLEM;

EID: 84920517741     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.10.053     Document Type: Article

References (51)

1. Anily, S., & Bramel, J. (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Research Logistics, 46, 654-670.
2. Anily, S., Gendreau, M., & Laporte, G. (1999). The swapping problem on a line. SIAM Journal on Computing, 29, 327-335.
3. Anily, S., & Hassin, R. (1992). The swapping problem. Networks, 22, 419-433.
4. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton, NJ: Princeton University Press.
5. Bektas, T. (2012). Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing. European Journal of Operational Research, 216, 83-93.
6. Benchakroun, A., Ferland, J. A., & Cléroux, R. (1991). Distribution system planning through a generalized Benders decomposition approach. European Journal of Operational Research, 62, 149-162.
7. Benders, J. F. (1962). Partitioning procedures for solvingmixed-variables programming problems. Numerische Mathematik, 4, 238-252.
8. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., & Laporte, G. (2007). Static pickup and delivery problems: A classification scheme and survey. Top, 15, 1-31.
9. Bertsekas, D. P. (1999). Nonlinear programming (2nd ed.). Belmont: Athena Scientific.
10. Bertsimas, D., & Tsitsiklis, J. N. (1997). Introduction to linear optimization. Belmont: Athena Scientific.
11. Bloom, J. A. (1983). Solving an electricity generating capacity expansion planning problem by generalized Benders' decomposition. Operations Research, 31, 84-100.
12. Burkard, R., Dell'Amico, M., & Martello, S. (2009). Assignment problems. Philadelphia: SIAM.
13. Chalasani, P., & Motwani, R. (1999). Approximating capacitated routing and delivery problems. SIAM Journal on Computing, 28, 2133-2149.
14. Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem. In N. Christofides, A. Mingozzi, P. Toth, & C. Sandi (Eds.), Combinatorial optimization (pp. 315-338). Chichester: Wiley.
15. Cook, W. J. (2012). In pursuit of the traveling salesman: Mathematics at the limits of computation. Princeton, NJ: Princeton University Press.
16. Cordeau, J.-F., & Laporte, G. (2003). The dial-a-ride problem (DARP): Variants, modeling issues and algorithms. 4OR: A Quarterly Journal of Operations Research, 1, 89-101.
17. Cordeau, J.-F., Soumis, F., & Desrosiers, J. (2000). A Benders decomposition approach for the locomotive and car assignment problem. Transportation Science, 34, 133-149.
18. Cordeau, J.-F., Soumis, F., & Desrosiers, J. (2001). Simultaneous assignment of locomotives and cars to passenger trains. Operations Research, 49, 531-548.
19. Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale travelingsalesman problem. Journal of the Operations Research Society of America, 2, 393-410.
20. Desaulniers, G., Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1997). Daily aircraft routing and scheduling. Management Science, 43, 841-855.
21. Federgruen, A., & Zipkin, P. (1984). A combined vehicle routing and inventory allocation problem. Operations Research, 32, 1019-1037.
22. Fisher, M. L., & Jaikumar, R. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11, 109-124.
23. Gendreau, M., Laporte, G., & Vigo, D. (1999). Heuristics for the traveling salesman problem with pickup and delivery. Computers & Operations Research, 26, 699-714.
24. Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10, 237-260.
25. Geoffrion, A. M., & Graves, G. W. (1974). Multicommodity distribution system design by Benders decomposition. Management Science, 20, 822-844.
26. Gutin, G., & Punnen, A. P. (2002). The traveling salesman problem and its variations. Dordrecht: Kluwer Academic Publishers.
27. Hernández-Pérez, H., Rodríguez-Martín, I., & Salazar-González, J.-J. (2009). A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Operations Research, 36, 1639-1645.
28. Hernández-Pérez, H., & Salazar-González, J.-J. (2004a). Abranch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete AppliedMathematics, 145, 126-139.
29. Hernández-Pérez, H., & Salazar-González, J.-J. (2004b). Heuristics for the onecommodity pickup-and-delivery traveling salesman problem. Transportation Science, 38, 245-255.
30. Hoang, H. H. (1982). Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition. IEEE Transactions on Automatic Control, 27, 164-169.
31. Hoffman, K., & Padberg, M. (1985). LP-based combinatorial problem solving. Annals of Operations Research, 4, 145-194.
32. Hosny, M., & Mumford, C. (2010). Solving the one-commodity pickup and delivery problem using an adaptive hybrid VNS/SA approach. In R. Schaefer, C. Cotta, J. Kolodziej, & G. Rudolph (Eds.), Lecture Notes in Computer Science: Vol. 6239. Parallel problem solving from nature, PPSN XI (pp. 189-198). Berlin: Springer.
33. Lahyani, R., Khemakhem, M., & Semet, F. (2015). Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research, 241, 1-14.
34. Macharis, C., & Bontekoning, Y. M. (2004). Opportunities for OR in intermodal freight transport research: A review. European Journal of Operational Research, 153, 400-416.
35. Magnanti, T. L., &Wong, R. T. (1981). Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Operations Research, 29, 464-484.
36. Martinovic, G., Aleksi, I., & Baumgartner, A. (2008). Single-commodity vehicle routing problem with pickup and delivery service. Mathematical Problems in Engineering, 2008, 1-17. doi:10.1155/2008/697981.
37. Mercier, A. (2008). A theoretical comparison of feasibility cuts for the integrated aircraft-routing and crew-pairing problem. Transportation Science, 42, 87-104.
38. Mercier, A., Cordeau, J.-F., & Soumis, F. (2005). A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. Computers & Operations Research, 32, 1451-1476.
39. Nossack, J., & Pesch, E. (2013). A truck scheduling problem arising in intermodal container transportation. European Journal of Operational Research, 230, 666-680.
40. Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008a). A survey on pickup and delivery problems. Part I: Transportation between customers and depot. Journal für Betriebswirtschaft, 58, 21-51.
41. Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2008b). A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft, 58, 81-117.
42. Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225, 1-11.
43. Richardson, R. (1976). An optimization approach to routing aircraft. Transportation Science, 10, 52-71.
44. Savelsbergh, M. W. P., & Sol, M. (1995). The general pickup and delivery problem. Transportation Science, 29, 17-29.
45. Schrijver, A. (2003). Combinatorial optimization: Polyhedra and efficiency. Berlin: Springer.
46. Sexton, T. R., & Bodin, L. D. (1985a). Optimizing single vehicle many-to-many operations with desired delivery times: I. Scheduling. Transportation Science, 19, 378-410.
47. Sexton, T. R., & Bodin, L. D. (1985b). Optimizing single vehicle many-to-many operations with desired delivery times: II. Routing. Transportation Science, 19, 411-435.
48. Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254-265.
49. Wang, F., & Lim, A. (2006). The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks, 48, 24-35.
50. Zhang, R., Yun, W. Y., & Kopfer, H. (2010). Heuristic-based truck scheduling for inland container transportation. OR Spectrum, 32, 787-808.
51. Zhao, F., Li, S., Sun, J., & Mei, D. (2009). Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem. Computers & Industrial Engineering, 56, 1642-1648.