Abstract
A new method for finding approximate solutions to the Traveling Salesman Problem (TSP) is described. The proposed method uses elastic neural networks to generalize TSPs into two levels, the multiple traveling salesman problem and the vehicle routing problem. This approach reduces running times considerably by approximating the problems' components with a more easily computable function.
Cite
CITATION STYLE
APA
Vakhutinsky, A. I., & Golden, B. L. (1994). Solving vehicle routing problems using elastic nets. In IEEE International Conference on Neural Networks - Conference Proceedings (Vol. 7, pp. 4535–4540). IEEE. https://doi.org/10.1109/icnn.1994.375004
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free