A Novel Genetic Algorithm for Multiconstrained Knapsack Problem

다중제약 배낭문제를 위한 새로운 유전 알고리즘

  • 이상욱 (광주과학기술원 기전공학과) ;
  • 석상문 (광주과학기술원 기전공학과) ;
  • 이주상 (광주과학기술원 기전공학과) ;
  • 장석철 (광주과학기술원 기전공학과) ;
  • 안병하 (광주과학기술원 기전공학과)
  • Published : 2005.05.13


The knapsack problem (KP) is one of the traditional optimization problems. Specially, multiconstrained knapsack problem (MKP) is well-known NP-hard problem. Many heuristic algorithms and evolutionary algorithms have tackled this problem and shown good performance. This paper presents a novel genetic algorithm for the multiconstrained knapsack problem. The proposed algorithm is called 'Adaptive Link Adjustment'. It is based on integer random key representation and uses additional ${\alpha}$ and ${\beta}$-process as well as selection, crossover and mutation. The experiment results show that it can be archive good performance.