## Abstract By using competitive learning, which causes just one or a group of a small number of neurons to respond to a given input, self‐organization of entire neural networks can be achieved. When this self‐organization process is applied to various kinds of travelling salesman problems in a Euc
A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems
✍ Scribed by Abdolhamid Modares; Samerkae Somhom; Takao Enkawa
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 201 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0969-6016
No coin nor oath required. For personal study only.
✦ Synopsis
This paper addresses several algorithms based on self-organizing neural network approach for routing problems. The algorithm for Traveling Salesman Problem is elaborated and the extension of the proposed algorithm to more complex problems namely, Multiple Traveling Salesmen and Vehicle Routing is discussed. In order to investigate the performance of the algorithms, a comprehensive empirical study has been provided. The simulations, which are conducted on standard data, evaluate the overall performance of this approach by comparing the results with the best known or the optimal solutions of the problems. The proposed algorithm shows signi®cant advances in both qualities of the solution and computational eorts for most of the experimented data.
📜 SIMILAR VOLUMES