Advertisement

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

  • Dennis Weyland
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9520)

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.

Keywords

Stochastic combinatorial optimization Cloud computing Probabilistic traveling salesman problem with deadlines 

References

  1. 1.
    Campbell, A.M., Thomas, B.W.: Probabilistic traveling salesman problem with deadlines. Transp. Sci. 42(1), 1–21 (2008)CrossRefGoogle Scholar
  2. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Jaillet, P.: Probabilistic traveling salesman problems. PhD thesis, MIT, Department of Civil Engineering (1985)Google Scholar
  5. 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)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 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)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Weyland, D.: On the computational complexity of the probabilistic traveling salesman problem with deadlines. Theor. Comput. Sci. 540, 156–168 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 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)CrossRefGoogle Scholar
  9. 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) CrossRefGoogle Scholar
  10. 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)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Universitá Della Svizzera ItalianaLuganoSwitzerland
  2. 2.Department of Economics and ManagementUniversity of BresciaBresciaItaly

Personalised recommendations