Proceedings Paper
Solving time-varying knapsack problem based on binary harmony search algorithm| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper 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.
Paper Details
Date Published: 14 March 2013
PDF: 5 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87680Q (14 March 2013); doi: 10.1117/12.2003328
Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)
PDF: 5 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87680Q (14 March 2013); doi: 10.1117/12.2003328
Show Author Affiliations
Ning Li, Shijiazhuang Univ. of Economics (China)
Jianqin Liu, Shijiazhuang Information Engineering Vocational College (China)
Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)
© SPIE. Terms of Use
