DocumentCode
2444878
Title
Solving vehicle routing problems using elastic nets
Author
Vakhutinsky, Andrew I. ; Golden, Bruce L.
Author_Institution
Coll. of Bus. & Manage., Maryland Univ., College Park, MD, USA
Volume
7
fYear
1994
fDate
27 Jun-2 Jul 1994
Firstpage
4535
Abstract
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)
Keywords
combinatorial mathematics; mathematics computing; neural nets; optimisation; transportation; travelling salesman problems; approximate solution; combinatorial optimization; elastic nets; multiple traveling salesmen problem; vehicle routing problems; Cities and towns; Educational institutions; Equations; Gravity; Neural networks; Routing; Rubber; Temperature; Traveling salesman problems; Vehicle dynamics;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on
Conference_Location
Orlando, FL
Print_ISBN
0-7803-1901-X
Type
conf
DOI
10.1109/ICNN.1994.375004
Filename
375004
Link To Document