✦ 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/bf00199453

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 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

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 hybrid genetic algorithm fo

An efficient hybrid genetic algorithm for the traveling salesman problem

✍ Kengo Katayama; Hiroyuki Narihisa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

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