✦ LIBER ✦

An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem

✍ Scribed by Zakir Hussain Ahmed

Book ID: 120799303
Publisher: Springer-Verlag
Year: 2013
Tongue: English
Weight: 421 KB
Volume: 7
Category: Article
ISSN: 2251-7456
DOI: 10.1186/2251-7456-7-10

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

A Multilevel Genetic Algorithm for the T

A Multilevel Genetic Algorithm for the Traveling Salesman Problem

✍ Noureddine Bouhmala 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 58 KB

A hybrid genetic algorithm for the trave

A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery

✍ Fang-Geng Zhao; Jiang-Sheng Sun; Su-Jian Li; Wei-Min Liu 📂 Article 📅 2009 🏛 Institute of Automation, Chinese Academy of Scienc 🌐 English ⚖ 211 KB

A Hybrid Genetic—GRASP Algorithm Using L

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

✍ Yannis Marinakis; Athanasios Migdalas; Panos M. Pardalos 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 223 KB

A new genetic algorithm for the asymmetr

A new genetic algorithm for the asymmetric traveling salesman problem

✍ Yuichi Nagata; David Soler 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 288 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