Solving vehicle routing problems using elastic nets

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

Full description

Saved in:
Bibliographic Details
Published inIEEE International Conference on Neural Networks, 1994 Vol. 7; pp. 4535 - 4540 vol.7
Main Authors Vakhutinsky, A.I., Golden, B.L.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1994
Subjects
Cities and towns
Educational institutions
Equations
Gravity
Neural networks
Routing
Rubber
Temperature
Traveling salesman problems
Vehicle dynamics
Online AccessGet full text
ISBN078031901X
9780780319011
DOI10.1109/ICNN.1994.375004

Cover

More Information
Summary: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).< >
ISBN:078031901X
9780780319011
DOI:10.1109/ICNN.1994.375004