Abstract
The engine calibration procedure developed in Renault involves solving a constrained global optimization problem. This is a medium scale problem with a great number of linear and non linear constraints and containing a large number of local minima. Therefore, we use a strategy combining global and local optimization. We propose a new global stochastic optimization algorithm called Multistoch generating a fixed number of starting points for a local optimization procedure (see 2). These set of points are called a grid. This algorithm although different from simulated annealing (see 3) involves a gibbs measure. This measure is used to select a point in the grid. Around this selected point we generate a new candidate point which according to his value will modify the grid. After a description of the engine calibration problem some theorical and numerical results on the algorithm are presented.
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
Hafner, M., Isermann, R.: The use of stationary and dynamic emission models for an improved engine cycles. In: International Workshop on Modelling Emissions and Control in Automotive Engines, Salerno, Italy (09/2000)
Herskovits, J.N.: A feasible Directions Interior point Technique for Nonlinear Optimization. Journal of Optimization Theory and Applications 99(1), 121–146 (1998)
Locatelli, M.: Convergence of a simulated annealing for continuous global optimization. Journal of Global Optimization 18, 219–233 (2000)
Locatelli, M., Schoen, F.: Random Linkage: a family of acceptance/rejection algorithmsfor global optimization. Mathematical Programming 85(2), 379–396 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmied, A. (2003). A Global Constrained Optimization Algorithm for Engine Calibration. In: Bliek, C., Jermann, C., Neumaier, A. (eds) Global Optimization and Constraint Satisfaction. COCOS 2002. Lecture Notes in Computer Science, vol 2861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39901-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-39901-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20463-3
Online ISBN: 978-3-540-39901-8
eBook Packages: Springer Book Archive