Parameter Optimization in Genetic Algorithm and Its Impact on Scheduling Solutions

  • T. Amudha
  • B. L. Shivakumar
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 31)


Parameter optimization is an ever fresh and less explored research area, which has ample scope for research investigation and to propose novel findings and interpretations. Identification of good parameter values is a highly challenging task which involves tedious and ad hoc course of actions with several heuristic choices. The complexity involved in parameter tweaking is primarily due to the unpredictable and heavily randomized nature of evolutionary algorithmic procedures. In this paper, an attempt was made to tweak the parameters and decision variables of Genetic Algorithm. GA with tweaked parameters was hybridized with Bacterial Foraging Algorithm, and applied to the Job shop and Permutation Flow Shop scheduling problem benchmarks. The results have proven that optimized parameter set tuning has obtained better scheduling performance.


Bacterial foraging Genetic algorithm Parameter optimization Job shop scheduling 


  1. 1.
    Nannen, V., Eiben, A.E.: Relevance estimation and value calibration of evolutionary algorithm parameters. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 975–980 (2007)Google Scholar
  2. 2.
    Eiben, E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE Trans. Evol. Comput. 3(2), 124–141 (1999)CrossRefGoogle Scholar
  3. 3.
    Nannen, V., Eiben, A.E.: A method for parameter calibration and relevance estimation in evolutionary algorithms. In: Keijzer, M. et al. (eds.) GECCO 2006: Genetic and Evolutionary Computation Conference, pp. 183–190. ACM, New York (2006)Google Scholar
  4. 4.
    Reis, C., Paiva, L., Moutinho, J., Marques, V.M.: Genetic algorithms and sensitivity analysis in production planning optimization. New aspects of applied informatics, biomedical electronics and informatics and communications (2010)Google Scholar
  5. 5.
    Grefenstette, J.: Optimization of control parameters for genetic algorithms. IEEE Trans. Syst. Man Cybern. 16(1), 122–128 (1986)CrossRefGoogle Scholar
  6. 6.
    Kahraman, C., Engin, O., Kaya, I., Yilmaz, M.K.: An application of effective genetic algorithms for solving hybrid flow shop scheduling problems. Int. J. Comput. Intell. Syst. 1(2), 134–147 (2008)CrossRefGoogle Scholar
  7. 7.
    Kim, D.H., Abraham, A., Cho, J.H.: A hybrid genetic algorithm and bacterial foraging approach for global optimization. Inf. Sci. 177(18), 3918–3937 (2007)Google Scholar
  8. 8.
    Passino, K.M.: Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst. Mag. 22(3), 52–67 (2002)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Beasley, J.E.: Online document cited at (2010)
  10. 10.
  11. 11.
    Taillard, E.: Benchmarks for basic scheduling problems (1989)Google Scholar
  12. 12.
    Gen, M., Cheng, R.: Genetic Algorithms and Engineering Optimization. Wiley, New York (2000)Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Department of Computer ApplicationsBharathiar UniversityCoimbatoreIndia
  2. 2.Sri Ramakrishna Engineering CollegeCoimbatoreIndia

Personalised recommendations