scholarly journals A Decomposition-Based Interactive Method for Multi-Objective Evolutionary Algorithm

2012 ◽  
Author(s):  
Nguye Long ◽  
Bui Thu Lam
Keyword(s):  
Optimization Problems ◽  
Decision Makers ◽  
Optimization Process ◽  
Multi Objective Optimization ◽  
Interactive Method ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Single Solution ◽  
Optimal Set

Multi-objectivity has existed in many real-world optimization problems. In most multi-objective cases, objectives are often conflicting, there is no single solution being optimal with regards to all objectives. These problems are called Multi-objective Optimization Problems (MOPs). To date, there have been al large number of methods for solving MOPs including evolutionary methods (namly Multi-objective Evolutionary Algorithms MOEAs). With the use of a population of solutions for searching. MOEAs are naturally suitable for approximating optimal solutions (called the Pareto Optimal Set (POS) or the efficient set). There has been a popular trend in MOEAs considering the role of Decision Makers (DMs) during the optimization process (known as the human-in-loop) for checking, analyzing the results and giving the preference to guide the optimization process. This is call the interactive method.

Collective intelligence approaches in interactive evolutionary multi-objective optimization

2020 ◽  
Vol 28 (1) ◽  
pp. 95-108 ◽  
Author(s):  
Daniel Cinalli ◽  
Luis Martí ◽  
Nayat Sanchez-Pi ◽  
Ana Cristina Bicharra Garcia
Keyword(s):  
Collective Intelligence ◽  
Real Life ◽  
Decision Makers ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Trade Offs ◽  
Life Problems ◽  
Conflicting Objectives ◽  
Optimal Set

Abstract Evolutionary multi-objective optimization algorithms (EMOAs) have been successfully applied in many real-life problems. EMOAs approximate the set of trade-offs between multiple conflicting objectives, known as the Pareto optimal set. Reference point approaches can alleviate the optimization process by highlighting relevant areas of the Pareto set and support the decision makers to take the more confident evaluation. One important drawback of this approaches is that they require an in-depth knowledge of the problem being solved in order to function correctly. Collective intelligence has been put forward as an alternative to deal with situations like these. This paper extends some well-known EMOAs to incorporate collective preferences and interactive techniques. Similarly, two new preference-based multi-objective optimization performance indicators are introduced in order to analyze the results produced by the proposed algorithms in the comparative experiments carried out.

A Framework for Time-Cost-Quality Optimization in Project Management Problems Using an Exploratory Grid Concept in the Multi-Objective Simulated-Annealing

2021 ◽  
pp. 1-26
Author(s):  
Alzira Mota ◽  
Paulo Ávila ◽  
Ricardo Albuquerque ◽  
Lino Costa ◽  
João Bastos
Keyword(s):  
Decision Making ◽  
Simulated Annealing ◽  
Optimization Problems ◽  
Decision Makers ◽  
Time Cost ◽  
Trade Off ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Criteria Weights ◽  
Optimal Set

Time, cost, and quality are the three indispensable factors for the realization and success of a project. In this context, we propose a framework composed of a multi-objective approach and multi-criteria decision-making methods (MCDM) to solve time-cost-quality trade-off optimization problems. A multi-objective Simulated Annealing (MOSA) algorithm is used to compute an approximation to the Pareto optimal set. The concept of the exploratory grid is introduced in the MOSA to improve its performance. MCDM are used to assist the decision-making process. The Shannon entropy and AHP methods assign weights to criteria. The first methodology is for the inexperienced decision-makers, and the second concedes a personal and flexible weighting of the criteria weights, based on the project manager’s assessment. The TOPSIS and VIKOR methods are considered to rank the solutions. Although they have the same purpose, the rankings achieved are different. A tool is implemented to solve a time-cost-quality trade-off problem on a project activities network. The computational experiments are analyzed and the results with the exploratory grid in Simulated Annealing (SA) are promising. Despite the framework aims to solve multi-objective trade-off optimization problems, supporting the decisions of the project manager, the methodologies used can also be applied in other areas.

An Orthogonal Multi-objective Evolutionary Algorithm for Multi-objective Optimization Problems with Constraints

2004 ◽  
Vol 12 (1) ◽  
pp. 77-98 ◽  
Author(s):  
Sanyou Y. Zeng ◽  
Lishan S. Kang ◽  
Lixin X. Ding
Keyword(s):  
Evolutionary Algorithm ◽  
Optimization Problems ◽  
Engineering Problem ◽  
Test Problems ◽  
Pareto Optimal ◽  
Large Set ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Optimal Set

In this paper, an orthogonal multi-objective evolutionary algorithm (OMOEA) is proposed for multi-objective optimization problems (MOPs) with constraints. Firstly, these constraints are taken into account when determining Pareto dominance. As a result, a strict partial-ordered relation is obtained, and feasibility is not considered later in the selection process. Then, the orthogonal design and the statistical optimal method are generalized to MOPs, and a new type of multi-objective evolutionary algorithm (MOEA) is constructed. In this framework, an original niche evolves first, and splits into a group of sub-niches. Then every sub-niche repeats the above process. Due to the uniformity of the search, the optimality of the statistics, and the exponential increase of the splitting frequency of the niches, OMOEA uses a deterministic search without blindness or stochasticity. It can soon yield a large set of solutions which converges to the Pareto-optimal set with high precision and uniform distribution. We take six test problems designed by Deb, Zitzler et al., and an engineering problem (W) with constraints provided by Ray et al. to test the new technique. The numerical experiments show that our algorithm is superior to other MOGAS and MOEAs, such as FFGA, NSGAII, SPEA2, and so on, in terms of the precision, quantity and distribution of solutions. Notably, for the engineering problem W, it finds the Pareto-optimal set, which was previously unknown.

