Yayıncı

Toplam kayıt 3, listelenen: 1-3

    • A discrete artificial bee colony algorithm for the permutation flow shop scheduling problem with total flowtime criterion 

      Tasgetiren, M.F.; Pan, Q.K.; Suganthan, P.N.; Chen, A.H.L. (2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)
      Very recently, Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm ...

    • An ensemble of differential evolution algorithms for constrained function optimization 

      Tasgetiren, M.F.; Suganthan, P.N.; Pan, Q.K.; Mallipeddi, R.; Sarman, S. (2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)
      This paper presents an ensemble of differential evolution algorithms employing the variable parameter search and two distinct mutation strategies in the ensemble to solve real-parameter constrained optimization problems. ...

    • Solving lot-streaming flow shop scheduling problems using a discrete harmony search algorithm 

      Pan, Q.K.; Tasgetiren, M.F.; Suganthan, P.N.; Liang, Y.C. (2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010, 2010)
      The harmony search (HS) algorithm is one of the recent evolutionary computation techniques to solve optimization problems. To make it applicable for lot-streaming flow shop problems, a discrete variant of the HS algorithm ...