his.sePublications
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
Parameter Tuning of MOEAs Using a Bilevel Optimization Approach
University of Skövde, School of Engineering Science. University of Skövde, The Virtual Systems Research Centre. (Produktion och automatiseringsteknik, Production and Automation Engineering)
University of Skövde, School of Engineering Science. University of Skövde, The Virtual Systems Research Centre. (Produktion och automatiseringsteknik, Production and Automation Engineering)ORCID iD: 0000-0001-5436-2128
University of Skövde, School of Engineering Science. University of Skövde, The Virtual Systems Research Centre. (Produktion och automatiseringsteknik, Production and Automation Engineering)ORCID iD: 0000-0003-0111-1776
University of Skövde, School of Engineering Science. University of Skövde, The Virtual Systems Research Centre. (Produktion och automatiseringsteknik, Production and Automation Engineering)ORCID iD: 0000-0003-3973-3394
2015 (English)In: Evolutionary Multi-Criterion Optimization: 8th International Conference, EMO 2015, Guimarães, Portugal, March 29 --April 1, 2015. Proceedings, Part I / [ed] António Gaspar-Cunha, Carlos Henggeler Antunes & Carlos Coello Coello, Springer, 2015, p. 233-247Conference paper, Published paper (Refereed)
Abstract [en]

The performance of an Evolutionary Algorithm (EA) can be greatly influenced by its parameters. The optimal parameter settings are also not necessarily the same across different problems. Finding the optimal set of parameters is therefore a difficult and often time-consuming task. This paper presents results of parameter tuning experiments on the NSGA-II and NSGA-III algorithms using the ZDT test problems. The aim is to gain new insights on the characteristics of the optimal parameter settings and to study if the parameters impose the same effect on both NSGA-II and NSGA-III. The experiments also aim at testing if the rule of thumb that the mutation probability should be set to one divided by the number of decision variables is a good heuristic on the ZDT problems. A comparison of the performance of NSGA-II and NSGA-III on the ZDT problems is also made.

Place, publisher, year, edition, pages
Springer, 2015. p. 233-247
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9018
Keywords [en]
Parameter tuning, NSGA-II, NSGA-III, ZDT, Bilevel optimization, Multi-objective problems
National Category
Computer and Information Sciences
Research subject
Technology; Production and Automation Engineering
Identifiers
URN: urn:nbn:se:his:diva-11371DOI: 10.1007/978-3-319-15934-8_16ISI: 000361702100016Scopus ID: 2-s2.0-84925342559ISBN: 978-3-319-15933-1 ISBN: 978-3-319-15934-8 OAI: oai:DiVA.org:his-11371DiVA, id: diva2:846920
Conference
8th International Conference on Evolutionary Multi-Criterion Optimization, 29 March-1 April 2015, Guimarães, Portugal
Available from: 2015-08-18 Created: 2015-08-18 Last updated: 2018-11-07Bibliographically approved
In thesis
1. A bilevel approach to parameter tuning of optimization algorithms using evolutionary computing: Understanding optimization algorithms through optimization
Open this publication in new window or tab >>A bilevel approach to parameter tuning of optimization algorithms using evolutionary computing: Understanding optimization algorithms through optimization
2018 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Most optimization problems found in the real world cannot be solved using analytical methods. For these types of difficult optimization problems, an alternative approach is needed. Metaheuristics are a category of optimization algorithms that do not guarantee that an optimal solution will be found, but instead search for the best solutions using some general heuristics. Metaheuristics have been shown to be effective at finding “good-enough” solutions to a wide variety of difficult problems. Most metaheuristics involve control parameters that can be used to modify how the heuristics perform its search. This is necessary because different problems may require different search strategies to be solved effectively. The control parameters allow for the optimization algorithm to be adapted to the problem at hand. It is, however, difficult to predict what the optimal control parameters are for any given problem. The problem of finding these optimal control parameter values is known as parameter tuning and is the main topic of this thesis. This thesis uses a bilevel optimization approach to solve parameter tuning problems. In this approach, the parameter tuning problem itself is formulated as an optimization problem and solved with an optimization algorithm. The parameter tuning problem formulated as a bilevel optimization problem is challenging because of nonlinear objective functions, interacting variables, multiple local optima, and noise. However, it is in precisely this kind of difficult optimization problem that evolutionary algorithms, which are a subclass of metaheuristics, have been shown to be effective. That is the motivation for using evolutionary algorithms for the upper-level optimization (i.e. tuning algorithm) of the bilevel optimization approach. Solving the parameter tuning problem using a bilevel optimization approach is also computationally expensive, since a complete optimization run has to be completed for every evaluation of a set of control parameter values. It is therefore important that the tuning algorithm be as efficient as possible, so that the parameter tuning problem can be solved to a satisfactory level with relatively few evaluations. Even so, bilevel optimization experiments can take a long time to run on a single computer. There is, however, considerable parallelization potential in the bilevel optimization approach, since many of the optimizations are independent of one another. This thesis has three primary aims: first, to present a bilevel optimization framework and software architecture for parallel parameter tuning; second, to use this framework and software architecture to evaluate and configure evolutionary algorithms as tuners and compare them with other parameter tuning methods; and, finally, to use parameter tuning experiments to gain new insights into and understanding of how optimization algorithms work and how they can used be to their maximum potential. The proposed framework and software architecture have been implemented and deployed in more than one hundred computers running many thousands of parameter tuning experiments for many millions of optimizations. This illustrates that this design and implementation approach can handle large parameter tuning experiments. Two types of evolutionary algorithms, i.e. differential evolution (DE) and a genetic algorithm (GA), have been evaluated as tuners against the parameter tuning algorithm irace. The as pects of algorithm configuration and noise handling for DE and the GA as related to the parameter tuning problem were also investigated. The results indicate that dynamic resampling strategies outperform static resampling strategies. It was also shown that the GA needs an explicit exploration and exploitation strategy in order not become stuck in local optima. The comparison with irace shows that both DE and the GA can significantly outperform it in a variety of different tuning problems.

Place, publisher, year, edition, pages
Skövde: University of Skövde, 2018. p. 210
Series
Dissertation Series ; 25
National Category
Information Systems, Social aspects
Research subject
Production and Automation Engineering
Identifiers
urn:nbn:se:his:diva-16368 (URN)978-91-984187-7-4 (ISBN)
Public defence
2018-09-24, ASSAR Industrial Innovation Arena, Skövde, 10:00
Opponent
Supervisors
Available from: 2018-11-15 Created: 2018-11-07 Last updated: 2018-11-15Bibliographically approved

Open Access in DiVA

fulltext(846 kB)454 downloads
File information
File name FULLTEXT01.pdfFile size 846 kBChecksum SHA-512
345e9a7f72ac2fe48f2418c2afa6e983c2c7cf08ba7fd4efbdd7c730fc13f43a0bdbc975852141de2eca5663042e3a59c9966c90dd61c980c26ddd4e0b1bea42
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Andersson, MartinBandaru, SunithNg, Amos H. C.Syberfeldt, Anna

Search in DiVA

By author/editor
Andersson, MartinBandaru, SunithNg, Amos H. C.Syberfeldt, Anna
By organisation
School of Engineering ScienceThe Virtual Systems Research Centre
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 454 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
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1283 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