The multi-commodity one-to-one pickup-and-delivery traveling salesman problem

European Journal of Operational Research

Volumn 196, Issue 3, 2009, Pages 987-995

  Hernández Pérez, Hipólito ^a   Salazar González, Juan José ^a  

^a UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Branch and cut; Dial a Ride; Pickup and delivery; Traveling salesman

Indexed keywords

INTEGER PROGRAMMING; LINEARIZATION; PROBLEM SOLVING;

BRANCH-AND-CUT; COMPUTATIONAL EXPERIMENTS; DECOMPOSITION TECHNIQUES; DIAL-A-RIDE; LIMIT CAPACITIES; MIXED INTEGER LINEAR PROGRAMMING MODELS; MULTI COMMODITIES; OPTIMAL SOLUTIONS; PICKUP-AND-DELIVERY; TRAVELING SALESMAN; TSP WITH PRECEDENCE CONSTRAINTS;

TRAVELING SALESMAN PROBLEM;

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

References (27)

1. Anily S., and Hassin R. The swapping problem. Networks 22 (1992) 419-433
2. Ascheuer N., Jünger M., and Reinelt G. A branch-and-cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Computational Optimization and Applications 17 (2000) 61-84
3. Balas E., Fischetti M., and Pulleyblank W.R. The precedence-constrained asymmetric traveling salesman polytope. Mathematical Programming 68 (1995) 241-265
4. Barahona F. Network design using cut inequalities. SIAM Journal on Optimization 6 (1996) 823-837
5. Berbeglia G., Cordeau J.-F., Gribkovskaia I., and Laporte G. Static pickup and delivery problems: A classification scheme and survey. TOP 15 (2007) 1-31
6. Bianco L., Mingozzi A., Riccardelli S., and Spadoni M. Exact and heuristic procedures for the traveling salesman problem with precedence constraints, based on dynamic programming. INFOR 32 (1994) 19-32
7. Cordeau J.-F., and Laporte G. The dial-a-ride problem: Models and algorithms. Annals of Operations Research 153 (2007) 29-46
8. J.-F. Cordeau, G. Laporte and S. Ropke, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, in: B.L., Golden, S. Raghavan and E.A. Wasil (Eds.), Vehicle Routing: Latest Advances and Challenges, Kluwer, Boston, forthcoming.
9. Frederickson G.N., Hecht M.S., and Kim C.E. Approximation algorithms for some routing problems. SIAM Journal on Computing 7 (1978) 178-193
10. Gabrel V., Knippel A., and Minoux M. Exact solution of multicommodity network optimization problems with general step cost functions. Operations Research Letters 25 (1999) 15-23
11. Gondran M., and Minoux M. Graphs and algorithms (1984), John Wiley and Sons
12. Gouveia L., and Pesneau P. On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48 (2006) 77-89
13. Guan D.J. Routing a vehicle of capacity greater than one. Discrete Applied Mathematics 81 (1998) 41-57
14. Healy P., and Moll R. A new extension of local search applied to the dial-a-ride problem. European Journal of Operational Research 83 (1995) 83-104
15. Hernández-Pérez H., and Salazar-González J.J. A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Applied Mathematics 145 (2004) 126-139
16. Hernández-Pérez H., and Salazar-González J.J. Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science 38 2 (2004) 245-255
17. Hoffman A.J. A generalization of max flow - min cut. Mathematical Programming 6 (1974) 352-359
18. Kalantari B., Hill A.V., and Arora S.R. An algorithm for the traveling salesman problem with pickup and delivery customers. European Journal of Operational Research 22 (1985) 377-386
19. Kubo M., and Kasugai H. Heuristic algorithms for the single vehicle dial-a-ride problem. Journal of the Operations Research Society of Japan 33 (1990) 354-364
20. Mirchandani P. Projections of the capacitated network loading problem. European Journal of Operational Research 122 (2000) 534-560
21. Mosheiov G. The traveling salesman problem with pickup and delivery. European Journal of Operational Research 79 (1994) 299-310
22. Psaraftis H.N. A dinamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14 (1980) 130-154
23. Psaraftis H.N. An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science 17 (1983) 351-357
24. Renaud J., Boctor F.F., and Laporte G. Perturbation heuristics for the pickup and delivery traveling salesman problem. Computers & Operations Research 29 (2002) 1129-1141
25. Renaud J., Boctor F.F., and Ouenniche I. A heuristic for the pickup and delivery traveling salesman problem. Computers & Operations Research 27 (2000) 905-916
26. K.S. Ruland, The Pickup and Delivery Problem. PhD thesis, Washington University, 1995.
27. Ruland K.S., and Rodin E.Y. The pickup and delivery problem:faces and branch-and-cut algorithm. Computers and Mathematics, with Applications 33 (1997) 1-13