Skip to main content
SpringerLink
Log in

Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

A facility has to be located in a given area to serve a given number of customers. The position of the customers is not known. The service to the customers is carried out by several traveling salesmen. Each of them has a capacity in terms of the maximum number of customers that can be served in any tour. The aim was to determine the service zone (in a shape of a circle) that minimizes the expected cost of the traveled routes. The center of the circle is the location of the facility. Once the position of the customers is revealed, the customers located outside the service zone are served with a recourse action at a greater unit cost. For this problem, we compare the performance of two different solution approaches. The first is based on a heuristic proposed for the Capacitated Traveling Salesman Problem and the second on the optimal solution of a stochastic second-order cone formulation with an approximate objective function.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Klose, A., Drexl, A.: Facility location models for distribution system design. Eur. J. Oper. Res. 162, 4–29 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. ReVelle, C.S., Eiselt, H.A.: Location analysis: a synthesis and survey. Eur. J. Oper. Res. 165, 1–19 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Melo, M.T., Nickel, S., Saldanha-da-Gama, F.: Facility location and supply chain management—a review. Eur. J. Oper. Res. 196, 401–412 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  4. Snyder, L.V.: Facility location under uncertainty: a review. IIE Trans. 38, 537–554 (2006)

    Article  Google Scholar 

  5. Nagy, G., Salhi, S.: Location-routing: issues, models and methods. Eur. J. Oper. Res. 177, 649–672 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  6. Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43, 408–416 (2009)

    Article  MathSciNet  Google Scholar 

  7. Burness, R.C., White, J.A.: The traveling salesman location problem. Transp. Sci. 10(4), 348–360 (1976)

    Article  Google Scholar 

  8. Berman, O., Simchi-Levi, D.: Minisum location of a traveling salesman. Networks 16, 239–254 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  9. Simchi-Levi, D., Berman, O.: Heuristics and bounds for the travelling salesman location problem on the plane. Oper. Res. Lett. 6, 243–248 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  10. Simchi-Levi, D., Berman, O.: A heuristic algorithm for the traveling saleman location problem on networks. Oper. Res. 36(3), 478–484 (1998)

    Article  MathSciNet  Google Scholar 

  11. McDiarmid, C.: Probability modelling and optimal location of a travelling salesman. J. Oper. Res. Soc. 43(5), 533–538 (1992)

    Article  MATH  Google Scholar 

  12. Simchi-Levi, D.: The capacitated traveling salesmen location problem. Transp. Sci. 25(1), 9–18 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  13. Bertsimas, D.J.: Traveling salesman facility location problems. Transp. Sci. 23(3), 184–191 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Klibi, W., Lasalle, F., Martel, A., Ichoua, S.: The stochastic multi-period location-transportation problem. Transp. Sci. 44, 221–237 (2010)

    Article  Google Scholar 

  15. Santoso, T., Ahmed, S., Goetschalckx, M., Shapiro, A.: A stochastic programming approach for supply chain network design under uncertainty. Eur. J. Oper. Res. 167, 96–115 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lei, H., Laporte, G., Guo, B.: Districting for routing with stochastic customers. EURO J. Transp. Logist. 1, 67–85 (2012)

    Article  Google Scholar 

  17. Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. Math. Proc. Camb. Philos. Soc. 55(4), 299–327 (1959). Cambridge University Press

    Article  MATH  MathSciNet  Google Scholar 

  18. Daganzo, C.F.: The distance traveled to visit \(n\)-points with a maximum of c-stops per vehicle—an analytic model and an application. Transp. Sci. 18, 331–350 (1984)

    Article  MathSciNet  Google Scholar 

  19. Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (1997)

    MATH  Google Scholar 

  20. Kall, P., Wallace, S.W.: Stochastic Programming. Wiley, Chichester (1994)

    MATH  Google Scholar 

  21. Shapiro, A.: Stochastic programming approach to optimization under uncertainty. Math. Program. Ser. B 112(1), 183–220 (2008)

    Article  MATH  Google Scholar 

  22. Ariyawansa, K.A., Zhu, Y.: Stochastic semidefinite programming a new paradigm for stochastic optimization. 4OR 4(3), 239–253 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  23. Pataki, G. (ed.): Computational Semidefinite and Second Order Cone Programming: The State of the Art. Springer, Heidelberg (2003)

    Google Scholar 

  24. Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38, 49–95 (2004)

    Article  MathSciNet  Google Scholar 

  25. Zhu, Y., Zhang, J., Partel, K.: Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach. Math. Comput. Model. 52, 2192–2203 (2011)

    Article  Google Scholar 

  26. Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B 95, 3–51 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  27. Maggioni, F., Potra, F., Bertocchi, M., Allevi, E.: Stochastic second-order cone programming in mobile ad hoc networks. J. Optim. Theory Appl. 143, 309–328 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  28. Sun, P., Freund, R.M.: Computation of minimum-costcovering elliposoids. Oper. Res. 52(5), 690–706 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  29. Maggioni, F., Wallace, S.W., Bertocchi, M., Allevi, E.: Sensitivity analysis in stochastic second-order cone programming for mobile ad hoc networks. Procedia Soc. Behav. Sci. 2, 7704–7705 (2010)

    Article  Google Scholar 

  30. Kaut, M., Wallace, S.W.: Evaluation of scenario generation methods for stochastic programming. Pac. J. Optim. 3(2), 257–271 (2007)

    MATH  MathSciNet  Google Scholar 

  31. Bertazzi, L., Maggioni, F.: The stochastic capacitated traveling salesmen location problem: a computational comparison for a United States instance. Procedia Soc. Behav. Sci. 108, 47–56 (2014)

    Article  Google Scholar 

Download references

Acknowledgments

The authors wish to thank the Referees and Guest Editors (Manlio Gaudioso, Raffaele Cerulli and Francesco Carrabs) for useful suggestions that allowed us to improve the paper.

Author information

Authors and Affiliations

  1. Department of Economics and Management, University of Brescia, Contrada S. Chiara 50, 25122, Brescia, Italy

    Luca Bertazzi

  2. Department of Management, Economics and Quantitative Methods, University of Bergamo, Via dei Caniana 2, 24127, Bergamo, Italy

    Francesca Maggioni

Authors
  1. Luca Bertazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesca Maggioni
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Francesca Maggioni.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bertazzi, L., Maggioni, F. Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse. J Optim Theory Appl 166, 321–342 (2015). https://doi.org/10.1007/s10957-014-0638-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-014-0638-z

Keywords

Mathematics Subject Classification

Search

Navigation