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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.