๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems

โœ Scribed by Jin-hui Yang; Liang Sun; Heow Pueh Lee; Yun Qian; Yan-chun Liang

Publisher
SciencePress (China)
Year
2008
Tongue
English
Weight
591 KB
Volume
5
Category
Article
ISSN
1672-6529

No coin nor oath required. For personal study only.

โœฆ Synopsis

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.

๐Ÿ“œ SIMILAR VOLUMES

An efficient memetic algorithm for solvi
An efficient memetic algorithm for solving the job shop scheduling problem
โœ Liang Gao; Guohui Zhang; Liping Zhang; Xinyu Li ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 741 KB

## a b s t r a c t The job shop scheduling problem (JSP) is well known as one of the most complicated combinatorial optimization problems, and it is a NP-hard problem. Memetic algorithm (MA) which combines the global search and local search is a hybrid evolutionary algorithm. In this paper, an eff

An agent-based parallel approach for the
An agent-based parallel approach for the job shop scheduling problem with genetic algorithms
โœ Leila Asadzadeh; Kamran Zamanifar ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 599 KB

The job shop scheduling problem is one of the most important and complicated problems in machine scheduling. This problem is characterized as NP-hard. The high complexity of the problem makes it hard to find the optimal solution within reasonable time in most cases. Hence searching for approximate s