Solving time-varying knapsack problem based on binary harmony search algorithm

Ning Li; Jianqin Liu

doi:10.1117/12.2003328

14 March 2013 Solving time-varying knapsack problem based on binary harmony search algorithm

Ning Li, Jianqin Liu

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.

Citation Download Citation

Ning Li and 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); https://doi.org/10.1117/12.2003328

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available