✦ 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
DOI: 10.1109/3468.995530

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the traveling salesman problem b

Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search

✍ Xiutang Geng; Zhihua Chen; Wei Yang; Deqian Shi; Kai Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 612 KB

A new and efficient ant-based heuristic

A new and efficient ant-based heuristic method for solving the traveling salesman problem

✍ Cheng-Fa Tsai; Chun-Wei Tsai; Ching-Chang Tseng 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB

A heuristic circulation-network approach

A heuristic circulation-network approach to solve the multi-traveling salesman problem

✍ 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

A heuristic for the traveling salesman p

A heuristic for the traveling salesman problem based on a continuous approximation

✍ Jose M. del Castillo 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 669 KB

Genetic algorithms for the traveling sal

Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation

✍ Károly F. Pál 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 787 KB

Genetic algorithms for the traveling sal

Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation

✍ Károly F. Pál 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 787 KB