Skip to main content
Springer Nature Link
Log in

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

  • FULL LENGTH PAPER
  • Published:
Mathematical Programming Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

This paper studies how to set the vehicle capacity for traveling Salesman Problems where some of the customer demands are stochastic. The analyses are done for the one-commodity pickup-and-delivery TSP, as this problem also includes the setting of the initial load. The paper first considers feasibility issues. This includes finding the smallest vehicle capacity and some initial load such that a given tour is feasible for all scenarios. Different variants are considered as a function of the time when information becomes available. The paper then analyzes the case where some penalties are paid for routing a tour unable to handle customer demands. Various types of penalties are considered. The paper studies properties of the minimal expected penalty of a given tour, which are then used to provide approaches to find near-optimal tours. Computational results are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Anily S. and Bramel J. (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Res. Logis. 46: 654–670

    Article  MATH  MathSciNet  Google Scholar 

  2. Beraldi P., Ghiani G., Laporte G. and Musmanno R. (2005). Efficient neighbourhood search for the probabilistic pickup and delivery travelling salesman problem. Networks 46: 195–198

    Article  MathSciNet  Google Scholar 

  3. Bertsimas D., Jaillet P. and Odoni A. (1990). A priori optimization. Oper. Res. 38(6): 1019–1033

    Article  MATH  MathSciNet  Google Scholar 

  4. Bertsimas D. and Sim M. (2003). Robust discrete Optimization and network flows. Math. Program. B 98: 49–71

    Article  MATH  MathSciNet  Google Scholar 

  5. Chalasani P. and Motwani R. (1999). Approximating capacitated routing and delivery problems. SIAM J. Comput. 28: 2133–2149

    Article  MATH  MathSciNet  Google Scholar 

  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. Hernández-Pérez H. and Salazar-González J.J. (2004). A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl. Math. 145: 126–139

    Article  MATH  MathSciNet  Google Scholar 

  8. Hernández-Pérez H. and Salazar-González J.J. (2004). Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Sci. 38(2): 245–255

    Article  Google Scholar 

  9. Hernández-Pérez H. and Salazar-González J.J. (2007). The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms. Networks 50(4): 258–272

    Article  MATH  MathSciNet  Google Scholar 

  10. Hjorring C. and Holt J. (1999). New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper. Res. 86: 569–584

    Article  MATH  MathSciNet  Google Scholar 

  11. Jaillet P. (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

    Article  MATH  MathSciNet  Google Scholar 

  12. Laporte G., Louveaux F. and Mercure H. (1992). The vehicle routing problem with stochastic travel times. Transportation Sci. 26(3): 161–170

    Article  MATH  Google Scholar 

  13. Laporte G., Louveaux F. and Mercure H. (1994). A priori optimization of the probabilistic traveling salesman problem. Oper. Res. 42(3): 543–549

    Article  MATH  MathSciNet  Google Scholar 

  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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Louvain School of Management, FUNDP, University of Namur, Namur, Belgium

    François Louveaux

  2. Departamento de Estadística, Investigación Operativa y Computación. Facultad de Matemáticas, Universidad de La Laguna, Av. Astrofísico Francisco Sánchez, 38271, La Laguna, Tenerife, Spain

    Juan-José Salazar-González

Authors
  1. François Louveaux
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Juan-José Salazar-González
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Juan-José Salazar-González.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Louveaux, F., Salazar-González, JJ. On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands. Math. Program. 119, 169–194 (2009). https://doi.org/10.1007/s10107-008-0206-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-008-0206-0

Mathematics Subject Classification (2000)