Immunity based genetic algorithm for solving quadratic assignment problem (QAP)

  • Authors:
  • Chou-Yuan Lee;Zne-Jung Lee;Shun-Feng Su

  • Affiliations:
  • Dept. of Electrical Engineering, National Taiwan University of Science and Technology;Dept. of Information Management, Kang-Ning Junior College of Nursing;Dept. of Electrical Engineering, National Taiwan University of Science and Technology

  • Venue:
  • ICECS'03 Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, immunity based genetic algorithm is proposed to solve quadratic assignment problem (QAP). The QAP problem, known as NP-hard problem, is a combinatorial problem found in the optimal assignment of facilities to allocations. The proposed algorithm is to enhance the performance of genetic algorithms by embedded immune systems so as to have locally optimal offspring, and it is successfully applied to solve QAP. From our simulations for those tested problems, the proposed algorithm has the best performances when compared to other existing search algorithms.