Please use this identifier to cite or link to this item:
|Title:||Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems|
|Keywords:||clonal selection algorithm|
job shop scheduling problem
|Citation:||Yang, J.-h., Sun, L., Lee, H.P., Qian, Y., Liang, Y.-c. (2008-06). Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems. Journal of Bionic Engineering 5 (2) : 111-119. ScholarBank@NUS Repository. https://doi.org/10.1016/S1672-6529(08)60014-1|
|Abstract:||A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki's neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm. © 2008 Jilin University.|
|Source Title:||Journal of Bionic Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2018
WEB OF SCIENCETM
checked on May 7, 2018
checked on May 25, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.