Genetic algorithms with dynamic mutation rates and their industrial applications

International Journal of Computational Intelligence and Applications

Volumn 7, Issue 2, 2008, Pages 103-128

  Chan, K Y ^a   Fogarty, T C ^b   Aydin, M Emin ^c   Ling, S H ^d   Iu, H H C ^d  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b LONDON SOUTH BANK UNIVERSITY   (United Kingdom)

^c UNIVERSITY OF BEDFORDSHIRE   (United Kingdom)

^d UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

Dynamic mutation rate; Evolutionary algorithms; Genetic algorithms

Indexed keywords

ALGORITHMS; APPLICATIONS; FACILITIES; GENES; GENETIC ALGORITHMS; INDUSTRIAL APPLICATIONS; POWER ELECTRONICS;

DYNAMIC MUTATION RATE; EXISTING METHODS; FACILITY LOCATION PROBLEMS; GENE REPRESENTATIONS; MAIN EFFECTS; MUTATION RATES; NEW APPROACHES; OPTIMAL POWER FLOW PROBLEMS; SOLUTION QUALITIES; SOLUTION STABILITIES; TEST FUNCTIONS;

EVOLUTIONARY ALGORITHMS;

EID: 59149099374     PISSN: 14690268     EISSN: None     Source Type: Journal    
DOI: 10.1142/S1469026808002211     Document Type: Article

References (38)

