Calibrating continuous multi-objective heuristics using mixture experiments

被引:0
作者
José Antonio Vázquez-Rodríguez
Sanja Petrovic
机构
[1] University of Nottingham,Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science
来源
Journal of Heuristics | 2012年 / 18卷
关键词
Design of experiments; Mixture experiments; Parameter tuning; Multi-objective optimization; Heuristics;
D O I
暂无
中图分类号
学科分类号
摘要
A genetic algorithm heuristic that uses multiple rank indicators taken from a number of well established evolutionary algorithms including NSGA-II, IBEA and SPEA2 is developed. It is named Multi-Indicator GA (MIGA). At every iteration, MIGA uses one among the available indicators to select the individuals which will participate as parents in the next iteration. MIGA chooses the indicators according to predefined probabilities found through the analysis of mixture experiments. Mixture experiments are a particular type of experimental design suitable for the calibration of parameters that represent probabilities. Their main output is an explanatory model of algorithm performance as a function of its parameters. By finding the point that provides the maximum we also find good algorithm parameters. To the best of our knowledge, this is the first paper where mixture experiments are used for heuristic tuning. The design of mixture experiments approach allowed the authors to identify and exploit synergy between the different rank indicators. This is demonstrated by our experimental results in which the tuned MIGA compares favorably to other well established algorithms, an uncalibrated multi-indicator algorithm, and a multi-indicator algorithm calibrated using a more conventional approach.
引用
收藏
页码:699 / 726
页数:27
相关论文
共 39 条
  • [1] Adenso-Díaz B.(2006)Fine-tuning of algorithms using fractional experimental designs and local search Oper. Res. 54 99-114
  • [2] Laguna M.(2007)An estimation of distribution algorithm for nurse scheduling Ann. Oper. Res. 155 289-309
  • [3] Aickelin U.(2008)Heuristic, meta-heuristic and hyper-heuristic approaches for fresh produce inventory control and shelf space allocation J. Oper. Res. Soc. 59 1387-1397
  • [4] Li J.(2007)A graph-based hyper-heuristic for educational timetabling problems Eur. J. Oper. Res. 176 177-192
  • [5] Bai R.(1995)Algorithm AS 299: generation of simplex lattice points Appl. Stat. 44 534-545
  • [6] Burke E.K.(2001)Using experimental design to find effective parameter settings for heuristics J. Heuristics 7 77-97
  • [7] Kendall G.(1995)Real-coded genetic algorithms with simulated binary crossover: studies on multi-modal and multi-objective problems Complex Syst. 9 431-454
  • [8] Burke E.K.(2002)A fast and elitist multiobjective genetic algorithm: NSGA–II IEEE Trans. Evol. Comput. 6 182-197
  • [9] McCollum B.(2009)ParamILS: an automatic algorithm configuration framework J. Artif. Intell. Res. 36 267-306
  • [10] Meisels A.(2009)Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II IEEE Trans. Evol. Comput. 12 284-302