✦ LIBER ✦

Meta-RaPS: a simple and effective approach for solving the traveling salesman problem

✍ Scribed by Gail W. DePuy; Reinaldo J. Moraga; Gary E. Whitehouse

Book ID: 116937728
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 331 KB
Volume: 41
Category: Article
ISSN: 1366-5545
DOI: 10.1016/j.tre.2004.02.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A multi-agent approach for solving trave

A multi-agent approach for solving traveling salesman problem

✍ Zhou Tiejun; Tan Yihong; Xing Lining 📂 Article 📅 2006 🏛 Wuhan University 🌐 English ⚖ 540 KB

A new approach to solve the traveling sa

A new approach to solve the traveling salesman problem

✍ Paulo Henrique Siqueira; Maria Teresinha Arns Steiner; Sérgio Scheer 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 248 KB

Can rats solve a simple version of the t

Can rats solve a simple version of the traveling salesman problem?

✍ Jan Bureš; Olga Burešová; Ludek Nerad 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 707 KB

An Effective Heuristic Algorithm for the

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

✍ S. Lin and B. W. Kernighan 📂 Article 📅 1973 🏛 INFORMS 🌐 English ⚖ 509 KB

A simple LP relaxation for the asymmetri

A simple LP relaxation for the asymmetric traveling salesman problem

✍ Nguyen, Thành 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 179 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