Timo Aittokoski
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Timo Aittokoski has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Kaisa Miettinen
University of Jyväskylä, Faculty of Information Technology, Finland
3 shared publications Sami Äyrämö
University of Jyväskylä
1 shared publication- Suvi Tarkkanen
Dept. of Mathematical Information Technology University of Jyväskylä Agora) FI-40014 P.O. Box 35 Finland
1 shared publication - Tuomas Airaksinen
University of Jyväskylä
1 shared publication
Latest Publications
- 1 January 2013
- Published by Springer Nature
- p. 321-334
Multi-Objective Actuator Placement Optimization for Local Sound Control Evaluated in a Stochastic Domain
- 1 January 2013
- Published by Springer Nature
- p. 321-334
Multi-Objective Actuator Placement Optimization for Local Sound Control Evaluated in a Stochastic Domain
- Open Access
User preference extraction using dynamic query sliders in conjunction with UPS-EMO algorithm
One drawback of evolutionary multiobjective optimization algorithms (EMOA) has traditionally been high computational cost to create an approximation of the Pareto front: number of required objective function evaluations usually grows high. On the other hand, for the decision maker (DM) it may be difficult to select one of the many produced solutions as the final one, especially in the case of more than two objectives. To overcome the above mentioned drawbacks number of EMOA's incorporating the decision makers preference information have been proposed. In this case, it is possible to save objective function evaluations by generating only the part of the front the DM is interested in, thus also narrowing down the pool of possible selections for the final solution. Unfortunately, most of the current EMO approaches utilizing preferences are not very intuitive to use, i.e. they may require tweaking of unintuitive parameters, and it is not always clear what kind of results one can get with given set of parameters. In this study we propose a new approach to visually inspect produced solutions, and to extract preference information from the DM to further guide the search. Our approach is based on intuitive use of dynamic query sliders, which serve as a means to extract preference information and are part of the graphical user interface implemented for the efficient UPS-EMO algorithm.
Open AccessUser preference extraction using dynamic query sliders in conjunction with UPS-EMO algorithm
One drawback of evolutionary multiobjective optimization algorithms (EMOA) has traditionally been high computational cost to create an approximation of the Pareto front: number of required objective function evaluations usually grows high. On the other hand, for the decision maker (DM) it may be difficult to select one of the many produced solutions as the final one, especially in the case of more than two objectives. To overcome the above mentioned drawbacks number of EMOA's incorporating the decision makers preference information have been proposed. In this case, it is possible to save objective function evaluations by generating only the part of the front the DM is interested in, thus also narrowing down the pool of possible selections for the final solution. Unfortunately, most of the current EMO approaches utilizing preferences are not very intuitive to use, i.e. they may require tweaking of unintuitive parameters, and it is not always clear what kind of results one can get with given set of parameters. In this study we propose a new approach to visually inspect produced solutions, and to extract preference information from the DM to further guide the search. Our approach is based on intuitive use of dynamic query sliders, which serve as a means to extract preference information and are part of the graphical user interface implemented for the efficient UPS-EMO algorithm.
- 9 March 2010
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 25 (6) , 841-858
Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA
Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.
- 9 March 2010
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 25 (6) , 841-858
Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA
Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.
- 25 February 2009
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 24 (2) , 157-174
Clustering aided approach for decision making in computationally expensive multiobjective optimization
Typically, industrial optimization problems need to be solved in an efficient, multiobjective and global manner, because they are often computationally expensive (as function values are typically based on simulations), they may contain multiple conflicting objectives, and they may have several local optima. Solving such problems may be challenging and time consuming when the aim is to find the most preferred Pareto optimal solution. In this study, we propose a method where we use an advanced clustering technique to reveal essential characteristics of the approximation of the Pareto optimal set, which has been generated beforehand. Thus, the decision maker (DM) is involved only after the most time consuming computation is finished. After the initiation phase, a moderate number of cluster prototypes projected to the Pareto optimal set is presented to the DM to be studied. This allows him/her to rapidly gain an overall understanding of the main characteristics of the problem without placing too much cognitive load on the DM. Furthermore, we also suggest some ways of applying our approach to different types of problems and demonstrate it with an example related to internal combustion engine design.
- 25 February 2009
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 24 (2) , 157-174
Clustering aided approach for decision making in computationally expensive multiobjective optimization
Typically, industrial optimization problems need to be solved in an efficient, multiobjective and global manner, because they are often computationally expensive (as function values are typically based on simulations), they may contain multiple conflicting objectives, and they may have several local optima. Solving such problems may be challenging and time consuming when the aim is to find the most preferred Pareto optimal solution. In this study, we propose a method where we use an advanced clustering technique to reveal essential characteristics of the approximation of the Pareto optimal set, which has been generated beforehand. Thus, the decision maker (DM) is involved only after the most time consuming computation is finished. After the initiation phase, a moderate number of cluster prototypes projected to the Pareto optimal set is presented to the DM to be studied. This allows him/her to rapidly gain an overall understanding of the main characteristics of the problem without placing too much cognitive load on the DM. Furthermore, we also suggest some ways of applying our approach to different types of problems and demonstrate it with an example related to internal combustion engine design.
- 16 June 2008
- Published by Taylor & Francis in Engineering Optimization
- Vol. 40 (7) , 593-612
Cost effective simulation-based multiobjective optimization in the performance of an internal combustion engine
Solving real-life engineering problems can be difficult because they often have multiple conflicting objectives, the objective functions involved are highly nonlinear and they contain multiple local minima. Furthermore, function values are often produced via a time-consuming simulation process. These facts suggest the need for an automated optimization tool that is efficient (in terms of number of objective function evaluations) and capable of solving global and multiobjective optimization problems. In this article, the requirements on a general simulation-based optimization system are discussed and such a system is applied to optimize the performance of a two-stroke combustion engine. In the example of a simulation-based optimization problem, the dimensions and shape of the exhaust pipe of a two-stroke engine are altered, and values of three conflicting objective functions are optimized. These values are derived from power output characteristics of the engine. The optimization approach involves interactive multiobjective optimization and provides a convenient tool to balance between conflicting objectives and to find good solutions.
- 16 June 2008
- Published by Taylor & Francis in Engineering Optimization
- Vol. 40 (7) , 593-612
Cost effective simulation-based multiobjective optimization in the performance of an internal combustion engine
Solving real-life engineering problems can be difficult because they often have multiple conflicting objectives, the objective functions involved are highly nonlinear and they contain multiple local minima. Furthermore, function values are often produced via a time-consuming simulation process. These facts suggest the need for an automated optimization tool that is efficient (in terms of number of objective function evaluations) and capable of solving global and multiobjective optimization problems. In this article, the requirements on a general simulation-based optimization system are discussed and such a system is applied to optimize the performance of a two-stroke combustion engine. In the example of a simulation-based optimization problem, the dimensions and shape of the exhaust pipe of a two-stroke engine are altered, and values of three conflicting objective functions are optimized. These values are derived from power output characteristics of the engine. The optimization approach involves interactive multiobjective optimization and provides a convenient tool to balance between conflicting objectives and to find good solutions.