✦ LIBER ✦

A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem

✍ Scribed by Yannis Marinakis; Athanasios Migdalas; Panos M. Pardalos

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 223 KB
Volume: 10
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-005-4921-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Lower bounds for the symmetric travellin

Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations

✍ T.H.C. Smith; T.W.S. Meyer; G.L. Thompson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 556 KB

The efficiency of hybrid mutation geneti

The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem

✍ K Katayama; H Sakamoto; H Narihisa 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 519 KB

In this paper, we present an efficient genetic algorithm (GA) for solving the travelling salesman problem (TSP) as a combinatorial optimization problem. In our computational model, we propose a complete subtour exchange crossover that does not break as some good subtours as possible, because the goo

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

Development of a novel crossover of hybr

Development of a novel crossover of hybrid genetic algorithms for large-scale traveling salesman problems

✍ Masafumi Kuroda; Kunihito Yamamori; Masaharu Munetomo; Moritoshi Yasunaga; Ikuo 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 276 KB