A CLUSTERING-BASED NICHING FRAMEWORK FOR THE APPROXIMATION OF EQUIVALENT PARETO-SUBSETS

2011 ◽  
Vol 10 (03) ◽  
pp. 295-311 ◽  
Author(s):  
OLIVER KRAMER ◽  
HOLGER DANIELSIEK
Keyword(s):  
Optimization Problems ◽  
Kernel Density ◽  
Population Based ◽  
Multi Objective Optimization ◽  
Decision Space ◽  
Multi Objective ◽  
Pareto Sets ◽  
Density Clustering ◽  
Different Characteristics ◽  
Different Parts

In many optimization problems in practice, multiple objectives have to be optimized at the same time. Some multi-objective problems are characterized by multiple connected Pareto-sets at different parts in decision space — also called equivalent Pareto-subsets. We assume that the practitioner wants to approximate all Pareto-subsets to be able to choose among various solutions with different characteristics. In this work, we propose a clustering-based niching framework for multi-objective population-based approaches that allows to approximate equivalent Pareto-subsets. Iteratively, the clustering process assigns the population to niches, and the multi-objective optimization process concentrates on each niche independently. Two exemplary hybridizations, rake selection and DBSCAN, as well as SMS-EMOA and kernel density clustering demonstrate that the niching framework allows enough diversity to detect and approximate equivalent Pareto-subsets.

Multi-Objective Optimization Based on Brain Storm Optimization Algorithm

2013 ◽  
Vol 4 (3) ◽  
pp. 1-21 ◽  
Author(s):  
Yuhui Shi ◽  
Jingqian Xue ◽  
Yali Wu
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Solution Space ◽  
Population Based ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Brain Storm Optimization ◽  
Objective Space ◽  
Different Characteristics ◽  
Single Objective

In recent years, many evolutionary algorithms and population-based algorithms have been developed for solving multi-objective optimization problems. In this paper, the authors propose a new multi-objective brain storm optimization algorithm in which the clustering strategy is applied in the objective space instead of in the solution space in the original brain storm optimization algorithm for solving single objective optimization problems. Two versions of multi-objective brain storm optimization algorithm with different characteristics of diverging operation were tested to validate the usefulness and effectiveness of the proposed algorithm. Experimental results show that the proposed multi-objective brain storm optimization algorithm is a very promising algorithm, at least for solving these tested multi-objective optimization problems.

A Memetic Optimization Strategy Based on Dimension Reduction in Decision Space

2015 ◽  
Vol 23 (1) ◽  
pp. 69-100 ◽  
Author(s):  
Handing Wang ◽  
Licheng Jiao ◽  
Ronghua Shang ◽  
Shan He ◽  
Fang Liu
Keyword(s):  
Dimension Reduction ◽  
Optimization Problems ◽  
State Of The Art ◽  
Search Space ◽  
Optimization Strategy ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Decision Space ◽  
Multi Objective ◽  
Decision Variables

There can be a complicated mapping relation between decision variables and objective functions in multi-objective optimization problems (MOPs). It is uncommon that decision variables influence objective functions equally. Decision variables act differently in different objective functions. Hence, often, the mapping relation is unbalanced, which causes some redundancy during the search in a decision space. In response to this scenario, we propose a novel memetic (multi-objective) optimization strategy based on dimension reduction in decision space (DRMOS). DRMOS firstly analyzes the mapping relation between decision variables and objective functions. Then, it reduces the dimension of the search space by dividing the decision space into several subspaces according to the obtained relation. Finally, it improves the population by the memetic local search strategies in these decision subspaces separately. Further, DRMOS has good portability to other multi-objective evolutionary algorithms (MOEAs); that is, it is easily compatible with existing MOEAs. In order to evaluate its performance, we embed DRMOS in several state of the art MOEAs to facilitate our experiments. The results show that DRMOS has the advantage in terms of convergence speed, diversity maintenance, and portability when solving MOPs with an unbalanced mapping relation between decision variables and objective functions.

Multi-Objective Optimal Control Design With the Simple Cell Mapping Method

2013 ◽  
Author(s):  
Yousef Sardahi ◽  
Yousef Naranjani ◽  
Wei Liang ◽  
Jian-Qiao Sun ◽  
Carlos Hernandez ◽  
...  
Keyword(s):  
Optimal Control ◽  
Optimization Problems ◽  
Control Design ◽  
Optimal Solutions ◽  
Multi Objective Optimization ◽  
Cell Mapping ◽  
Multi Objective ◽  
Simple Cell Mapping ◽  
Pareto Sets ◽  
Single Objective

Controls are often designed to meet different and conflicting goals. Consider the well-known LQR optimal control. The performance index contains a response measure and a control penalty, which are conflicting requirements. Proper linear or nonlinear combinations of the conflicting objective functions have led to single objective optimization problems. However, such a single objective optimization is dependent on the combination algorithm, and only provides a narrow window of all possible optimal solutions that a system may have. Multi-objective optimization provides a set of optimal solutions, known as Pareto set. There have been many studies of search algorithms for Pareto sets of multi-objective optimization problems for complex dynamical systems. Recently, the simple cell mapping (SCM) method due to C.S. Hsu has been found to be a highly effective tool to compute Pareto sets. This paper applies the SCM method to several control design problems of linear and nonlinear dynamical systems. The results of the work are very exciting to report.

Manufacturer Order Fulfillment Based on Multi-Objective Optimization NSGA II Model

