mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Differential evolution based on decomposition for solving multi-objective optimization problems
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0001-9857-4317
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.ORCID iD: 0000-0002-3425-3837
2016 (English)In: ICAART 2016 - Proceedings of the 8th International Conference on Agents and Artificial Intelligence, 2016, 512-516 p.Conference paper, Published paper (Refereed)
Resource type
Text
Abstract [en]

Optimization problems with multiple objectives are often encountered in many scientific and engineering scenarios. The prior works on multi-objective differential evolution (DE) have mainly focused on nondominated sorting of solutions to handle different objectives at the same time. This paper suggests a new approach to differential evolution which is based on decomposition of the original problem into a set of scalar optimization subproblems. We design a decomposition-based DE algorithm to optimize these scalar subproblems simultaneously by evolving a population of solutions with proper mutation and selection operators. Since the proposed DE algorithm does not involve pairwise comparison and non-dominated sorting of solutions, it would incur lower computational complexity than the dominance-based DE algorithms.

Place, publisher, year, edition, pages
2016. 512-516 p.
Keyword [en]
Decomposition, Differential evolution, Evolutionary algorithm, Multi-objective optimization, Pareto-optimality, Algorithms, Artificial intelligence, Evolutionary algorithms, Optimization, Pareto principle, Multi-objective differential evolutions, Multi-objective optimization problem, Multiple-objectives, Non-dominated Sorting, Optimization problems, Pair-wise comparison, Multiobjective optimization
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:mdh:diva-31681Scopus ID: 2-s2.0-84969286344ISBN: 9789897581724 (print)OAI: oai:DiVA.org:mdh-31681DiVA: diva2:932682
Conference
8th International Conference on Agents and Artificial Intelligence, ICAART 2016, 24 February 2016 through 26 February 2016
Available from: 2016-06-02 Created: 2016-06-02 Last updated: 2016-10-26Bibliographically approved

Open Access in DiVA

No full text

Scopus

Authority records BETA

Xiong, Ning

Search in DiVA

By author/editor
Xiong, NingLeon, Miguel
By organisation
Embedded Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 15 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf