A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems

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 di...

Full description

Saved in:
Bibliographic Details
Published in:International Transactions in Operational Research Vol. 6; no. 6; pp. 591 - 606
Main Authors: Modares, A., Somhom, S., Enkawa, T.
Format: Journal Article
Language:English
Japanese
Published: Oxford, UK Blackwell Publishing Ltd 01.11.1999
Wiley
Subjects:
Neural networks
Optimization
Routing problems
Travelling salesman problem
ISSN:0969-6016, 1475-3995
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 significant advances in both qualities of the solution and computational efforts for most of the experimented data.
Bibliography:ArticleID:ITOR591
istex:437CC855FF36A08224248991FEC6DF12C4F35878
ark:/67375/WNG-SNZW7C8D-D
ISSN:0969-6016
1475-3995
DOI:10.1111/j.1475-3995.1999.tb00175.x