681 research outputs found
A Pareto-based evolutionary algorithm using decomposition and truncation for dynamic multi-objective optimization
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Maintaining a balance between convergence and diversity of the population in the objective space has been widely recognized as the main challenge when solving problems with two or more conflicting objectives. This is added by another difficulty of tracking the Pareto optimal solutions set (POS) and/or the Pareto optimal front (POF) in dynamic scenarios. Confronting these two issues, this paper proposes a Pareto-based evolutionary algorithm using decomposition and truncation to address such dynamic multi-objective optimization problems (DMOPs). The proposed algorithm includes three contributions: a novel mating selection strategy, an efficient environmental selection technique and an effective dynamic response mechanism. The mating selection considers the decomposition-based method to select two promising mating parents with good diversity and convergence. The environmental selection presents a modified truncation method to preserve good diversity. The dynamic response mechanism is evoked to produce some solutions with good diversity and convergence whenever an environmental change is detected. In the experimental studies, a range of dynamic multi-objective benchmark problems with different characteristics were carried out to evaluate the performance of the proposed method. The experimental results demonstrate that the method is very competitive in terms of convergence and diversity, as well as in response speed to the changes, when compared with six other state-of-the-art methods
An adaptation reference-point-based multiobjective evolutionary algorithm
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.It is well known that maintaining a good balance between convergence and diversity is crucial to the performance of multiobjective optimization algorithms (MOEAs). However, the Pareto front (PF) of multiobjective optimization problems (MOPs) affects the performance of MOEAs, especially reference point-based ones. This paper proposes a reference-point-based adaptive method to study the PF of MOPs according to the candidate solutions of the population. In addition, the proportion and angle function presented selects elites during environmental selection. Compared with five state-of-the-art MOEAs, the proposed algorithm shows highly competitive effectiveness on MOPs with six complex characteristics
A similarity-based cooperative co-evolutionary algorithm for dynamic interval multi-objective optimization problems
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Dynamic interval multi-objective optimization problems (DI-MOPs) are very common in real-world applications. However, there are few evolutionary algorithms that are suitable for tackling DI-MOPs up to date. A framework of dynamic interval multi-objective cooperative co-evolutionary optimization based on the interval similarity is presented in this paper to handle DI-MOPs. In the framework, a strategy for decomposing decision variables is first proposed, through which all the decision variables are divided into two groups according to the interval similarity between each decision variable and interval parameters. Following that, two sub-populations are utilized to cooperatively optimize decision variables in the two groups. Furthermore, two response strategies, rgb0.00,0.00,0.00i.e., a strategy based on the change intensity and a random mutation strategy, are employed to rapidly track the changing Pareto front of the optimization problem. The proposed algorithm is applied to eight benchmark optimization instances rgb0.00,0.00,0.00as well as a multi-period portfolio selection problem and compared with five state-of-the-art evolutionary algorithms. The experimental results reveal that the proposed algorithm is very competitive on most optimization instances
A self-organizing weighted optimization based framework for large-scale multi-objective optimization
The solving of large-scale multi-objective optimization problem (LSMOP) has become a hot research topic in evolutionary computation. To better solve this problem, this paper proposes a self-organizing weighted optimization based framework, denoted S-WOF, for addressing LSMOPs. Compared to the original framework, there are two main improvements in our work. Firstly, S-WOF simplifies the evolutionary stage into one stage, in which the evaluating numbers of weighted based optimization and normal optimization approaches are adaptively adjusted based on the current evolutionary state. Specifically, regarding the evaluating number for weighted based optimization (i.e., t1), it is larger when the population is in the exploitation state, which aims to accelerate the convergence speed, while t1 is diminishing when the population is switching to the exploration state, in which more attentions are put on the diversity maintenance. On the other hand, regarding the evaluating number for original optimization (i.e., t2), which shows an opposite trend to t1, it is small during the exploitation stage but gradually increases later. In this way, a dynamic trade-off between convergence and diversity is achieved in S-WOF. Secondly, to further improve the search ability in the large-scale decision space, an efficient competitive swarm optimizer (CSO) is implemented in S-WOF, which shows efficiency for solving LSMOPs. Finally, the experimental results have validated the superiority of S-WOF over several state-of-the-art large-scale evolutionary algorithms
Pareto or non-Pareto: Bi-criterion evolution in multi-objective optimization
It is known that Pareto dominance has its own weaknesses as the selection criterion in evolutionary multi-objective optimization. Algorithms based on Pareto dominance can suffer from slow convergence to the optimal front, inferior performance on problems with many objectives, etc. Non-Pareto criterion, such as decomposition-based criterion and indicator-based criterion, has already shown promising results in this regard, but its high selection pressure may lead the algorithm to prefer some specific areas of the problemâs Pareto front, especially when the front is highly irregular. In this paper, we propose a bi-criterion evolution framework of Pareto criterion and non-Pareto criterion, which attempts to make use of their strengths and compensates for each otherâs weaknesses. The proposed framework consists of two parts, Pareto criterion evolution and non-Pareto criterion evolution. The two parts work collaboratively, with an abundant exchange of information to facilitate each otherâs evolution. Specifically, the non-Pareto criterion evolution leads the Pareto criterion evolution forward and the Pareto criterion evolution compensates the possible diversity loss of the non-Pareto criterion evolution. The proposed framework keeps the freedom on the implementation of the non-Pareto criterion evolution part, thus making it applicable for any non-Pareto-based algorithm. In the Pareto criterion evolution, two operations, population maintenance and individual exploration, are presented. The former is to maintain a set of representative nondominated individuals, and the latter is to explore some promising areas which are undeveloped (or not well-developed) in the non-Pareto criterion evolution. Experimental results have shown the effectiveness of the proposed framework. The bi-criterion evolution works well on seven groups of 42 test problems with various characteristics, including those where Pareto-based algorithms or non-Paretobased algorithms strugg- e
Genetic and Swarm Algorithms for Optimizing the Control of Building HVAC Systems Using Real Data: A Comparative Study.
Buildings consume a considerable amount of electrical energy, the Heating, Ventilation,
and Air Conditioning (HVAC) system being the most demanding. Saving energy and maintaining
comfort still challenge scientists as they conflict. The control of HVAC systems can be improved by
modeling their behavior, which is nonlinear, complex, and dynamic and works in uncertain contexts.
Scientific literature shows that Soft Computing techniques require fewer computing resources
but at the expense of some controlled accuracy loss. Metaheuristics-search-based algorithms show
positive results, although further research will be necessary to resolve new challenging multi-objective
optimization problems. This article compares the performance of selected genetic and swarmintelligence-
based algorithms with the aim of discerning their capabilities in the field of smart buildings.
MOGA, NSGA-II/III, OMOPSO, SMPSO, and Random Search, as benchmarking, are compared
in hypervolume, generational distance, Δ-indicator, and execution time. Real data from the Building
Management System of Teatro Real de Madrid have been used to train a data model used for the
multiple objective calculations. The novelty brought by the analysis of the different proposed dynamic
optimization algorithms in the transient time of an HVAC system also includes the addition,
to the conventional optimization objectives of comfort and energy efficiency, of the coefficient of
performance, and of the rate of change in ambient temperature, aiming to extend the equipment
lifecycle and minimize the overshooting effect when passing to the steady state. The optimization
works impressively well in energy savings, although the results must be balanced with other real
considerations, such as realistic constraints on chillersâ operational capacity. The intuitive visualization
of the performance of the two families of algorithms in a real multi-HVAC system increases
the novelty of this proposal.post-print888 K
Hybrid non-dominated sorting genetic algorithm with adaptive operators selection
Multiobjective optimization entails minimizing or maximizing multiple objective functions subject to a set of constraints. Many real world applications can be formulated as multi-objective optimization problems (MOPs), which often involve multiple conflicting objectives to be optimized simultaneously. Recently, a number of multi-objective evolutionary algorithms (MOEAs) were developed suggested for these MOPs as they do not require problem specific information. They find a set of non-dominated solutions in a single run. The evolutionary process on which they are based, typically relies on a single genetic operator. Here, we suggest an algorithm which uses a basket of search operators. This is because it is never easy to choose the most suitable operator for a given problem. The novel hybrid non-dominated sorting genetic algorithm (HNSGA) introduced here in this paper and tested on the ZDT (Zitzler-Deb-Thiele) and CECâ09 (2009 IEEE Conference on Evolutionary Computations) benchmark problems specifically formulated for MOEAs. Numerical results prove that the proposed algorithm is competitive with state-of-the-art MOEAs
A competitive co-evolutionary approach for the multi-objective evolutionary algorithms
In multi-objective evolutionary algorithms (MOEAs), convergence and diversity are two basic issues and keeping a balance between them plays a vital role. There are several studies that have attempted to address this problem, but this is still an open challenge. It is thus the purpose of this research to develop a dual-population competitive co-evolutionary approach to improving the balance between convergence and diversity. We utilize two populations to solve separate tasks. The first population uses Pareto-based ranking scheme to achieve better convergence, and the second one tries to guarantee population diversity via the use of a decomposition-based method. Next, by operating a competitive mechanism to combine the two populations, we create a new one with a view to having both characteristics (i.e. convergence and diversity). The proposed methodâs performance is measured by the renowned benchmarks of multi-objective optimization problems (MOPs) using the hypervolume (HV) and the inverted generational distance (IGD) metrics. Experimental results show that the proposed method outperforms cutting-edge coevolutionary algorithms with a robust performance
Evolutionary Algorithms for Static and Dynamic Multiobjective Optimization
Many real-world optimization problems consist of a number of conflicting objectives that have to be optimized simultaneously. Due to the presence of multiple conflicting ob- jectives, there is no single solution that can optimize all the objectives. Therefore, the resulting multiobjective optimization problems (MOPs) resort to a set of trade-off op- timal solutions, called the Pareto set in the decision space and the Pareto front in the objective space. Traditional optimization methods can at best find one solution in a sin- gle run, thereby making them inefficient to solve MOPs. In contrast, evolutionary algo- rithms (EAs) are able to approximate multiple optimal solutions in a single run. This strength makes EAs good candidates for solving MOPs. Over the past several decades, there have been increasing research interests in developing EAs or improving their perfor- mance, resulting in a large number of contributions towards the applicability of EAs for MOPs. However, the performance of EAs depends largely on the properties of the MOPs in question, e.g., static/dynamic optimization environments, simple/complex Pareto front characteristics, and low/high dimensionality. Different problem properties may pose dis- tinct optimization difficulties to EAs. For example, dynamic (time-varying) MOPs are generally more challenging than static ones to EAs. Therefore, it is not trivial to further study EAs in order to make them widely applicable to MOPs with various optimization scenarios or problem properties.
This thesis is devoted to exploring EAsâ ability to solve a variety of MOPs with dif- ferent problem characteristics, attempting to widen EAsâ applicability and enhance their general performance. To start with, decomposition-based EAs are enhanced by incorpo- rating two-phase search and niche-guided solution selection strategies so as to make them suitable for solving MOPs with complex Pareto fronts. Second, new scalarizing functions are proposed and their impacts on evolutionary multiobjective optimization are exten- sively studied. On the basis of the new scalarizing functions, an efficient decomposition- based EA is introduced to deal with a class of hard MOPs. Third, a diversity-first- and-convergence-second sorting method is suggested to handle possible drawbacks of convergence-first based sorting methods. The new sorting method is then combined with strength based fitness assignment, with the aid of reference directions, to optimize MOPs with an increase of objective dimensionality. After that, we study the field of dynamic multiobjective optimization where objective functions and constraints can change over time. A new set of test problems consisting of a wide range of dynamic characteristics is introduced at an attempt to standardize test environments in dynamic multiobjective optimization, thereby aiding fair algorithm comparison and deep performance analysis. Finally, a dynamic EA is developed to tackle dynamic MOPs by exploiting the advan- tages of both generational and steady-state algorithms. All the proposed approaches have been extensively examined against existing state-of-the-art methods, showing fairly good performance in a variety of test scenarios.
The research work presented in the thesis is the output of initiative and novel attempts to tackle some challenging issues in evolutionary multiobjective optimization. This re- search has not only extended the applicability of some of the existing approaches, such as decomposition-based or Pareto-based algorithms, for complex or hard MOPs, but also contributed to moving forward research in the field of dynamic multiobjective optimiza- tion with novel ideas including new test suites and novel algorithm design
Optimization as a design strategy. Considerations based on building simulation-assisted experiments about problem decomposition
In this article the most fundamental decomposition-based optimization method
- block coordinate search, based on the sequential decomposition of problems in
subproblems - and building performance simulation programs are used to reason
about a building design process at micro-urban scale and strategies are defined
to make the search more efficient. Cyclic overlapping block coordinate search
is here considered in its double nature of optimization method and surrogate
model (and metaphore) of a sequential design process. Heuristic indicators apt
to support the design of search structures suited to that method are developed
from building-simulation-assisted computational experiments, aimed to choose
the form and position of a small building in a plot. Those indicators link the
sharing of structure between subspaces ("commonality") to recursive
recombination, measured as freshness of the search wake and novelty of the
search moves. The aim of these indicators is to measure the relative
effectiveness of decomposition-based design moves and create efficient block
searches. Implications of a possible use of these indicators in genetic
algorithms are also highlighted.Comment: 48 pages. 12 figures, 3 table
- âŠ