徳島大学 教育・研究者情報データベース(EDB)

1. 永田 裕一([徳島大学.大学院社会産業理工学研究部.理工学域.知能情報系.情報工学分野]/[徳島大学.理工学部.理工学科.知能情報コース.情報工学講座])

   役割	任意
   貢献度	任意
   学籍番号	推奨

(英) Fast Implementation of Genetic Algorithm by Localized EAX Crossover for the Traveling Salesman Problem

(日) 局所的な交叉EAXを用いたGAの高速化とTSPへの適用

(英) We propose an genetic algorithm (GA) that applies to the traveling salesman problem (TSP). The GA uses edge assembly crossover (EAX), which is known to be effective for solving the TSP. We first propose a fast implementation of a localized EAX where localized edge exchanges are used in the EAX procedure. We also propose a selection model with an effective combination of the localized EAX that can maintain population diversity at negligible computational costs. Edge entropy measure is used to evaluate population diversity. We demonstrate that the proposed GA is comparable to state-of-the-art heuristics for the TSP. Especially, the GA is superior to them on large instances more than 10,000 cities. For example, the GA found an optimal solution of brd14051 (14,051 cities instance) with a reasonable computational cost. The results are quite impressive because the GA does not use Lin-Kernighan local search (LKLS) even though almost all existing state-of-the-art heuristics for the TSP based on LKLS and its variants.

1. (英) genetic algorithm
2. (英) TSP
3. (英) EAX
4. (英) localized crossover
5. (英) population diversity