On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands

Mathematical Programming

Volumn 119, Issue 1, 2009, Pages 169-194

  Louveaux, François ^a   Salazar González, Juan José ^b  

^a UNIVERSITY OF NAMUR   (Belgium)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

PROBLEM SOLVING; RANDOM PROCESSES; UNMANNED VEHICLES;

COMPUTATIONAL RESULTS; CUSTOMER DEMANDS; OPTIMAL TOURS; STOCHASTIC DEMANDS; TRAVELING SALESMAN; VEHICLE CAPACITIES;

TRAVELING SALESMAN PROBLEM;

EID: 60449096031     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-008-0206-0     Document Type: Article

References (15)

1. S. Anily J. Bramel 1999 Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries Naval Res. Logis. 46 654 670
2. P. Beraldi G. Ghiani G. Laporte R. Musmanno 2005 Efficient neighbourhood search for the probabilistic pickup and delivery travelling salesman problem Networks 46 195 198
3. D. Bertsimas P. Jaillet A. Odoni 1990 A priori optimization Oper. Res. 38 6 1019 1033
4. D. Bertsimas M. Sim 2003 Robust discrete Optimization and network flows Math. Program. B 98 49 71
5. P. Chalasani R. Motwani 1999 Approximating capacitated routing and delivery problems SIAM J. Comput. 28 2133 2149
6. Hernández-Pérez, H., Salazar-González, J.J.: The multi-commodity Travelling Salesman Problem with Pickups and Deliveries, working paper, University of La Laguna (2004)
7. H. Hernández-Pérez J.J. Salazar-González 2004 A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery Discrete Appl. Math. 145 126 139
8. H. Hernández-Pérez J.J. Salazar-González 2004 Heuristics for the one-commodity pickup-and-delivery traveling salesman problem Transportation Sci. 38 2 245 255
9. H. Hernández-Pérez J.J. Salazar-González 2007 The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms Networks 50 4 258 272
10. C. Hjorring J. Holt 1999 New optimality cuts for a single-vehicle stochastic routing problem Ann. Oper. Res. 86 569 584
11. P. Jaillet 1988 A priori solution of a traveling salesman problem in which a random subset of the customers are visited Oper. Res. 36 6 929 936
12. G. Laporte F. Louveaux H. Mercure 1992 The vehicle routing problem with stochastic travel times Transportation Sci. 26 3 161 170
13. G. Laporte F. Louveaux H. Mercure 1994 A priori optimization of the probabilistic traveling salesman problem Oper. Res. 42 3 543 549
14. Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds) Network Routing Handbooks in Operations Research and Management Science 8, pp 141-295 (1995)
15. Takacs L. (1967). Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York