Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
1998
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14378/1/14378_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14378/2/14378_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|