|
|||||
|
|
Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems |
|
| Authors: | Jin-hui Yang Liang Sun Heow Pueh Lee Yun Qian Yan-chun Liang College of Computer Science Technology Jilin University Key Laboratory of Symbol Computation Knowledge Engineering of Ministry of Education Changchun PRChina |
| Institution: | [1]College of Computer Science and Technology, Jilin University, Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education, Changchun 130012, P. R. China [2]Institute of High Performance Computing, Singapore 117528, Singapore [3]Department of Mechanical Engineering, National University of Singapore, Singapore 117576, Singapore [4]Institute of Electric and Information Engineering, Beihua University, Jilin 13202 l, P. R. China |
| 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. |
| Keywords: | job shop scheduling problem clonal selection algorithm simulated annealing global search local search |
| 本文献已被 CNKI 维普 万方数据 ScienceDirect 等数据库收录！ | |