𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solving the traveling salesman problem with annealing-based heuristics: a computational study

✍ Scribed by Pepper, J.W.; Golden, B.L.; Wasil, E.A.


Book ID
117874217
Publisher
IEEE
Year
2002
Tongue
English
Weight
341 KB
Volume
32
Category
Article
ISSN
1083-4427

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A heuristic circulation-network approach
✍ Alberto Garcia-Diaz πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 561 KB

The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the