𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An adapted heuristic approach for a clustered traveling salesman problem with loading constraints

✍ Scribed by Felipe, Angel; Ortuño, M. Teresa; Tirado, Gregorio

Book ID
118793134
Publisher
Springer
Year
2012
Tongue
English
Weight
289 KB
Volume
10
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A tabu search heuristic using genetic di
A tabu search heuristic using genetic diversification for the clustered traveling salesman problem
✍ Gilbert Laporte; Jean-Yves Potvin; Florence Quilleret 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 736 KB

The clustered traveling salesman problem is an extension of the classical traveling salesman problem where the set of vertices is partitioned into clusters. The objective is to find a least cost Hamiltonian Cycle such that the vertices of each cluster are visited contiguously and the clusters are vi