FLEXMAP - A neural network with linear time and space complexity for the travelling salesman problem
Fritzke B, Wilke P (1991)
Publication Language: English
Publication Type: Conference contribution, Abstract of lecture
Publication year: 1991
Original Authors: Wilke Peter, Fritzke Bernd
Pages Range: 929-934
Event location: Singapore
ISBN: 0-7803-0227-3
DOI: 10.1109/IJCNN.1991.170519
Abstract
The authors present a self-organizing `neural' network for the traveling salesman problem. It is partly based on the model of Kohonen. The proposed approach differs from former work in this direction as no ring structure with a fixed number of elements is used. Instead a small initial structure is enlarged during a distribution process. This makes it possible to replace the central search step, which normally needs time O(n), by a local procedure that needs time O (1). Since the total number of search steps that must be performed is O(n) the runtime of the model scales linearly with problem size. This is better than every known neural or conventional algorithm. The path lengths of the solutions generated are less than 10% longer than the optimum solutions of solved problems from the literature
Authors with CRIS profile
How to cite
APA:
Fritzke, B., & Wilke, P. (1991). FLEXMAP - A neural network with linear time and space complexity for the travelling salesman problem. Paper presentation at Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN'91), Singapore, SG.
MLA:
Fritzke, Bernd, and Peter Wilke. "FLEXMAP - A neural network with linear time and space complexity for the travelling salesman problem." Presented at Proceedings of the IEEE International Joint Conference on Neural Networks (IJCNN'91), Singapore Ed. IEEE, 1991.
BibTeX: Download