✦ LIBER ✦

A multiperiod traveling salesman problem: Heuristic algorithms

✍ Scribed by G. Paletta

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 687 KB
Volume: 19
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(92)90018-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic algorithm for traveling sale

A heuristic algorithm for traveling salesman problems

✍ Said Ashour; J.F. Vega; R.G. Parker 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 685 KB

A new heuristic for the period traveling

A new heuristic for the period traveling salesman problem

✍ I-Ming Chao; Bruce L. Golden; Edward A. Wasil 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 668 KB

A multistart heuristic for the equality

A multistart heuristic for the equality generalized traveling salesman problem

✍ Valentina Cacchiani; Albert Einstein Fernandes Muritiba; Marcos Negreiros; Paolo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

A restricted dynamic programming heurist

A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

✍ Chryssi Malandraki; Robert B. Dial 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 762 KB

A search algorithm for the traveling sal

A search algorithm for the traveling salesman problem

✍ Jatinder N.D. Gupta 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 713 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