✦ LIBER ✦

Generalized Traveling Salesman Problem for Carrier-Vehicle Systems

✍ Scribed by Garone, Emanuele; Determe, Jean-François; Naldi, Roberto

Book ID: 121860674
Publisher: American Institute of Aeronautics and Astronautics
Year: 2014
Tongue: English
Weight: 965 KB
Volume: 37
Category: Article
ISSN: 0731-5090
DOI: 10.2514/1.62126

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The generalized covering traveling sales

The generalized covering traveling salesman problem

✍ Shaelaie, Mohammad H.; Salari, Majid; Naji-Azimi, Zahra 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 830 KB

Transformation of the generalized travel

Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem

✍ Yao-Nan Lien; Eva Ma; Benjamin W.-S. Wah 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 843 KB

A memetic algorithm for the generalized

A memetic algorithm for the generalized traveling salesman problem

✍ Gregory Gutin; Daniel Karapetyan 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 295 KB

Algorithm Evolution from Traveling Sales

Algorithm Evolution from Traveling Salesman Problem to Vehicle Routing Problem

✍ Zhang, Zhe; Yao, Yong Song; Zhang, Jian Hua 📂 Article 📅 2013 🏛 Trans Tech Publications Inc. 🌐 English ⚖ 217 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

An efficient composite heuristic for the

An efficient composite heuristic for the symmetric generalized traveling salesman problem

✍ Jacques Renaud; Fayez F. Boctor 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

The main purpose of this paper is to introduce a new composite heuristic for solving the generalized traveling salesman problem. The proposed heuristic is composed of three phases: the construction of an initial partial solution, the insertion of a node from each non-visited node-subset, and a solut