경쟁 공진화알고리듬을 이용한 다목적 Job shop 일정계획

Multi-objective job shop scheduling using a competitive coevolutionary algorithm

  • 이현수 (전남대학교 산업공학과) ;
  • 신경석 (전남대학교 산업공학과) ;
  • 김여근 (전남대학교 산업공학과)
  • 발행 : 2003.05.01

초록

Evolutionary algorithm is recognized as a promising approach to solving multi-objective combinatorial optimization problems. When no preference information of decision makers is given, multi-objective optimization problems have been commonly used to search for diverse and good Pareto optimal solution. In this paper we propose a new multi-objective evolutionary algorithm based on competitive coevolutionary algorithm, and demonstrate the applicability of the algorithm. The proposed algorithm is designed to promote both population diversity and rapidity of convergence. To achieve this, the strategies of fitness evaluation and the operation of the Pareto set are developed. The algorithm is applied to job shop scheduling problems (JSPs). The JSPs have two objectives: minimizing makespan and minimizing earliness or tardiness. The proposed algorithm is compared with existing evolutionary algorithms in terms of solution quality and diversity. The experimental results reveal the effectiveness of our approach.

키워드