Referenced Items are not available for this document.
Using neural networks to find an approximate solution to difficult optimization problems is a very attractive prospect. The traveling salesman problem (TSP), probably the best-known problem in combinatorial optimization, has been attacked by a variety of neural network approaches. The main purpose of this paper is to show how elastic network ideas can be applied to two TSP generalizations: the multiple traveling salesmen problem (MTSP) and the vehicle routing problem (VRP)
Published in:
Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on
(Volume:7
)
Date of Conference: 27 Jun-2 Jul 1994
- Page(s):
- 4535 - 4540 vol.7
- Meeting Date :
- 27 Jun 1994-02 Jul 1994
- Print ISBN:
- 0-7803-1901-X
- INSPEC Accession Number:
- 4957002
- Conference Location :
- Orlando, FL
- Digital Object Identifier :
- 10.1109/ICNN.1994.375004
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
