Please use this identifier to cite or link to this item:
Title: Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems
Authors: Yang, J.-h.
Sun, L.
Lee, H.P. 
Qian, Y.
Liang, Y.-c.
Keywords: clonal selection algorithm
global search
job shop scheduling problem
local search
simulated annealing
Issue Date: Jun-2008
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.
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
ISSN: 16726529
DOI: 10.1016/S1672-6529(08)60014-1
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Apr 15, 2019


checked on Apr 15, 2019

Page view(s)

checked on Apr 7, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.