The efficiency of hybrid mutation geneti
โ
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