Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 1211-1227 |
Number of pages | 17 |
Journal | Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering |
Volume | 225 |
Issue number | 11 |
Early online date | 5 Sep 2011 |
DOIs | |
Publication status | Published - Nov 2011 |
Keywords
- multiobjective optimization
- agent-based approach
- trajectory optimisation