Differential evolution - an easy and efficient evolutionary algorithm for model optimisation

被引:125
作者
Mayer, DG
Kinghorn, BP
Archer, AA
机构
[1] Agcy Food & Fibre Sci, Dept Primary Ind & Fisheries, Anim Res Inst, Yeerongpilly, Qld 4105, Australia
[2] Univ New England, Sygen Chair Genet Informat Syst, Armidale, NSW 2351, Australia
[3] Univ New England, Cooperat Res Ctr Cattle & Beeg Qual, Armidale, NSW 2351, Australia
关键词
differential evolution; optimisation; genetic algorithm; FORTRAN; beef model;
D O I
10.1016/j.agsy.2004.05.002
中图分类号
S [农业科学];
学科分类号
09 ;
摘要
Recently, evolutionary algorithms (encompassing genetic algorithms, evolution strategies, and genetic programming) have proven to be the best general method for the optimisation of large, difficult problems, including agricultural models. Differential evolution (DE) is one comparatively simple variant of an evolutionary algorithm. DE has only three or four operational parameters, and can be coded in about 20 lines of pseudo-code. Investigations of its performance in the optimisation of a challenging beef property model with 70 interacting management options (hence a 70-dimensional optimisation problem), indicate that DE performs better than Genial (a real-value genetic algorithm), which has been the preferred operational package thus far. Despite DE's apparent simplicity, the interacting key evolutionary operators of mutation. and recombination are present and effective. In particular, DE has the advantage of incorporating a relatively simple and efficient form of self-adapting mutation. This is one of the main advantages found in evolution strategies, but these methods usually require the burdening overhead of doubling the dimensionality of the search-space to achieve this. DE's processes are illustrated, and model optimisations totaling over two years of Sun workstation computation are presented. These results show that the baseline DE parameters work effectively, but can be improved in two ways. Firstly, the population size does not need to be overly high, and smaller populations can be considerably more efficient; and second, the periodic application of extrapolative mutation may be effective in counteracting the contractive nature of DE's intermediate arithmetic recombination in the latter stages of the optimisations. This provides an escape mechanism to prevent sub-optimal convergence. With its ease of implementation and proven efficiency, DE is ideally suited to both novice and experienced users wishing to optimise their simulation models. Crown Copyright (C) 2004 Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:315 / 328
页数:14
相关论文
共 22 条
[11]   Survival of the fittest - genetic algorithms versus evolution strategies in the optimization of systems models [J].
Mayer, DG ;
Belward, JA ;
Widell, H ;
Burrage, K .
AGRICULTURAL SYSTEMS, 1999, 60 (02) :113-122
[12]   Robust parameter settings of evolutionary algorithms for the optimisation of agricultural systems models [J].
Mayer, DG ;
Belward, JA ;
Burrage, K .
AGRICULTURAL SYSTEMS, 2001, 69 (03) :199-213
[13]   Tabu search not an optimal choice for models of agricultural systems [J].
Mayer, DG ;
Belward, JA ;
Burrage, K .
AGRICULTURAL SYSTEMS, 1998, 58 (02) :243-251
[14]  
MAYER DG, 2002, EVOLUTIIONARY ALGORI
[15]   A SIMPLEX-METHOD FOR FUNCTION MINIMIZATION [J].
NELDER, JA ;
MEAD, R .
COMPUTER JOURNAL, 1965, 7 (04) :308-313
[16]  
ORourke PK, 1992, N AUSTR BEEF PRODUCE
[17]  
PRICE K, 1997, DR DOBBS J APR, P18
[18]  
Price K., 1999, New ideas in optimization, P79
[19]  
Robinson J.M., 1985, ELECT ORACLE
[20]   Differential evolution - A simple and efficient heuristic for global optimization over continuous spaces [J].
Storn, R ;
Price, K .
JOURNAL OF GLOBAL OPTIMIZATION, 1997, 11 (04) :341-359