2013 ◽  
Vol 340 ◽  
pp. 136-140
Author(s):  
Liang You Shu ◽  
Ling Xiao Yang
Keyword(s):  
Optimization Model ◽  
Optimization Problems ◽  
Population Based ◽  
Pareto Optimal ◽  
Order Fulfillment ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Pareto Optimal Front ◽  
Multi Objective ◽  
Local Search Procedure

The aim of this paper is to study the production and delivery decision problem in the Manufacturer Order Fulfillment. Owing to the order fulfillment optimization condition of the manufacturer, the multi-objective optimization model of manufacturers' production and delivery has been founded. The solution of the multi-objective optimization model is also very difficult. Fast and Elitist Non-dominated Sorting Genetic Algorithm (NSGA II) have been applied successfully to various test and real-world optimization problems. These population based the algorithm provide a diverse set of non-dominated solutions. The obtained non-dominated set is close to the true Pareto-optimal front. But its convergence to the true Pareto-optimal front is not guaranteed. Hence SBX is used as a local search procedure. The proposed procedure is successfully applied to a special case. The results validate that the algorithm is effective to the multi-objective optimization model.

Computing Optimal Distances to Pareto Sets of Multi-Objective Optimization Problems in Asymmetric Normed Lattices

2018 ◽  
Vol 159 (1) ◽  
pp. 75-93 ◽  
Author(s):  
X. Blasco ◽  
G. Reynoso-Meza ◽  
E. A. Sánchez-Pérez ◽  
J. V. Sánchez-Pérez
Keyword(s):  
Optimization Problems ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Sets

scholarly journals An Improved Artificial Electric Field Algorithm for Multi-Objective Optimization

Processes ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 584
Author(s):  
Hemant Petwal ◽  
Rinkle Rani
Keyword(s):  
Electric Field ◽  
Density Estimation ◽  
Optimization Problems ◽  
Population Based ◽  
Population Diversity ◽  
Multi Objective Optimization ◽  
Local Optima ◽  
Multi Objective ◽  
Polynomial Mutation ◽  
Optimum Solution

Real-world problems such as scientific, engineering, mechanical, etc., are multi-objective optimization problems. In order to achieve an optimum solution to such problems, multi-objective optimization algorithms are used. A solution to a multi-objective problem is to explore a set of candidate solutions, each of which satisfies the required objective without any other solution dominating it. In this paper, a population-based metaheuristic algorithm called an artificial electric field algorithm (AEFA) is proposed to deal with multi-objective optimization problems. The proposed algorithm utilizes the concepts of strength Pareto for fitness assignment and the fine-grained elitism selection mechanism to maintain population diversity. Furthermore, the proposed algorithm utilizes the shift-based density estimation approach integrated with strength Pareto for density estimation, and it implements bounded exponential crossover (BEX) and polynomial mutation operator (PMO) to avoid solutions trapping in local optima and enhance convergence. The proposed algorithm is validated using several standard benchmark functions. The proposed algorithm’s performance is compared with existing multi-objective algorithms. The experimental results obtained in this study reveal that the proposed algorithm is highly competitive and maintains the desired balance between exploration and exploitation to speed up convergence towards the Pareto optimal front.

scholarly journals An Expensive Multi-Objective Optimization Algorithm Based on Decision Space Compression

2021 ◽  
pp. 2159039
Author(s):  
Haosen Liu ◽  
Fangqing Gu ◽  
Yiu-Ming Cheung
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problems ◽  
Experimental Studies ◽  
Surrogate Models ◽  
Multi Objective Optimization ◽  
Decision Space ◽  
Multi Objective ◽  
The Past ◽  
Decision Variables ◽  
Space Compression

Numerous surrogate-assisted expensive multi-objective optimization algorithms were proposed to deal with expensive multi-objective optimization problems in the past few years. The accuracy of the surrogate models degrades as the number of decision variables increases. In this paper, we propose a surrogate-assisted expensive multi-objective optimization algorithm based on decision space compression. Several surrogate models are built in the lower dimensional compressed space. The promising points are generated and selected in the lower compressed decision space and decoded to the original decision space for evaluation. Experimental studies show that the proposed algorithm achieves a good performance in handling expensive multi-objective optimization problems with high-dimensional decision space.

Comparison of Meta-heuristic Algorithms on Benchmark Functions

2019 ◽  
Vol 2 (3) ◽  
pp. 508-517
Author(s):  
FerdaNur Arıcı ◽  
Ersin Kaya
Keyword(s):  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Optimization Algorithms ◽  
Gravitational Search Algorithm ◽  
Differential Evolution Algorithm ◽  
Population Based ◽  
Time Interval ◽  
Bee Colony ◽  
Different Characteristics

Optimization is a process to search the most suitable solution for a problem within an acceptable time interval. The algorithms that solve the optimization problems are called as optimization algorithms. In the literature, there are many optimization algorithms with different characteristics. The optimization algorithms can exhibit different behaviors depending on the size, characteristics and complexity of the optimization problem. In this study, six well-known population based optimization algorithms (artificial algae algorithm - AAA, artificial bee colony algorithm - ABC, differential evolution algorithm - DE, genetic algorithm - GA, gravitational search algorithm - GSA and particle swarm optimization - PSO) were used. These six algorithms were performed on the CEC’17 test functions. According to the experimental results, the algorithms were compared and performances of the algorithms were evaluated.

Sign in / Sign up

Export Citation Format

Share Document