By Topic

Solving vehicle routing problems using elastic nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Vakhutinsky, A.I. ; Coll. of Bus. & Manage., Maryland Univ., College Park, MD, USA ; Golden, B.L.

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