| 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, 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.
|
|
| 3. |
- 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.
|
|
| 4. |
- Amouzgar, Kaveh, 1980-
(författare)
-
Metamodel Based Multi-Objective Optimization with Finite-Element Applications
- 2018
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- As a result of the increase in accessibility of computational resources and the increase of computer power during the last two decades, designers are able to create computer models to simulate the behavior of complex products. To address global competitiveness, companies are forced to optimize the design of their products and production processes. Optimizing the design and production very often need several runs of computationally expensive simulation models. Therefore, integrating metamodels, as an efficient and sufficiently accurate approximate of the simulation model, with optimization algorithms is necessary. Furthermore, in most of engineering problems, more than one objective function has to be optimized, leading to multi-objective optimization(MOO). However, the urge to employ metamodels in MOO, i.e., metamodel based MOO (MB-MOO), is more substantial.Radial basis functions (RBF) is one of the most popular metamodeling methods. In this thesis, a new approach to constructing RBF with the bias to beset a priori by using the normal equation is proposed. The performance of the suggested approach is compared to the classic RBF and four other well-known metamodeling methods, in terms of accuracy, efficiency and, most importantly, suitability for integration with MOO evolutionary algorithms. It has been found that the proposed approach is accurate in most of the test functions, and it was the fastest compared to other methods. Additionally, the new approach is the most suitable method for MB-MOO, when integrated with evolutionary algorithms. The proposed approach is integrated with the strength Pareto evolutionary algorithm (SPEA2) and applied to two real-world engineering problems: MB-MOO of the disk brake system of a heavy truck, and the metal cutting process in a turning operation. Thereafter, the Pareto-optimal fronts are obtained and the results are presented. The MB-MOO in both case studies has been found to be an efficient and effective method. To validate the results of the latter MB-MOO case study, a framework for automated finite element (FE) simulation based MOO (SB-MOO) of machining processes is developed and presented by applying it to the same metal cutting process in a turning operation. It has been proved that the framework is effective in achieving the MOO of machining processes based on actual FE simulations.
|
|
| 5. |
- Amouzgar, Kaveh, 1980-, et al.
(författare)
-
Multi-objective optimisation of tool indexing problem : a mathematical model and a modified genetic algorithm
- 2021
-
Ingår i: International Journal of Production Research. - : Taylor & Francis Group. - 0020-7543 .- 1366-588X. ; 59:12, s. 3572-3590
-
Tidskriftsartikel (refereegranskat)abstract
- Machining process efficiencies can be improved by minimising the non-machining time, thereby resulting in short operation cycles. In automatic-machining centres, this is realised via optimum cutting tool allocation on turret-magazine indices – the “tool-indexing problem”. Extant literature simplifies TIP as a single-objective optimisation problem by considering minimisation of only the tool-indexing time. In contrast, this study aims to address the multi-objective optimisation tool indexing problem (MOOTIP) by identifying changes that must be made to current industrial settings as an additional objective. Furthermore, tool duplicates and lifespan have been considered. In addition, a novel mathematical model is proposed for solving MOOTIP. Given the complexity of the problem, the authors suggest the use of a modified strength Pareto evolutionary algorithm combined with a customised environment-selection mechanism. The proposed approach attained a uniform distribution of solutions to realise the above objectives. Additionally, a customised solution representation was developed along with corresponding genetic operators to ensure the feasibility of solutions obtained. Results obtained in this study demonstrate the realization of not only a significant (70%) reduction in non-machining time but also a set of tradeoff solutions for decision makers to manage their tools more efficiently compared to current practices.
|
|
| 6. |
- Amouzgar, Kaveh, 1980-, et al.
(författare)
-
Optimizing index positions on CNC tool magazines considering cutting tool life and duplicates
- 2020
-
Ingår i: Procedia CIRP. - : Elsevier. - 2212-8271. ; 93, s. 1508-1513
-
Tidskriftsartikel (refereegranskat)abstract
- Minimizing the non-machining time of CNC machines requires optimal positioning of cutting tools on indexes (stations) of CNC machine turret magazine. This work presents a genetic algorithm with a novel solution representation and genetic operators to find the best possible index positions while tool duplicates and tools life are taken in to account during the process. The tool allocation in a machining process of a crankshaft with 10 cutting operations, on a 45-index magazine, is optimized for the entire life of the tools on the magazine. The tool-indexing time is considerably reduced compared to the current index positions being used in an automotive factory.
|
|
| 7. |
- 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.
|
|
| 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)
-
On the Trade-off Between Runtime and Evaluation Efficiency In Evolutionary Algorithms
-
Annan publikation (övrigt vetenskapligt/konstnärligt)abstract
- Evolutionary optimization algorithms typically use one or more parameters that control their behavior. These parameters, which are often kept constant, can be tuned to improve the performance of the algorithm on specific problems. However, past studies have indicated that the performance can be further improved by adapting the parameters during runtime. A limitation of these studies is that they only control, at most, a few parameters, thereby missing potentially beneficial interactions between them. Instead of finding a direct control mechanism, the novel approach in this paper is to use different parameter sets in different stages of an optimization. These multiple parameter sets, which remain static within each stage, are tuned through extensive bi-level optimization experiments that approximate the optimal adaptation of the parameters. The algorithmic performance obtained with tuned multiple parameter sets is compared against that obtained with a single parameter set. For the experiments in this paper, the parameters of NSGAII are tuned when applied to the ZDT, DTLZ and WFG test problems. The results show that using multiple parameter sets can significantly increase the performance over a single parameter set.
|
|
| 10. |
- Andersson, Martin, 1981-, et al.
(författare)
-
Parameter Tuning Evolutionary Algorithms for Runtime versus Cost Trade-off in a Cloud Computing Environment
- 2018
-
Ingår i: Simulation Modelling Practice and Theory. - : Elsevier. - 1569-190X. ; 89, s. 195-205
-
Tidskriftsartikel (refereegranskat)abstract
- The runtime of an evolutionary algorithm can be reduced by increasing the number of parallel evaluations. However, increasing the number of parallel evaluations can also result in wasted computational effort since there is a greater probability of creating solutions that do not contribute to convergence towards the global optimum. A trade-off, therefore, arises between the runtime and computational effort for different levels of parallelization of an evolutionary algorithm. When the computational effort is translated into cost, the trade-off can be restated as runtime versus cost. This trade-off is particularly relevant for cloud computing environments where the computing resources can be exactly matched to the level of parallelization of the algorithm, and the cost is proportional to the runtime and how many instances that are used. This paper empirically investigates this trade-off for two different evolutionary algorithms, NSGA-II and differential evolution (DE) when applied to multi-objective discrete-event simulation-based (DES) problem. Both generational and steadystate asynchronous versions of both algorithms are included. The approach is to perform parameter tuning on a simplified version of the DES model. A subset of the best configurations from each tuning experiment is then evaluated on a cloud computing platform. The results indicate that, for the included DES problem, the steady-state asynchronous version of each algorithm provides a better runtime versus cost trade-off than the generational versions and that DE outperforms NSGA-II.
|
|
