Simultaneously Applying Multiple Mutation Operators in Genetic Algorithms

  • Authors:

  • Tzung-Pei Hong;Hong-Shung Wang;Wei-Chou Chen

  • Affiliations:

  • Department of Information Management, I-Shou University, Kaohsiung County, 84008, Taiwan, ROC. tphong@isu.edu.tw;Institute of Electrical Engineering, Chung-Hua University, Hsin-Chu, 30067, Taiwan, ROC. jammy98@ms15.hinet.ne;Institute of Information Engineering, I-Shou University, Kaohsiung County, 84008, Taiwan, ROC. m863201m@csa500.isu.edu.tw

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The mutation operation is critical to the success of genetic algorithms since it diversifies the search directions and avoids convergence to local optima. The earliest genetic algorithms use only one mutation operator in producing the next generation. Each problem, even each stage of the genetic process in a single problem, may require appropriately different mutation operators for best results. Determining which mutation operators should be used is quite difficult and is usually learned through experience or by trial-and-error. This paper proposes a new genetic algorithm, the dynamic mutation genetic algorithm, to resolve these difficulties. The dynamic mutation genetic algorithm simultaneously uses several mutation operators in producing the next generation. The mutation ratio of each operator changes according to evaluation results from the respective offspring it produces. Thus, the appropriate mutation operators can be expected to have increasingly greater effects on the genetic process. Experiments are reported that show the proposed algorithm performs better than most genetic algorithms with single mutation operators.