A Review of Agent-Based Co-Evolutionary Algorithms for Multi-Objective Optimization

2010 ◽  
pp. 177-209 ◽  
Author(s):  
Rafał Dreżewski ◽  
Leszek Siwik
Keyword(s):  
Evolutionary Algorithms ◽  
Multi Objective Optimization ◽  
Agent Based ◽  
Multi Objective

scholarly journals The dilemma between eliminating dominance-resistant solutions and preserving boundary solutions of extremely convex Pareto fronts

2021 ◽  
Author(s):  
Zhenkun Wang ◽  
Qingyan Li ◽  
Qite Yang ◽  
Hisao Ishibuchi
Keyword(s):  
Evolutionary Algorithms ◽  
Coping Strategies ◽  
Test Problem ◽  
Pareto Front ◽  
Optimization Problems ◽  
Feasible Region ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Fronts ◽  
Boundary Solutions

AbstractIt has been acknowledged that dominance-resistant solutions (DRSs) extensively exist in the feasible region of multi-objective optimization problems. Recent studies show that DRSs can cause serious performance degradation of many multi-objective evolutionary algorithms (MOEAs). Thereafter, various strategies (e.g., the $$\epsilon $$ ϵ -dominance and the modified objective calculation) to eliminate DRSs have been proposed. However, these strategies may in turn cause algorithm inefficiency in other aspects. We argue that these coping strategies prevent the algorithm from obtaining some boundary solutions of an extremely convex Pareto front (ECPF). That is, there is a dilemma between eliminating DRSs and preserving boundary solutions of the ECPF. To illustrate such a dilemma, we propose a new multi-objective optimization test problem with the ECPF as well as DRSs. Using this test problem, we investigate the performance of six representative MOEAs in terms of boundary solutions preservation and DRS elimination. The results reveal that it is quite challenging to distinguish between DRSs and boundary solutions of the ECPF.

scholarly journals Multi-agent collaborative search: an agent-based memetic multi-objective optimization algorithm applied to space trajectory design

2011 ◽  
Vol 225 (11) ◽  
pp. 1211-1227 ◽  
Author(s):  
M Vasile ◽  
F Zuiani
Keyword(s):  
Selection Criterion ◽  
Search Space ◽  
Trajectory Design ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Agent Based ◽  
Multi Objective ◽  
Collaborative Search ◽  
Multi Agent ◽  
Space Trajectory Design

This article presents an algorithm for multi-objective optimization that blends together a number of heuristics. A population of agents combines heuristics that aim at exploring the search space both globally and in a neighbourhood of each agent. These heuristics are complemented with a combination of a local and global archive. The novel agent-based algorithm is tested at first on a set of standard problems and then on three specific problems in space trajectory design. Its performance is compared against a number of state-of-the-art multi-objective optimization algorithms that use the Pareto dominance as selection criterion: non-dominated sorting genetic algorithm (NSGA-II), Pareto archived evolution strategy (PAES), multiple objective particle swarm optimization (MOPSO), and multiple trajectory search (MTS). The results demonstrate that the agent-based search can identify parts of the Pareto set that the other algorithms were not able to capture. Furthermore, convergence is statistically better although the variance of the results is in some cases higher.

Sign in / Sign up

Export Citation Format

Share Document