Skip to main content
SpringerLink
Log in

Metaheuristics and Cloud Computing: A Case Study on the Probabilistic Traveling Salesman Problem with Deadlines

  • Conference paper
  • First Online:
Computer Aided Systems Theory – EUROCAST 2015 (EUROCAST 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9520))

Included in the following conference series:

  • 1543 Accesses

Abstract

In this work we study the potential of cloud computing in the context of optimization. For this purpose we perform a case study on the Probabilistic Traveling Salesman Problem with Deadlines, an extremely difficult stochastic combinatorial optimization problem. By using a large amount of computational resources in parallel, it is possible to obtain significantly better solutions for the Probabilistic Traveling Salesman Problem with Deadlines in the same amount of time. For many different applications this advantage clearly outweighs the requirement for additional computational resources, in particular considering the convenience of modern cloud infrastructures.

D. Weyland—This work has been supported by the Swiss National Science Foundation as part of the Early Postdoc.Mobility grant 152293.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Campbell, A.M., Thomas, B.W.: Probabilistic traveling salesman problem with deadlines. Transp. Sci. 42(1), 1–21 (2008)

    Article  Google Scholar 

  2. Campbell, A.M., Thomas, B.W.: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Comput. Oper. Res. 36(4), 1231–1248 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43(2), 367–371 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  4. Jaillet, P.: Probabilistic traveling salesman problems. PhD thesis, MIT, Department of Civil Engineering (1985)

    Google Scholar 

  5. Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6), 929–936 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  6. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. Local Search Comb. Optim. 1, 215–310 (1997)

    MathSciNet  MATH  Google Scholar 

  7. Weyland, D.: On the computational complexity of the probabilistic traveling salesman problem with deadlines. Theor. Comput. Sci. 540, 156–168 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  8. Weyland, D., Montemanni, R., Gambardella, L.M.: A metaheuristic framework for stochastic combinatorial optimization problems based on GPGPU with a case study on the probabilistic traveling salesman problem with deadlines. J. Parallel Distrib. Comput. 73, 74–85 (2012)

    Article  Google Scholar 

  9. Weyland, D., Montemanni, R., Gambardella, L.M.: Hardness results for the probabilistic traveling salesman problem with deadlines. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 392–403. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Weyland, D., Montemanni, R., Gambardella, L.M.: Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel monte carlo sampling. Comput. Oper. Res. 40(7), 1661–1670 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universitá Della Svizzera Italiana, Lugano, Switzerland

    Dennis Weyland

  2. Department of Economics and Management, University of Brescia, Brescia, Italy

    Dennis Weyland

Authors
  1. Dennis Weyland
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dennis Weyland .

Editor information

Editors and Affiliations

  1. de Gran Canaria, Universidad de las Palmas de Gran Canari, Las Palmas de Gran Canaria, Spain

    Roberto Moreno-Díaz

  2. Johannes Kepler University Linz, Linz, Austria

    Franz Pichler

  3. de Gran Canaria, Universidad de las Palmas de Gran Canari, Las Palmas de Gran Canaria, Spain

    Alexis Quesada-Arencibia

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Weyland, D. (2015). Metaheuristics and Cloud Computing: A Case Study on the Probabilistic Traveling Salesman Problem with Deadlines. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27340-2_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27339-6

  • Online ISBN: 978-3-319-27340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation