Comparison of neural networks for solving the travelling salesman problem

B.F.J. Maire, La; V.M. Mladenov

doi:10.1109/NEUREL.2012.6419953

Comparison of neural networks for solving the travelling salesman problem

B.F.J. Maire, La, V.M. Mladenov

Integrated Circuits

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

16 Citations (Scopus)

1 Downloads (Pure)

Abstract

The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were compared with respect to quality of solution and ease of finding correct parameters: the Integer Linear Programming method, the Hopfield Neural Network, and the Kohonen Self Organizing Feature Map Neural Network

Original language	English
Title of host publication	Proceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	21-24
ISBN (Print)	978-1-4673-1569-2
DOIs	https://doi.org/10.1109/NEUREL.2012.6419953
Publication status	Published - 2012

Access to Document

10.1109/NEUREL.2012.6419953

Cite this

Maire, La, B. F. J., & Mladenov, V. M. (2012). Comparison of neural networks for solving the travelling salesman problem. In Proceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia (pp. 21-24). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/NEUREL.2012.6419953

@inproceedings{47ee6a9c5ee64203b9623fb5cbb80d4d,

title = "Comparison of neural networks for solving the travelling salesman problem",

abstract = "The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were compared with respect to quality of solution and ease of finding correct parameters: the Integer Linear Programming method, the Hopfield Neural Network, and the Kohonen Self Organizing Feature Map Neural Network",

author = "{Maire, La}, B.F.J. and V.M. Mladenov",

year = "2012",

doi = "10.1109/NEUREL.2012.6419953",

language = "English",

isbn = "978-1-4673-1569-2",

pages = "21--24",

booktitle = "Proceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

}

Maire, La, BFJ & Mladenov, VM 2012, Comparison of neural networks for solving the travelling salesman problem. in Proceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia. Institute of Electrical and Electronics Engineers, Piscataway, pp. 21-24. https://doi.org/10.1109/NEUREL.2012.6419953

Comparison of neural networks for solving the travelling salesman problem. / Maire, La, B.F.J.; Mladenov, V.M.

Proceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia. Piscataway : Institute of Electrical and Electronics Engineers, 2012. p. 21-24.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Comparison of neural networks for solving the travelling salesman problem

AU - Maire, La, B.F.J.

AU - Mladenov, V.M.

PY - 2012

Y1 - 2012

N2 - The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were compared with respect to quality of solution and ease of finding correct parameters: the Integer Linear Programming method, the Hopfield Neural Network, and the Kohonen Self Organizing Feature Map Neural Network

AB - The TSP deals with finding a shortest path through a number of cities. This seemingly simple problem is hard to solve because of the amount of possible solutions. Which is why methods that give a good suboptimal solution in a reasonable time are generally used. In this paper three methods were compared with respect to quality of solution and ease of finding correct parameters: the Integer Linear Programming method, the Hopfield Neural Network, and the Kohonen Self Organizing Feature Map Neural Network

U2 - 10.1109/NEUREL.2012.6419953

DO - 10.1109/NEUREL.2012.6419953

M3 - Conference contribution

SN - 978-1-4673-1569-2

SP - 21

EP - 24

BT - Proceedings of the 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL), 20-22 September 2012, Belgrade, Serbia

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

ER -

Comparison of neural networks for solving the travelling salesman problem

Abstract

Access to Document

Fingerprint

Cite this