Multi-Objective Optimization Analysis of Motor Cooling System in Articulated Dump Truck

2011 ◽  
Vol 383-390 ◽  
pp. 4715-4720
Author(s):  
Yan Zhang ◽  
Yan Hua Shen ◽  
Wen Ming Zhang
Keyword(s):  
Field Distribution ◽  
Cooling System ◽  
Dump Truck ◽  
Water Cooling ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Temperature And Pressure ◽  
Water Cooling System ◽  
Optimal Set

In order to ensure the reliable and safe operation of the electric driving motor of the articulated dump truck, water cooling system is installed for each motor. For the best performance of the water cooling system, not only the heat transfer should be enhanced to maintain the motor in relatively low temperature, but also the pressure drop in the water cooling system should be reduced to save energy by reducing the power consumption of the pump. In this paper, the numerical simulation of the cooling progress is completed and the temperature and pressure field distribution are obtained. The multi-objective optimization model is established which involves the cooling system structure, temperature field distribution and pressure field distribution. To improve the computational efficiency, the surrogate model of the simulation about the cooling process is established based on the Response Surface Methodology (RSM). After the multi-objective optimization, the Pareto optimal set is obtained. The proper design point, which could make the average temperature and pressure drop of the cooling system relative desirable, is chosen from the Pareto optimal set.

scholarly journals Multi-Objective Optimization of Impedance Parameters in a Prosthesis Test Robot

2015 ◽  
Author(s):  
Poya Khalaf ◽  
Hanz Richter ◽  
Antonie J. van den Bogert ◽  
Dan Simon
Keyword(s):  
Control System ◽  
Motion Tracking ◽  
Optimization Problem ◽  
Peak Load ◽  
Pareto Optimal ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Rms Error ◽  
Optimal Set

We design a control system for a prosthesis test robot that was previously developed for transfemoral prosthesis design and test. The robot’s control system aims to mimic human walking in the sagittal plane. It has been seen in previous work that trajectory control alone fails to produce human-like forces. Therefore, we utilize an impedance controller to achieve reasonable tracking of motion and force simultaneously. However, these objectives conflict. Impedance control design can therefore be viewed as a multi-objective optimization problem. We use an evolutionary multi-objective strategy called Multi-Objective Invasive Weed Optimization (MOIWO) to design the impedance controller. The multi-objective optimization problem admits a set of equally valid alternative solutions known as the Pareto optimal set. We use a pseudo weight vector approach to select a single solution from the Pareto optimal set. Simulation results show that a solution that is selected for pure motion tracking performs very accurate motion tracking (RMS error of 0.06 cm) but fails to produce the desired forces (RMS error of 70% peak load). On the other hand, a solution that is selected for pure force tracking successfully tracks the desired force (RMS error of 12.7% peak load) at the expense of motion trajectory errors (RMS error of 4.5 cm).

Mixture Surrogate Models for Multi- Objective Optimization

2020 ◽  
Vol 13 (1) ◽  
Author(s):  
Shailesh S. Kadre ◽  
Vipin K. Tripathi
Keyword(s):  
Finite Element ◽  
Optimization Problems ◽  
Surrogate Models ◽  
Optimization Techniques ◽  
Optimization Process ◽  
Multiple Model ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Costly Function ◽  
Selection Of

Multi-objective optimization problems (MOOP) involve minimization of more than one objective functions and all of them are to be simultaneously minimized. The solution of these problems involves a large number of iterations. The multi- objective optimization problems related structural optimization of complex engineering structures is usually solved with finite element analysis (FEA). The solution time required to solve these FEA based solutions are very high. So surrogate models or meta- models are used to approximate the finite element solution during the optimization process. These surrogate assisted multi- objective optimization techniques are very commonly used in the current literature. These optimization techniques use evolutionary algorithm and it is very difficult to guarantee the convergence of the final solution, especially in the cases where the budget of costly function evaluations is low. In such cases, it is required to increase the efficiency of surrogate models in terms of accuracy and total efforts required to find the final solutions.In this paper, an advanced surrogate assisted multi- objective optimization algorithm (ASMO) is developed. This algorithm can handle linear, equality and non- linear constraints and can be applied to both benchmark and engineering application problems. This algorithm does not require any prior knowledge for the selection of surrogate models. During the optimization process, best single and mixture surrogate models are automatically selected. The advanced surrogate models are created by MATSuMoTo, the MATLAB based tool box. These mixture models are built by Dempster- Shafer theory (DST). This theory has a capacity to handle multiple model characteristics for the selection of best models. By adopting this strategy, it is ensured that most accurate surrogate models are selected. There can be different kind of surrogate models for objective and constraint functions. Multi-objective optimization of machine tool spindle is studied as the test problem for this algorithm and it is observed that the proposed strategy is able to find the non- dominated solutions with minimum number of costly function evaluations. The developed method can be applied to other benchmark and engineering applications.

Sign in / Sign up

Export Citation Format

Share Document