TY - JOUR
T1 - An orthogonal genetic algorithm with quantization for global numerical optimization
AU - Wang, Yuping
AU - Leung, Yiu-Wing
N1 - Funding Information:
Manuscript received December 22, 1998; revised October 15, 1999 and April 10, 2000. This work was supported by the HKBU Faculty Research Grant FRG/97-98/II-08. Y.-W. Leung is with the Department of Computer Science, Hong Kong Baptist University, Kowloon Tong, Hong Kong (e-mail: [email protected]). Y. Wang is with the Department of Applied Mathematics, Xidian University, Xi’an 710071, R.O.C. Publisher Item Identifier S 1089-778X(01)00999-7.
PY - 2001/2
Y1 - 2001/2
N2 - We design a genetic algorithm called the orthogonal genetic algorithm with quantization for global numerical optimization with continuous variables. Our objective is to apply methods of experimental design to enhance the genetic algorithm, so that the resulting algorithm can be more robust and statistically sound. A quantization technique is proposed to complement an experimental design method called orthogonal design. We apply the resulting methodology to generate an initial population of points that are scattered uniformly over the feasible solution space, so that the algorithm can evenly scan the feasible solution space once to locate good points for further exploration in subsequent iterations. In addition, we apply the quantization technique and orthogonal design to tailor a new crossover operator, such that this crossover operator can generate a small, but representative sample of points as the potential offspring. We execute the proposed algorithm to solve 15 benchmark problems with 30 or 100 dimensions and very large numbers of local minima. The results show that the proposed algorithm can find optimal or close-to-optimal solutions.
AB - We design a genetic algorithm called the orthogonal genetic algorithm with quantization for global numerical optimization with continuous variables. Our objective is to apply methods of experimental design to enhance the genetic algorithm, so that the resulting algorithm can be more robust and statistically sound. A quantization technique is proposed to complement an experimental design method called orthogonal design. We apply the resulting methodology to generate an initial population of points that are scattered uniformly over the feasible solution space, so that the algorithm can evenly scan the feasible solution space once to locate good points for further exploration in subsequent iterations. In addition, we apply the quantization technique and orthogonal design to tailor a new crossover operator, such that this crossover operator can generate a small, but representative sample of points as the potential offspring. We execute the proposed algorithm to solve 15 benchmark problems with 30 or 100 dimensions and very large numbers of local minima. The results show that the proposed algorithm can find optimal or close-to-optimal solutions.
UR - http://www.scopus.com/inward/record.url?scp=0035247566&partnerID=8YFLogxK
U2 - 10.1109/4235.910464
DO - 10.1109/4235.910464
M3 - Journal article
AN - SCOPUS:0035247566
SN - 1089-778X
VL - 5
SP - 41
EP - 53
JO - IEEE Transactions on Evolutionary Computation
JF - IEEE Transactions on Evolutionary Computation
IS - 1
ER -