Abstract
This research extends the sub-population genetic algorithm and combines it with a global archive and an adaptive strategy to solve the multi-objective parallel scheduling problems. In this approach, the global archive is applied within each subpopulation and once a better Pareto solution is identified, other subpopulations are able to employ this Pareto solution to further guide the searching direction. In addition, the crossover and mutation rates are continuously adapted according to the performance of the current generation. As a result, the convergence and diversity of the evolutionary processes can be maintained in a very efficient manner. Intensive experimental results indicate that the sub-population genetic algorithm combing the global archive and the adaptive strategy outperforms NSGA II and SPEA II approaches.
This is a preview of subscription content, log in via an institution to check access.
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
Affenzeller, M.: New Generic Hybrids Based Upon Genetic Algorithms, Institute of Systems, Science Systems Theory and Information Technology. Johannes Kepler University (2001)
Brucker, P.: Scheduling Algorithm. Springer, Berlin (1998)
Chang, P.C., Chen, S.H., Lin, K.L.: Two-phase sub population genetic algorithm for parallel machine-scheduling problem. Expert Systems with Applications 29(3), 705–712 (2005)
Chang, P.C., Hsieh, J.C., Wang, C.Y.: Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry. Applied Soft Computing (to appear, 2006)
Cochran, J.K., Horng, S., Fowler, J.W.: A multi-objective genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers and Operations Research 30, 1087–1102 (2003)
Coello, C.A.C., Pulido, G.T., Lechuga, M.S.: Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation 8(3), 256–279 (2004)
Deb, K., Amrit Pratap, S.A., Meyarivan, T.: A fast and elitist multi-objective genetic algorithm-NSGA II. In: Proceedings of the Parallel Problem Solving from Nature VI Conference, pp. 849–858 (2000)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)
Hsieh, J.C.: Development of grid-partitioned objective space algorithm for flowshop scheduling with multiple objectives. In: Proceedings of the the 6th Asia Pacific Industrial Engineering and Management Systems Conference (2005)
Hsieh, J.C., Chang, P.C., Hsu, L.C.: Scheduling of drilling operations in printed circuit board factory. Computers and Industrial Engineering 44(3), 461–473 (2003)
Knowles, J.D., Corne, D.W.: On metrics for comparing non dominated sets. In: Proceedings of the 2002 congress on evolutionary computation conference (CEC 2002), pp. 711–716. IEEE Press, New York (2002)
Lis, J., Eiben, A.E.: A multisexual Genetic Algorithm for multicriteria optimization. In: Proceedings of the 4th IEEE Conference on Evolutionary Computation, pp. 59–64 (1997)
Murata, T., Ishibuchi, H.: MOGA: Multi-objective genetic algorithm. In: Proceedings of the Second IEEE International Conference on Evolutionary Computation, pp. 170–175 (1996)
Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithm for flowshop scheduling problem. Computers and Industrial Engineering 30, 1061–1071 (1996)
Mostaghim, S., Teich, J.: Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization. Evolutionary Computation 2, 1404–1411 (2004)
Neppali, V.R., Chen, C.L., Gupta, J.N.D.: Genetic algorithms for the two-stage bicriteria flowshop problem. European Journal of Operational Research 95, 356–373 (1996)
Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of First International Conference on Genetic Algorithms, pp. 93–100 (1985)
Sridhar, J., Rajendran, C.: Scheduling in flowshop and cellular manufacturing systems with multiple objectives – a genetic algorithm approach. Production Planning and Control 7, 374–382 (1996)
Srinivas, M., Patnaik, L.M.: Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms. IEEE Transactions on Systems, Man and Cybernetics 24(4), 656–667 (1994)
Zhu, K.Q., Liu, Z.: Population diversity in permutation-based genetic algorithm. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 537–547. Springer, Heidelberg (2004)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA 2: improving the strength Pareto evolutionary algorithm for multiobjective optimization, Evolutionary Methods for Design, Optimisation and Control. In: Giannakoglou, K., Tsahalis, D., Periaux, J., Papailiou, K., Fogarty, T. (eds.) CIMNE, Barcelona, Spain, pp. 1–6 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, PC., Chen, SH., Hsieh, JC. (2006). A Global Archive Sub-Population Genetic Algorithm with Adaptive Strategy in Multi-objective Parallel-Machine Scheduling Problem. In: Jiao, L., Wang, L., Gao, Xb., Liu, J., Wu, F. (eds) Advances in Natural Computation. ICNC 2006. Lecture Notes in Computer Science, vol 4221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881070_98
Download citation
DOI: https://doi.org/10.1007/11881070_98
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45901-9
Online ISBN: 978-3-540-45902-6
eBook Packages: Computer ScienceComputer Science (R0)