Solving Time-Varying Knapsack Problem Based on Binary Harmony Search Algorithm

摘要

In order to using harmony search algorithm (HSA) to solve dynamic optimization problems, this paper proposed a binary harmony search algorithm (BHSA) based on hybrid double-coding method. In this paper we use the BHSA, DSBPSO and PDGA to solve time-varying knapsack problem. The results show that dynamic search capability and ability of tracing optimal solution of BHAS are nearly as same as DS_BPSO, but the robustness and the universality are more superior.