14 March 2013 Solving time-varying knapsack problem based on binary harmony search algorithm
Author Affiliations +
Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 87680Q (2013) https://doi.org/10.1117/12.2003328
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore
Abstract
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, DS_BPSO 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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ning Li, Ning Li, Jianqin Liu, Jianqin Liu, } "Solving time-varying knapsack problem based on binary harmony search algorithm", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87680Q (14 March 2013); doi: 10.1117/12.2003328; https://doi.org/10.1117/12.2003328
PROCEEDINGS
5 PAGES


SHARE
Back to Top