Advertisement

Simulated Annealing Applied to Traveling Salesman Problem: A Case Study

  • Maria Clara de Oliveira GêEmail author
  • Matheus da Silva Menezes
Conference paper
  • 22 Downloads
Part of the Lecture Notes on Multidisciplinary Industrial Engineering book series (LNMUINEN)

Abstract

Intelligent computational techniques are being extensively explored and disseminated to solve complex problems in favor of effective decision making12.. This paper describes the use of the Simulated Annealing metaheuristic for the Traveling Salesman Problem - TSP, contained in a dairy distribution company. The objective is to verify the applicability of the metaheuristic and validate its efficiency to solve combinatorial optimization problems, as opposed to an application to the real scenario. The results obtained are compared with the previous studies in the literature, which solve the same TSP by means of Memetic Algorithm and the exact method. With the comparative analysis, it can be verified that the proposed metaheuristic is a method of obtaining good solutions for difficult optimization problems, both in terms of the quality of the solutions obtained and the execution time of the algorithm.

Keywords

Simulated Annealing Traveling Salesman Problem Combinatorial optimization 

References

  1. 1.
    Kanda, J.Y., Carvalho, A., Hruschka, E., Soares, C.: Selection of algorithms to solve Traveling Salesman Problems using meta-learning. Int. J. Hybrid Intell. Syst. 8(3), 117–128 (2011)CrossRefGoogle Scholar
  2. 2.
    Goldbarg, M.C., Luna, H.P.: Combinatorial Optimization and Linear Programming: Models and Algorithms. Elsevier Publishing House, Rio de Janeiro (2015)Google Scholar
  3. 3.
    Karp, R.M.: Reducibility among Combinatorial Problems. Springer, Heidelberg (1972)CrossRefGoogle Scholar
  4. 4.
    Souza, M.J.F.: Inteligência Computacional para Otimização. Universidade Federal de Ouro Preto, Ouro Preto (2008)Google Scholar
  5. 5.
    Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)CrossRefGoogle Scholar
  6. 6.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Fernandes, F.R.S.: Evolutionary Metaheuristics Applied to the Problem of Vehicle Routing in a Dairy Company within the RN: An Approach via Genetic and Memetic Algorithms. 85 f. Monography. Undergraduate in Information Systems. Federal Rural University of the Semi-Arid, Angicos (2016)Google Scholar
  8. 8.
    Bezerra, T.L.A.: Genetic Algorithm Applied to Vehicle Routing Problem in Deliveries Performed by a Dairy Company: Case Study. 53 f. Monograph. Bachelor of Science and Technology. Rural Federal University of Semi-Arid, Angicos (2013)Google Scholar
  9. 9.
    Silva, G.L.S.: Routing of Vehicles in Deliveries by Dairy Products: Case Study. 52 f. Monography. Undergraduate in Science and Technology. Federal Rural University of the Semi-Arid, Angicos (2012)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Maria Clara de Oliveira Gê
    • 1
    Email author
  • Matheus da Silva Menezes
    • 2
  1. 1.Engineering CenterUniversidade Federal Rural do Semi-Árido (UFERSA)MossoróBrazil
  2. 2.Center of Exact and Natural SciencesUniversidade Federal Rural do Semi-Árido (UFERSA)MossoróBrazil

Personalised recommendations