1. C. Reeves, Genetic algorithms for operations researcher, INFORMS J. Comput. 9(3) (1997) 231-250.
2. M. E. Aydin and T. C. Fogarty, A distributed evolutionary simulated annealing for combinatorial optimisation problems, J. Heuristics 10(3) (2004) 269-292.
3. S. Chatterjee, C. Carrera and L. A. Lynch, Genetic algorithms and travelling salesman problems, Eur. J. Oper. Res. 93 (1995) 490-510.
4. P. C. Chu and J. E. Beasley, A genetic algorithm for the generalised assignment problem, Comput. Oper. Res. 24(1) (1997) 17-23.
5. J. Kratica, D. Tosic, V. Filipovic and I. Ljubic, Solving the simple plant location problem by genetic algorithm, RAIRO Oper. Res. 35 (2001) 127-142.
6. C. K. Y. Lin, K. B. Haley and C. Sparks, A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems, Eur. J. Oper. Res. 83 (1995) 330-346.
7. A. J. Ruiz-Torres, E. E. Enscore and R. R. Barton, Simulated annealing heuristics for the average flow-time and the number of Tardy jobs bi-criteria identical parallel machine problem, Comput. Indust. Eng. 33(1-2) (1997) 257-260.
8. J. M. Wilson, A genetic algorithm for the generalised assignment problem, J. Oper. Res. Soc. 48 (1997) 804-809.
9. R. J. M. Vaessens, E. H. L. Aarts and J. K. Lenstra, A local search template, in Proc. Parallel Problem-Solving from Nature (1992), pp. 65-74.
10. C. R. Reeves, Genetic algorithms and neighbourhood search, Evol. Comput.: AISB Workshop (1994), pp. 115-130.
11. T. Back and M. Schutz, Intelligent mutation rate control in canonical genetic algorithms, Found. Intell. Syst. (1996), pp. 158-167.
12. T. C. Fogarty, Varying the probability of mutation in the genetic algorithm, in Proc. 3rd Int. Conf. Genetic Algorithms (1989), pp. 104-109.
13. J. Hesser and R. Manner, Toward an optimal mutation probability for genetic algorithms, in Proc. 1st Conf. Parallel Problem Solving from Nature (1991), pp. 23-32.
14. M. Srinivas and L. M. Patnaik, Adaptive probabilities of crossover and mutation in genetic algorithms, IEEE Trans. Syst. Man Cybernet. 24 (4) (1994) 17-26.
15. D. Thierens, Adaptive mutation rate control schemes in genetic algorithms, in Proc. IEEE Congr. Evolutionary Computation 1 (2002), 980-985.
16. T. Back, Optimal mutation rates in genetic search, in Proc. 5th Int. Conf. Genetic Algorithms (1993), pp. 2-8.
17. T. Back, The interaction of mutation rate, select, and self-adaptation within a genetic algorithm, in Proc. 2nd Conf. Parallel Problem Solving from Nature (1992), pp. 85-94.
18. M. Sewell, J. Samarabandu, R. Rodrigo and K. McIassc, The rank-scaled mutation rate for genetic algorithms, Int. J. Inform. Tech. 3 1) (2006) 32-36.
19. D. C. Montgomery, Design and Analysis of Experiments (John Wiley and Sons, Inc., New York, 1997).
20. J. Carpentier, Optimal power flows, Int. J. Electrical Power Energy Syst. 1 (1979) 3-15.
21. K. Deb and H. G. Beyer, Self-adaptation in real-parameter genetic algorithms with simulated binary crossover, in Proc. Genetic and Evolutionary Computation Conf. 1 (1999) 172-179.
22. J. E. Beasley and P. C. Chu, A genetic algorithm for the set covering problem, Eur. J. Oper. Res. 94 (1994) 392-404.
23. J. E. Beasley, Obtaining test problems via internet, J. Global Optim. 8 (1996) 429-433, http://mscmga.ms.ic.ac.uk/info.html.
24. K. Y. Chan, Experimental design methods in evolutionary algorithms, Ph.D. thesis, London South Bank University (2006).
25. D. Whitley, K. Mathias, S. Rana and J. Dzubera, Building better test function, in Proc. 6th Int. Conf. Genetic Algorithms (1995), pp. 239-246.
26. A. J. Chipperfield and P. J. Fleming, The MATLAB genetic algorithm toolbox, in Proc. IEE Colloquium on Applied Control Techniques using MATLAB (1995), pp. 10/1-10/4.
27. A. J. Chipperfield, P. J. Fleming and C. M. Fonseca, Genetic algorithm tools for control systems engineering, in Proc. Adaptive Computing in Engineering Design and Control (1994), pp. 128-133.
28. H. Muhlenbein and D. S. Voosen, Predictive models for the breeder genetic algorithm: I. Continuous parameter optimization, Evol. Comput. 1(1) (1993) 25-49.
29. J. E. Baker, Adaptive selection methods for genetic algorithms, in Proc. First Int. Conf. Genetic Algorithms (1985), pp 101-111.
30. M. S. Daskin, Network and Discrete Location: Models, Algorithms, and Applications (Wiley, New York, 1995).
31. A. Bumb, An approximation algorithm for the maximum version of the two level uncapacitated facility location problem, Oper. Res. Lett. 29 (2001) 155-161.
32. C. Canel and B. M. Khumawala, Multi-period international facilities location: An algorithm and application, Int. J. Prod. Res. 35 7) (1997) 1891-1990.
33. E. Gourdin, M. Labbe and G. Laporte, The uncapacitated facility location problem with client matching, Oper. Res. 48(5) (2000) 671-685.
34. H. W. Hamacher, M. Labb, S. Nickel and T. Sonneborn, Adapting polyhedral properties from facility to hub location problems, Discrete Appl. Math. 145 (2004) 104-116.
35. N. Mo, G. T. Y. Pong, K. W. Chan and S. W. Mei, Multi-contingency transient stability constrained optimal power flow by genetic algorithm, in Proc. 7th Int. Conf. Advances in Power System Control, Operation and Management (2006).
36. P. M. Anderson and A. A. Fouad, Power System Control and Stability Vol. I (Iowa State University Press, IEEE Press, New York, 1977), pp. 36-45.
37. R. Zimmerman and D. Gan, MATPOWER A Matlab Power System Simulation Package (2005).
38. T. B. Nguyen and M. A. Pai, A new approach to dynamic security assessment using trajectory sensitivities, IEEE Trans. Power Syst. 18(2) (1998) 848-854.