A Global Archive Sub-Population Genetic Algorithm with Adaptive Strategy in Multi-objective Parallel-Machine Scheduling Problem

  • Pei-Chann Chang
  • Shih-Hsin Chen
  • Jih-Chang Hsieh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4221)


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.


Genetic Algorithm Schedule Problem Multiobjective Optimization Adaptive Strategy Parallel Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Affenzeller, M.: New Generic Hybrids Based Upon Genetic Algorithms, Institute of Systems, Science Systems Theory and Information Technology. Johannes Kepler University (2001)Google Scholar
  2. 2.
    Brucker, P.: Scheduling Algorithm. Springer, Berlin (1998)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)MATHGoogle Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Murata, T., Ishibuchi, H.: MOGA: Multi-objective genetic algorithm. In: Proceedings of the Second IEEE International Conference on Evolutionary Computation, pp. 170–175 (1996)Google Scholar
  14. 14.
    Murata, T., Ishibuchi, H., Tanaka, H.: Genetic algorithm for flowshop scheduling problem. Computers and Industrial Engineering 30, 1061–1071 (1996)CrossRefGoogle Scholar
  15. 15.
    Mostaghim, S., Teich, J.: Covering Pareto-optimal fronts by subswarms in multi-objective particle swarm optimization. Evolutionary Computation 2, 1404–1411 (2004)Google Scholar
  16. 16.
    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)CrossRefGoogle Scholar
  17. 17.
    Schaffer, J.D.: Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of First International Conference on Genetic Algorithms, pp. 93–100 (1985)Google Scholar
  18. 18.
    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)CrossRefGoogle Scholar
  19. 19.
    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)CrossRefGoogle Scholar
  20. 20.
    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)CrossRefGoogle Scholar
  21. 21.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Pei-Chann Chang
    • 1
  • Shih-Hsin Chen
    • 1
  • Jih-Chang Hsieh
    • 2
  1. 1.Department of Industrial Engineering and ManagementYuan-Ze UniversityNe-Li, Tao-YuanChina
  2. 2.Department of FinanceVanung UniversityTao-YuanChina

Personalised recommendations