Journal of the Korean Institute of Telematics and Electronics C (전자공학회논문지C)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Solution of quadratic assignment problem using parallel combinatorial variant of evolution strategy

병렬 CES를 이용한 QAP 해법

  • Park, Lae-Jeong (Department of Electrical Engineering Korea Advanced Institute of Science and Technology) ;
  • Lee, Hyun (Korea Telecom International) ;
  • Park, Cheol-Hoon (Department of Electrical Engineering Korea Advanced Institute of Science and Technology)
  • 박래정 (한국과학기술원 전기 및 전자공학과) ;
  • 이현 (한국통신기술연구소) ;
  • 박철훈 (한국과학기술원 전기 및 전자공학과)
  • Published : 1997.05.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a parallel combinatorial variant of evolution strategy (PCES) to solve well-known combinatorial optimization problems, Quadratic assignment problems (QAPs). The PCES reduces the possibility of getting stuck in local minima due to maintenance of subpopulation and thus it is more effective than the CES. Experiment results on two benchmark problems show that the PCES is better than the cES and the genetic algorithm(GA).

Keywords