Yazar
-
A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem
Pan, Q.K.; Suganthan, P.N.; Liang, J.J.; Tasgetiren, M.F. (PERGAMON-ELSEVIER SCIENCE LTD, 2011)In this paper, a local-best harmony search (HS) algorithm with dynamic sub-harmony memories (HM), namely DLHS algorithm, is proposed to minimize the total weighted earliness and tardiness penalties for a lot-streaming flow ... -
A local-best harmony search algorithm with dynamic subpopulations
Pan, Q.K.; Suganthan, P.N.; Liang, J.J.; Tasgetiren, M.F. (TAYLOR & FRANCIS LTD, 2010)This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm ... -
A self-adaptive global best harmony search algorithm for continuous optimization problems
Pan, Q.K.; Suganthan, P.N.; Tasgetiren, M.F.; Liang, J.J. (ELSEVIER SCIENCE INC, 2010)This paper presents a self-adaptive global best harmony search (SGHS) algorithm for solving continuous optimization problems. In the proposed SGHS algorithm, a new improvisation scheme is developed so that the good information ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..