No Access

GENETIC ALGORITHMS WITH DYNAMIC MUTATION RATES AND THEIR INDUSTRIAL APPLICATIONS

Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

Faculty of Business, Computing and Information Management, London South Bank University, 103 Borough Road, London SE1 0AA, United Kingdom

Search for more papers by this author

M. EMIN AYDIN

Department of Computing and Information Systems, University of Bedfordshire, Luton, Bedfordshire, United Kingdom

Search for more papers by this author

S. H. LING

School of Electrical, Electronic and Computer Engineering, The University of Western Australia, WA, Australia

Search for more papers by this author

, and

H. H. C. IU

School of Electrical, Electronic and Computer Engineering, The University of Western Australia, WA, Australia

Search for more papers by this author

https://doi.org/10.1142/S1469026808002211Cited by:4 (Source: Crossref)

Abstract

This paper presents a method on how to estimate main effects of gene representation. This estimate can be used not only to understand the domination of genes in the representation but also to design the mutation rate in genetic algorithms (GAs). A new approach of dynamic mutation rate is proposed by integrating the information of the main effects into the genes. By introducing the proposed method in GAs, both solution quality and solution stability can be improved in solving a set of parametrical test functions. The algorithm was applied to two illustrative applications to evaluate the performance of the proposed method, where the first application is on solving uncapacitated facility location problems and the next is on optimal power flow problems, which are employed. Results indicate that the proposed method yields significantly better results than the existing methods.

Keywords:

Remember to check out the Most Cited Articles!
Check out these titles in artificial intelligence!

References

