Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm
Department of Mathematical Information Technology. (Industrial Optimization Group)
Indian Institute of Technology Kanpur. (Kanpur Genetic Algorithms Laboratory)
Dept. of Mathematical Information Technology, University of Jyväskylä.
2011 (English)In: Natural Computing, ISSN 1567-7818, E-ISSN 1572-9796, Vol. 10, no 4, 1407-1430 p.Article in journal (Refereed) Published
Abstract [en]

A local search method is often introduced in an evolutionary optimization algorithm, to enhance its speed and accuracy of convergence to optimal solutions. In multi-objective optimization problems, the implementation of local search is a non-trivial task, as determining a goal for local search in presence of multiple conflicting objectives becomes a difficult task. In this paper, we borrow a multiple criteria decision making concept of employing a reference point based approach of minimizing an achievement scalarizing function and integrate it as a search operator with a concurrent approach in an evolutionary multi-objective algorithm. Simulation results of the new concurrent-hybrid algorithm on several two to four-objective problems compared to a serial approach, clearly show the importance of local search in aiding a computationally faster and accurate convergence to the Pareto optimal front.

Place, publisher, year, edition, pages
Springer, 2011. Vol. 10, no 4, 1407-1430 p.
Keyword [en]
Multicriteria optimization; Multiple criteria decision making; Pareto optimality; Evolutionary algorithms; Hybrid algorithms; Achievement scalarizing functions; NSGA-II
National Category
Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-70135DOI: 10.1007/s11047-011-9250-4ISI: 000297243700011OAI: oai:DiVA.org:kth-70135DiVA: diva2:485952
Note
Qc 20120207Available from: 2012-02-07 Created: 2012-01-30 Last updated: 2017-12-08Bibliographically approved

Open Access in DiVA

fulltext(591 kB)363 downloads
File information
File name FULLTEXT01.pdfFile size 591 kBChecksum SHA-512
39d6c33ca4f4d4547172a35b6d4e0a81303bfcf23b1a1cb1634ded4cfb34951b5d22c087ec2f3ba300535caafb7238194bfb3364a3ed4246668c38e434e4d14d
Type fulltextMimetype application/pdf

Other links

Publisher's full textThe final publication is available at www.springerlink.com

Search in DiVA

By author/editor
Miettinen, Kaisa
In the same journal
Natural Computing
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 363 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 68 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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