| 1. |
- Amouzgar, Kaveh, 1980-, et al.
(författare)
-
A framework for simulation-based multi-objective optimization and knowledge discovery of machining process
- 2018
-
Ingår i: The International Journal of Advanced Manufacturing Technology. - : Springer Science and Business Media LLC. - 0268-3768 .- 1433-3015. ; 98:9-12, s. 2469-2486
-
Tidskriftsartikel (refereegranskat)abstract
- The current study presents an effective framework for automated multi-objective optimization (MOO) of machining processes by using finite element (FE) simulations. The framework is demonstrated by optimizing a metal cutting process in turning AISI-1045, using an uncoated K10 tungsten carbide tool. The aim of the MOO is to minimize tool-chip interface temperature and tool wear depth, that are extracted from FE simulations, while maximizing the material removal rate. The effect of tool geometry parameters, i.e., clearance angle, rake angle, and cutting edge radius, and process parameters, i.e., cutting speed and feed rate on the objective functions are explored. Strength Pareto Evolutionary Algorithm (SPEA2) is adopted for the study. The framework integrates and connects several modules to completely automate the entire MOO process. The capability of performing the MOO in parallel is also enabled by adopting the framework. Basically, automation and parallel computing, accounts for the practicality of MOO by using FE simulations. The trade-off solutions obtained by MOO are presented. A knowledge discovery study is carried out on the trade-off solutions. The non-dominated solutions are analyzed using a recently proposed data mining technique to gain a deeper understanding of the turning process.
|
|
| 2. |
- Amouzgar, Kaveh
(författare)
-
Metamodel based multi-objective optimization
- 2015
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- As a result of the increase in accessibility of computational resources and the increase in the power of the computers during the last two decades, designers are able to create computer models to simulate the behavior of a complex products. To address global competitiveness, companies are forced to optimize their designs and products. Optimizing the design needs several runs of computationally expensive simulation models. Therefore, using metamodels as an efficient and sufficiently accurate approximate of the simulation model is necessary. Radial basis functions (RBF) is one of the several metamodeling methods that can be found in the literature.The established approach is to add a bias to RBF in order to obtain a robust performance. The a posteriori bias is considered to be unknown at the beginning and it is defined by imposing extra orthogonality constraints. In this thesis, a new approach in constructing RBF with the bias to be set a priori by using the normal equation is proposed. The performance of the suggested approach is compared to the classic RBF with a posteriori bias. Another comprehensive comparison study by including several modeling criteria, such as problem dimension, sampling technique and size of samples is conducted. The studies demonstrate that the suggested approach with a priori bias is in general as good as the performance of RBF with a posteriori bias. Using the a priori RBF, it is clear that the global response is modeled with the bias and that the details are captured with radial basis functions.Multi-objective optimization and the approaches used in solving such problems are briefly described in this thesis. One of the methods that proved to be efficient in solving multi-objective optimization problems (MOOP) is the strength Pareto evolutionary algorithm (SPEA2). Multi-objective optimization of a disc brake system of a heavy truck by using SPEA2 and RBF with a priori bias is performed. As a result, the possibility to reduce the weight of the system without extensive compromise in other objectives is found.Multi-objective optimization of material model parameters of an adhesive layer with the aim of improving the results of a previous study is implemented. The result of the original study is improved and a clear insight into the nature of the problem is revealed.
|
|
| 3. |
- Amouzgar, Kaveh, 1980-, et al.
(författare)
-
Metamodel based multi-objective optimization of a turning process by using finite element simulation
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- This study investigates the advantages and potentials of the metamodelbased multi-objective optimization (MOO) of a turning operation through the application of finite element simulations and evolutionary algorithms to a metal cutting process. The objectives are minimizing the interface temperature and tool wear depth obtained from FE simulations using DEFORM2D software, and maximizing the material removal rate. Tool geometry and process parameters are considered as the input variables. Seven metamodelling methods are employed and evaluated, based on accuracy and suitability. Radial basis functions with a priori bias and Kriging are chosen to model tool–chip interface temperature and tool wear depth, respectively. The non-dominated solutions are found using the strength Pareto evolutionary algorithm SPEA2 and compared with the non-dominated front obtained from pure simulation-based MOO. The metamodel-based MOO method is not only advantageous in terms of reducing the computational time by 70%, but is also able to discover 31 new non-dominated solutions over simulation-based MOO.
|
|
| 4. |
- Amouzgar, Kaveh, 1980-, et al.
(författare)
-
Metamodel based multi-objective optimization of a turning process by using finite element simulation
- 2020
-
Ingår i: Engineering optimization (Print). - : Taylor & Francis Group. - 0305-215X .- 1029-0273. ; 52:7, s. 1261-1278
-
Tidskriftsartikel (refereegranskat)abstract
- This study investigates the advantages and potentials of the metamodelbased multi-objective optimization (MOO) of a turning operation through the application of finite element simulations and evolutionary algorithms to a metal cutting process. The objectives are minimizing the interface temperature and tool wear depth obtained from FE simulations using DEFORM2D software, and maximizing the material removal rate. Tool geometry and process parameters are considered as the input variables. Seven metamodelling methods are employed and evaluated, based on accuracy and suitability. Radial basis functions with a priori bias and Kriging are chosen to model tool–chip interface temperature and tool wear depth, respectively. The non-dominated solutions are found using the strength Pareto evolutionary algorithm SPEA2 and compared with the non-dominated front obtained from pure simulation-based MOO. The metamodel-based MOO method is not only advantageous in terms of reducing the computational time by 70%, but is also able to discover 31 new non-dominated solutions over simulation-based MOO.
|
|
| 5. |
- Amouzgar, Kaveh, 1980-, et al.
(författare)
-
Radial basis functions with a priori bias as surrogate models : A comparative study
- 2018
-
Ingår i: Engineering applications of artificial intelligence. - : Elsevier. - 0952-1976 .- 1873-6769. ; 71, s. 28-44
-
Tidskriftsartikel (refereegranskat)abstract
- Radial basis functions are augmented with a posteriori bias in order to perform robustly when used as metamodels. Recently, it has been proposed that the bias can simply be set a priori by using the normal equation, i.e., the bias becomes the corresponding regression model. In this study, we demonstrate the performance of the suggested approach (RBFpri) with four other well-known metamodeling methods; Kriging, support vector regression, neural network and multivariate adaptive regression. The performance of the five methods is investigated by a comparative study, using 19 mathematical test functions, with five different degrees of dimensionality and sampling size for each function. The performance is evaluated by root mean squared error representing the accuracy, rank error representing the suitability of metamodels when coupled with evolutionary optimization algorithms, training time representing the efficiency and variation of root mean squared error representing the robustness. Furthermore, a rigorous statistical analysis of performance metrics is performed. The results show that the proposed radial basis function with a priori bias achieved the best performance in most of the experiments in terms of all three metrics. When considering the statistical analysis results, the proposed approach again behaved the best, while Kriging was relatively as accurate and support vector regression was almost as fast as RBFpri. The proposed RBF is proven to be the most suitable method in predicting the ranking among pairs of solutions utilized in evolutionary algorithms. Finally, the comparison study is carried out on a real-world engineering optimization problem.
|
|
| 6. |
|
|
| 7. |
- Andersson, Martin, 1981-
(författare)
-
A bilevel approach to parameter tuning of optimization algorithms using evolutionary computing : Understanding optimization algorithms through optimization
- 2018
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Most optimization problems found in the real world cannot be solved using analytical methods. For these types of difficult optimization problems, an alternative approach is needed. Metaheuristics are a category of optimization algorithms that do not guarantee that an optimal solution will be found, but instead search for the best solutions using some general heuristics. Metaheuristics have been shown to be effective at finding “good-enough” solutions to a wide variety of difficult problems. Most metaheuristics involve control parameters that can be used to modify how the heuristics perform its search. This is necessary because different problems may require different search strategies to be solved effectively. The control parameters allow for the optimization algorithm to be adapted to the problem at hand. It is, however, difficult to predict what the optimal control parameters are for any given problem. The problem of finding these optimal control parameter values is known as parameter tuning and is the main topic of this thesis. This thesis uses a bilevel optimization approach to solve parameter tuning problems. In this approach, the parameter tuning problem itself is formulated as an optimization problem and solved with an optimization algorithm. The parameter tuning problem formulated as a bilevel optimization problem is challenging because of nonlinear objective functions, interacting variables, multiple local optima, and noise. However, it is in precisely this kind of difficult optimization problem that evolutionary algorithms, which are a subclass of metaheuristics, have been shown to be effective. That is the motivation for using evolutionary algorithms for the upper-level optimization (i.e. tuning algorithm) of the bilevel optimization approach. Solving the parameter tuning problem using a bilevel optimization approach is also computationally expensive, since a complete optimization run has to be completed for every evaluation of a set of control parameter values. It is therefore important that the tuning algorithm be as efficient as possible, so that the parameter tuning problem can be solved to a satisfactory level with relatively few evaluations. Even so, bilevel optimization experiments can take a long time to run on a single computer. There is, however, considerable parallelization potential in the bilevel optimization approach, since many of the optimizations are independent of one another. This thesis has three primary aims: first, to present a bilevel optimization framework and software architecture for parallel parameter tuning; second, to use this framework and software architecture to evaluate and configure evolutionary algorithms as tuners and compare them with other parameter tuning methods; and, finally, to use parameter tuning experiments to gain new insights into and understanding of how optimization algorithms work and how they can used be to their maximum potential. The proposed framework and software architecture have been implemented and deployed in more than one hundred computers running many thousands of parameter tuning experiments for many millions of optimizations. This illustrates that this design and implementation approach can handle large parameter tuning experiments. Two types of evolutionary algorithms, i.e. differential evolution (DE) and a genetic algorithm (GA), have been evaluated as tuners against the parameter tuning algorithm irace. The as pects of algorithm configuration and noise handling for DE and the GA as related to the parameter tuning problem were also investigated. The results indicate that dynamic resampling strategies outperform static resampling strategies. It was also shown that the GA needs an explicit exploration and exploitation strategy in order not become stuck in local optima. The comparison with irace shows that both DE and the GA can significantly outperform it in a variety of different tuning problems.
|
|
| 8. |
- Andersson, Martin, 1981-, et al.
(författare)
-
A Parallel Computing Software Architecture for the Bilevel Parameter Tuning of Optimization Algorithms
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- Most optimization algorithms extract important algorithmic design decisions as control parameters. This is necessary because different problems can require different search strategies to be solved effectively. The control parameters allow for the optimization algorithm to be adapted to the problem at hand. It is however difficult to predict what the optimal control parameters are for any given problem. Finding these optimal control parameter values is referred to as the parameter tuning problem. One approach of solving the parameter tuning problem is to use a bilevel optimization where the parameter tuning problem itself is formulated as an optimization problem involving algorithmic performance as the objective(s). In this paper, we present a framework and architecture that can be used to solve large-scale parameter tuning problems using a bilevel optimization approach. The proposed framework is used to show that evolutionary algorithms are competitive as tuners against irace which is a state-of-the-art tuning method. Two evolutionary algorithms, differential evaluation (DE) and a genetic algorithm (GA) are evaluated as tuner algorithms using the proposed framework and software architecture. The importance of replicating optimizations and avoiding local optima is also investigated. The architecture is deployed and tested by running millions of optimizations using a computing cluster. The results indicate that the evolutionary algorithms can consistently find better control parameter values than irace. The GA, however, needs to be configured for an explicit exploration and exploitation strategy in order avoid local optima.
|
|
| 9. |
- Andersson, Martin, 1981-, et al.
(författare)
-
Parameter tuned CMA-ES on the CEC'15 expensive problems
- 2015
-
Ingår i: 2015 IEEE Congress on Evolutionary Computation (CEC). - : IEEE conference proceedings. - 9781479974924 - 9781479974917 ; , s. 1950-1957
-
Konferensbidrag (refereegranskat)abstract
- Evolutionary optimization algorithms have parameters that are used to adapt the search strategy to suit different optimization problems. Selecting the optimal parameter values for a given problem is difficult without a-priori knowledge. Experimental studies can provide this knowledge by finding the best parameter values for a specific set of problems. This knowledge can also be constructed into heuristics (rule-of-thumbs) that can adapt the parameters for the problem. The aim of this paper is to assess the heuristics of the Covariance Matrix Adaptation Evolution Strategy (CMA-ES) optimization algorithm. This is accomplished by tuning CMA-ES parameters so as to maximize its performance on the CEC'15 problems, using a bilevel optimization approach that searches for the optimal parameter values. The optimized parameter values are compared against the parameter values suggested by the heuristics. The difference between specialized and generalized parameter values are also investigated.
|
|
| 10. |
- Andersson, Martin, 1981-, et al.
(författare)
-
Parameter Tuning of MOEAs Using a Bilevel Optimization Approach
- 2015
-
Ingår i: Evolutionary Multi-Criterion Optimization. - Cham : Springer International Publishing Switzerland. - 9783319159331 - 9783319159348 ; , s. 233-247
-
Konferensbidrag (refereegranskat)abstract
- The performance of an Evolutionary Algorithm (EA) can be greatly influenced by its parameters. The optimal parameter settings are also not necessarily the same across different problems. Finding the optimal set of parameters is therefore a difficult and often time-consuming task. This paper presents results of parameter tuning experiments on the NSGA-II and NSGA-III algorithms using the ZDT test problems. The aim is to gain new insights on the characteristics of the optimal parameter settings and to study if the parameters impose the same effect on both NSGA-II and NSGA-III. The experiments also aim at testing if the rule of thumb that the mutation probability should be set to one divided by the number of decision variables is a good heuristic on the ZDT problems. A comparison of the performance of NSGA-II and NSGA-III on the ZDT problems is also made.
|
|
