Abstract
Since the pioneer work of Evolution Strategies, experiment-based optimization is one of the promising applications of evolutionary computation. Recent progress in automatic control and instrumentation provides a smart environment called Hardware In the Loop Simulation (HILS) for such application. However, since optimization through experiment has severe condition of limited evaluation time and fluctuation of observation, we have to develop methodologies that overcome these problems. This paper discusses application of Multi-Objective Evolutionary Algorithms (MOEAs) to experiment-based optimization of control parameters of dynamical systems. In such applications, we have to apply various parameter candidates spreading near the Pareto frontier to the system, and it causes fluctuation of the observed criteria due to the transient response by parameter switching. For reduction of loss time caused by such transient response in evaluation of criteria, we propose techniques called Evaluation Order Scheduling and Evaluation Time Scheduling. Numerical experiments using a formal test problem and experiment in a HILS environment for real internal-combustion engines have demonstrated the effectiveness of the proposed methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bäck, T.: Evolutionary Algorithms in Theory and Practice, Oxford (1996)
Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6(2), 182–197 (2002)
Dvorak, T., Malone, L., Hoekstra, R.: Statistical Process Control and Design of Experiment Process Improvement Methods for the Powertrain Laboratory, SAE paper 2003-01-3208 (2003)
Eshelman, L., Schaffer, J.: Real-Coded Genetic Algorithms and Interval-Schemata. In: Foundations of Genetic Algorithms 2, pp. 187–202 (1993)
Eshelman, L., Mathias, K., Schaffer, J.: Crossover Operator Biases: Exploiting the Population Distribution. In: Proc. of ICGA97, pp. 354–361 (1997)
Hiroyasu, T., Miki, M., Watanabe, S.: Divided Range Genetic Algorithms in Multiobjective Optimization Problems. In: Proc. of IWES’99, pp. 57–65 (1999)
Ikeda, K., Kita, H., Kobayashi, S.: Failure of Pareto-based MOEAs, Does Non-dominated Really Mean Near to Optimal? In: Proc. of CEC2001, pp. 957–962 (2001)
Kaji, H.: Proposal of a Multi-objective Genetic Algorithm for Noisy Fitness Functions (in Japanese). Trans. of ISCIE 18(12), 423–432 (2005)
Kaji, H., Kita, H.: A Crossover Method of Genetic Algorithms for Periodic Function Optimization (in Japanese). In: Proc. of the 32th SICE Symposium on Intelligent Systems, pp. 157–162 (2005)
Myers, R., Montgomery, D.: Response Surface Methodology, 2nd edn. Wiley, Chichester (2002)
Ono, I., Kobayashi, S.: A Real-coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover. In: Proc. of the 7th ICGA, pp. 246–253 (1997)
Rechenberg, I.: Evolution Strategy. In: Computational Intelligence Imitating Life, pp. 147–159. IEEE Computer Society Press, Los Alamitos (1995)
Sano, Y., Kita, H.: Optimization of Noisy Fitness Functions by Means of Genetic Algorithms Using History of Search with Test of Estimation. In: Proc. of CEC2002, pp. 360–365 (2002)
Schwefel, H.-P.: Evolution and Optimum Seeking. John Wiley & Sons, Chichester (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kaji, H., Kita, H. (2007). Individual Evaluation Scheduling for Experiment-Based Evolutionary Multi-objective Optimization. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds) Evolutionary Multi-Criterion Optimization. EMO 2007. Lecture Notes in Computer Science, vol 4403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70928-2_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-70928-2_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70927-5
Online ISBN: 978-3-540-70928-2
eBook Packages: Computer ScienceComputer Science (R0)