✦ LIBER ✦

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

✍ Scribed by Károly F. Pál

Publisher: Springer-Verlag
Year: 1993
Tongue: English
Weight: 787 KB
Volume: 69
Category: Article
ISSN: 0340-1200
DOI: 10.1007/bf01185425

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the refinement of bounds of heuristic

On the refinement of bounds of heuristic algorithms for the traveling salesman problem

✍ Bernd Jeromin; Frank Körner 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 184 KB

A note on heuristics for the traveling s

A note on heuristics for the traveling salesman problem

✍ Gianfranco d'Atri 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 208 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 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