Dedicated hardware for inheritance-oriented crossover operation

  • Authors:
  • Masaya Yoshikawa;Kentaro Otsuka;Hidekazu Terai

  • Affiliations:
  • Department of Information Engineering, Meijo University, Tenpaku, Nagoya, Aichi, Japan;Department of VLSI System Design, Ritsumeikan University, Nojihigashi, Kusatsu, Shiga, Japan;Department of VLSI System Design, Ritsumeikan University, Nojihigashi, Kusatsu, Shiga, Japan

  • Venue:
  • WSEAS Transactions on Circuits and Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Traveling salesman problem is basic combinatorial optimization problem of various practical applications in engineering. Genetic Algorithm (GA) is one of algorithms to solve the traveling salesman problem efficiently. GA is a powerful optimization algorithm, which is based on the mechanism of biological evolution. However, an essential difficulty exits in GA with regard to large amount of computation time, because GA is population-based search algorithm. Reducing the computational time is the most important priority, if GA is applied to practical problems. On the other hand, GA has three genetic operations, and the crossover operation is one of the most important genetic operations. In this paper, we propose novel hardware architecture for crossover operation in order to reduce computation time while keeping the search performance. The proposed architecture introduces a new hardware-oriented crossover algorithm considering character inheritance. Experiments prove that the proposed architecture achieves not only high speed processing but also reduction of the number of processing steps, while keeping the quality of solution.