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

DOI IR Web Site Web Site 2 Citations 35 References Open Access
  • Nagata Yuichi
    Graduate School of Information Science, Japan Advanced Institute of Science and Technology

Bibliographic Information

Other Title
  • 局所的な交叉ＥＡＸを用いたＧＡの高速化とＴＳＰへの適用
  • キョクショテキナ コウサ EAX オ モチイタ GA ノ コウソクカ ト TSP エノ テキヨウ

Search this article

Description

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.

Journal

Citations (2)*help

See more

References(35)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top