Hui Li
An adaptive evolutionary multi-objective approach based on simulated annealing
Li, Hui; Landa-Silva, Dario
Abstract
A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization (EMO) algorithm that attempts to optimize multiple subproblems simultaneously by evolving a population of solutions. However, the performance of MOEA/D highly depends on the initial setting and diversity of the weight vectors. In this paper, we present an improved version of MOEA/D, called EMOSA, which incorporates an advanced local search technique (simulated annealing) and adapts the search directions (weight vectors) corresponding to various subproblems. In EMOSA, the weight vector of each subproblem is adaptively modified at the lowest temperature in order to diversify the search towards the unexplored parts of the Pareto-optimal front. Our computational results show that EMOSA outperforms six other well-established multi-objective metaheuristic algorithms on both the (constrained)multi-objective knapsack problemand the (unconstrained) multi-objective traveling salesman problem. Moreover, the effects of the main algorithmic components and parameter sensitivities on the search performance of EMOSA are experimentally investigated.
Citation
Li, H., & Landa-Silva, D. (2011). An adaptive evolutionary multi-objective approach based on simulated annealing. Evolutionary Computation, 19(4), https://doi.org/10.1162/EVCO_a_00038
Journal Article Type | Article |
---|---|
Publication Date | Jan 1, 2011 |
Deposit Date | Apr 4, 2016 |
Publicly Available Date | Apr 4, 2016 |
Journal | Evolutionary Computation |
Print ISSN | 1063-6560 |
Electronic ISSN | 1530-9304 |
Publisher | Massachusetts Institute of Technology Press |
Peer Reviewed | Peer Reviewed |
Volume | 19 |
Issue | 4 |
DOI | https://doi.org/10.1162/EVCO_a_00038 |
Keywords | multiobjective optimization, simulated annealing, local search, combinatorial optimization |
Public URL | https://nottingham-repository.worktribe.com/output/1010879 |
Publisher URL | http://www.mitpressjournals.org/doi/abs/10.1162/EVCO_a_00038#.Vv_I3vkrJpg |
Additional Information | © 2011 by the Massachusetts Institute of Technology. |
Files
dls_ecj2011.pdf
(4.1 Mb)
PDF
You might also like
Local-global methods for generalised solar irradiance forecasting
(2024)
Journal Article
An agent based modelling approach for the office space allocation problem
(2018)
Presentation / Conference Contribution
Lookahead policy and genetic algorithm for solving nurse rostering problems
(2018)
Presentation / Conference Contribution
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search