Abstract
We apply the Clonal Selection principle of the human immune system to solve the Flexible Job-Shop Problem with recirculation. Various practical design issues are addressed in the implemented algorithm, ClonaFLEX; first, an efficient antibody representation which creates only feasible solutions and a bootstrapping antibody initialization method to reduce the search time required. Second, the assignment of suitable mutation rates for antibodies based on their affinity. To this end, a simple yet effective visual method of determining the optimal mutation value is proposed. And third, to prevent premature convergence, a novel way of using elite pools to incubate antibodies is presented. Performance results of ClonaFLEX are obtained against benchmark FJSP instances by Kacem and Brandimarte. On average, ClonaFLEX outperforms a cultural evolutionary algorithm (EA) in 7 out of 12 problem sets, equivalent results for 4 and poorer in 1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Weissman, I., Cooper, M.: How the Immune System Develops. Scientific American, 64–71 (1993)
Burnet, F.: The Clonal Selection Theory of Acquired Immunity. Cambridge Press, Cambridge (1959)
de Castro, L., Von Zuben, F.: Artificial Immune System: Part 1 - Basic Theory and Applications, Technical Report, State University of Campinas, Campinas (1999)
de Castro, L., Von Zuben, F.: Learning and Optimization Using the Clonal Selection Principle. IEEE Transactions on Evolutionary Computation, Special Issue on Artificial Immune Systems 6(3), 239–251 (2001)
de Castro, L., Timmis, J.: Artificial Immune System: A New Computational Intelligence Approach. Springer, London (2002)
Doyen, A., Engin, O., Ozkan, C.: A New Artificial Immune System Approach to Solve Permutation Flow Shop Scheduling Problems. In: Turkish Symposium on Artificial Immune Systems and Neural Networks TAINN 2003 (2003)
Garey, M., Johnson, D., Sethi, R.: The Complexity of Flow Shop and Job-shop Schedules. Mathematics of Operations Research 1(2), 117–129 (1976)
Brandimarte, P.: Routing and Scheduling in a Flexible Job-Shop by Tabu Search. Annals of Operations Research 2, 158–183 (1993)
Kacem, I., Hammadi, S., Borne, P.: Approach by Localization and Multiobjective Evolutionary Optimization for Flexible Job-shop Scheduling Problems. IEEE Transactions on Systems, Man and Cybernetics 32(1), 1–13 (2002)
Kacem, I., Hammadi, S., Borne, P.: Pareto-optimality Approach for Flexible Job-Shop Scheduling Problems: Hybridization of Evolutionary Algorithms and Fuzzy Logic. Mathematics and Computer in Simulation 60, 245–276 (2002)
Tay, J.C., Ho, N.B.: GENACE: An Efficient Cultural Algorithm for Solving the Flexible Job-Shop Problem. In: Proceedings of the IEEE Congress of Evolutionary Computation, pp. 1759–1766 (2004)
Tay, J.C., Wibowo, D.: An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules. In: Proceedings of AAAI Genetic and Evolutionary Computation, vol. 2, pp. 210–221 (2004)
Ramino, V., Camino, R., Vela, J.P., Alberto, G.: A knowledge-based evolutionary strategy for scheduling problems with bottleneck. European Journal of Operations Research 145(1), 57–71 (2003)
Kadluczka, M., Nelson, P., Tirpak, T.: N-to-2-Space Mapping for Visualization of Search Algorithm Performance. In: 16th IEEE International Conference on Tools with Artificial Intelligence, pp. 508–513 (2004)
Sammon Jr., J.W.: A Nonlinear Mapping for Data Structure Analysis. IEEE Transactions on Computers 18(5), 401–409 (1969)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ong, Z.X., Tay, J.C., Kwoh, C.K. (2005). Applying the Clonal Selection Principle to Find Flexible Job-Shop Schedules. In: Jacob, C., Pilat, M.L., Bentley, P.J., Timmis, J.I. (eds) Artificial Immune Systems. ICARIS 2005. Lecture Notes in Computer Science, vol 3627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11536444_34
Download citation
DOI: https://doi.org/10.1007/11536444_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28175-7
Online ISBN: 978-3-540-31875-0
eBook Packages: Computer ScienceComputer Science (R0)