C. Reeves, INFORMS J. Comput. 9(3), 231 (1997), DOI: 10.1287/ijoc.9.3.231. Crossref, Google Scholar
M. E. Aydin and T. C. Fogarty, J. Heuristics 10(3), 269 (2004), DOI: 10.1023/B:HEUR.0000026896.44360.f9. Crossref, Google Scholar
S. Chatterjee, C. Carrera and L. A. Lynch, Eur. J. Oper. Res. 93, 490 (1995), DOI: 10.1016/0377-2217(95)00077-1. Crossref, Google Scholar
P. C. Chu and J. E. Beasley, Comput. Oper. Res. 24(1), 17 (1997), DOI: 10.1016/S0305-0548(96)00032-9. Crossref, Google Scholar
J. Kraticaet al., RAIRO Oper. Res. 35, 127 (2001), DOI: 10.1051/ro:2001107. Crossref, Google Scholar
C. K. Y. Lin, K. B. Haley and C. Sparks, Eur. J. Oper. Res. 83, 330 (1995). Crossref, Google Scholar
A. J. Ruiz-Torres, E. E. Enscore and R. R. Barton, Comput. Indust. Eng. 33(1–2), 257 (1997), DOI: 10.1016/S0360-8352(97)00087-9. Crossref, Google Scholar
J. M. Wilson, J. Oper. Res. Soc. 48, 804 (1997), DOI: 10.1057/palgrave.jors.2600431. Crossref, Google Scholar
R. J. M. Vaessens, E. H. L. Aarts and J. K. Lenstra, A local search template, Proc. Parallel Problem-Solving from Nature (1992) pp. 65–74. Google Scholar
C. R. Reeves, Genetic algorithms and neighbourhood search, Evol. Comput.: AISB Workshop (1994) pp. 115–130. Google Scholar
T. Back and M. Schutz, Found. Intell. Syst. 158 (1996). Google Scholar
T. C. Fogarty, Varying the probability of mutation in the genetic algorithm, Proc. 3rd Int. Conf. Genetic Algorithms (1989) pp. 104–109. Google Scholar
J. Hesser and R. Manner, Toward an optimal mutation probability for genetic algorithms, Proc. 1st Conf. Parallel Problem Solving from Nature (1991) pp. 23–32. Google Scholar
M. Srinivas and L. M. Patnaik, IEEE Trans. Syst. Man Cybernet. 24(4), 17 (1994). Google Scholar
D. Thierens, Adaptive mutation rate control schemes in genetic algorithms, Proc. IEEE Congr. Evolutionary Computation1 (2002) pp. 980–985. Google Scholar
T. Back, Optimal mutation rates in genetic search, Proc. 5th Int. Conf. Genetic Algorithms (1993) pp. 2–8. Google Scholar
T. Back, The interaction of mutation rate, select, and self-adaptation within a genetic algorithm, Proc. 2nd Conf. Parallel Problem Solving from Nature (1992) pp. 85–94. Google Scholar
M. Sewellet al., Int. J. Inform. Tech. 3(1), 32 (2006). Google Scholar
D. C. Montgomery , Design and Analysis of Experiments ( John Wiley and Sons, Inc. , New York , 1997 ) . Google Scholar
J. Carpentier, Int. J. Electrical Power Energy Syst. 1, 3 (1979), DOI: 10.1016/0142-0615(79)90026-7. Crossref, Google Scholar
K. Deb and H. G. Beyer, Self-adaptation in real-parameter genetic algorithms with simulated binary crossover, Proc. Genetic and Evolutionary Computation Conf.1 (1999) pp. 172–179. Google Scholar
J. E. Beasley and P. C. Chu, Eur. J. Oper. Res. 94, 392 (1994), DOI: 10.1016/0377-2217(95)00159-X. Crossref, Google Scholar
J. E. Beasley, J. Global Optim. 8, 429 (1996), http://mscmga.ms.ic.ac.uk/info.html DOI: 10.1007/BF02404002. Crossref, Google Scholar
K. Y. Chan, Experimental design methods in evolutionary algorithms, Ph.D. thesis, London South Bank University (2006) . Google Scholar
D. Whitleyet al., Building better test function, Proc. 6th Int. Conf. Genetic Algorithms (1995) pp. 239–246. Google Scholar
A. J. Chipperfield and P. J. Fleming, The MATLAB genetic algorithm toolbox, Proc. IEE Colloquium on Applied Control Techniques using MATLAB (1995) pp. 10/1–10/4. Google Scholar
A. J. Chipperfield, P. J. Fleming and C. M. Fonseca, Genetic algorithm tools for control systems engineering, Proc. Adaptive Computing in Engineering Design and Control (1994) pp. 128–133. Google Scholar
H. Muhlenbein and D. S. Voosen, Evol. Comput. 1(1), 25 (1993), DOI: 10.1162/evco.1993.1.1.25. Crossref, Google Scholar
J. E. Baker, Adaptive selection methods for genetic algorithms, Proc. First Int. Conf. Genetic Algorithms (1985) pp. 101–111. Google Scholar
M. S. Daskin , Network and Discrete Location: Models, Algorithms, and Applications ( Wiley , New York , 1995 ) . Crossref, Google Scholar
A. Bumb, Oper. Res. Lett. 29, 155 (2001), DOI: 10.1016/S0167-6377(01)00087-6. Crossref, Google Scholar
C. Canel and B. M. Khumawala, Int. J. Prod. Res. 35(7), 1891 (1997). Crossref, Google Scholar
E. Gourdin, M. Labbe and G. Laporte, Oper. Res. 48(5), 671 (2000), DOI: 10.1287/opre.48.5.671.12410. Crossref, Google Scholar
H. W. Hamacheret al., Discrete Appl. Math. 145, 104 (2004), DOI: 10.1016/j.dam.2003.09.011. Crossref, Google Scholar
N. Mo et al. , Multi-contingency transient stability constrained optimal power flow by genetic algorithm , Proc. 7th Int. Conf. Advances in Power System Control, Operation and Management ( 2006 ) . Google Scholar
P. M. Anderson and A. A. Fouad, Power System Control and Stability I (Iowa State University Press, IEEE Press, New York, 1977) pp. 36–45. Google Scholar
R. Zimmerman and D. Gan, MATPOWER A Matlab Power System Simulation Package (2005) . Google Scholar
T. B. Nguyen and M. A. Pai, IEEE Trans. Power Syst. 18(2), 848 (1998), DOI: 10.1109/TPWRS.2003.811002. Crossref, Google Scholar