University of Jyväskylä | JYX Digital Repository

  • English  | Give feedback |
    • suomi
    • English
 
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
View Item 
  • JYX
  • Opinnäytteet
  • Väitöskirjat
  • View Item
JYX > Opinnäytteet > Väitöskirjat > View Item

On approaches for solving computationally expensive multiobjective optimization problems

Thumbnail
View/Open
8.5 Mb

Downloads:  
Show download detailsHide download details  
Published in
Jyväskylä studies in computing
Authors
Tabatabaei, Seyed Mohammad Mehdi
Date
2016
Discipline
Tietotekniikka

 
In this thesis, we consider solving computationally expensive multiobjective optimization problems that take into account the preferences of a decision maker (DM). The aim is to support the DM in identifying the most preferred solution for problems that have several conflicting objectives and when the evaluation of the candidate solutions is time consuming. This is conducted by replacing computationally expensive functions with computationally inexpensive functions, known as surrogates. First, based on a literature survey, we introduce two frameworks, i.e., a sequential and an adaptive framework, based on which surrogate-based methods are classified and compared. We then identify relevant challenges that warrant more research efforts. In order to deal with the challenges, we develop two surrogate-based methods: SURROGATE-ASF and ANOVA- MOP. As an interactive method, SURROGATE-ASF has two phases: initialization and decision-making. In the first phase, the decision space is decomposed into a finite number of hyper-boxes. For each hyper-box, a single-objective surrogate problem is built. By solving an appropriate surrogate problem in the latter phase, a solution corresponding to the preferences of the DM is obtained. Numerical results support that SURROGATE- ASF can solve problems with at most 12 decision variables, 5 objective functions and nonconvex and/or disconnected sets of Pareto optimal solutions. To solve problems with high-dimensional decision and objective spaces, we develop the ANOVA-MOP method. Based on information obtained from sensitivity analysis, a problem is decomposed into a few sub-problems with low-dimensional decision and objective spaces. These sub-problems are solved, and the solutions obtained are composed to form approximated solutions for the original problem. ANOVA-MOP can be applied either as a non-interactive or an interactive method. Finally, we discuss the potential of a new metamodeling technique, called T-splines, to be incorporated into ANOVA-MOP to solve problems including non-differentiable functions. By applying the methods developed in this thesis, we extend the applicability of interactive methods to solving computationally expensive problems. ...
Publisher
University of Jyväskylä
ISBN
978-951-39-6861-8
ISSN Search the Publication Forum
1456-5390
Keywords
monitavoiteoptimointi laskennallinen vaativuus sijaismalli hajotelma multiobjective optimization decision-making computational cost surrogate decomposition matemaattinen optimointi pareto-tehokkuus päätöksenteko
URI

http://urn.fi/URN:ISBN:978-951-39-6861-8

Metadata
Show full item record
Collections
  • Väitöskirjat [3076]

Related items

Showing items with similar title or keywords.

  • Handling expensive multiobjective optimization problems with evolutionary algorithms 

    Chugh, Tinkle (University of Jyväskylä, 2017)
    Multiobjective optimization problems (MOPs) with a large number of conflicting objectives are often encountered in industry. Moreover, these problem typically involve expensive evaluations (e.g. time consuming simulations ...
  • Approximation method for computationally expensive nonconvex multiobjective optimization problems 

    Haanpää, Tomi (University of Jyväskylä, 2012)
  • On solving computationally expensive multiobjective optimization problems with interactive methods 

    Ojalehto, Vesa (University of Jyväskylä, 2014)
  • A Surrogate-assisted Reference Vector Guided Evolutionary Algorithm for Computationally Expensive Many-objective Optimization 

    Chugh, Tinkle; Jin, Yaochu; Miettinen, Kaisa; Hakanen, Jussi; Sindhya, Karthik (Institute of Electrical and Electronics Engineers, 2018)
    We propose a surrogate-assisted reference vector guided evolutionary algorithm (EA) for computationally expensive optimization problems with more than three objectives. The proposed algorithm is based on a recently developed ...
  • An interactive surrogate-based method for computationally expensive multiobjective optimisation 

    Tabatabaei, Mohammad; Hartikainen, Markus; Sindhya, Karthik; Hakanen, Jussi; Miettinen, Kaisa (Palgrave Macmillan Ltd., 2019)
    Many disciplines involve computationally expensive multiobjective optimisation problems. Surrogate-based methods are commonly used in the literature to alleviate the computational cost. In this paper, we develop an interactive ...
  • Browse materials
  • Browse materials
  • Articles
  • Conferences and seminars
  • Electronic books
  • Historical maps
  • Journals
  • Tunes and musical notes
  • Photographs
  • Presentations and posters
  • Publication series
  • Research reports
  • Research data
  • Study materials
  • Theses

Browse

All of JYXCollection listBy Issue DateAuthorsSubjectsPublished inDepartmentDiscipline

My Account

Login

Statistics

View Usage Statistics
  • How to publish in JYX?
  • Self-archiving
  • Publish Your Thesis Online
  • Publishing Your Dissertation
  • Publication services

Open Science at the JYU
 
Data Protection Description

Accessibility Statement

Unless otherwise specified, publicly available JYX metadata (excluding abstracts) may be freely reused under the CC0 waiver.
Open Science Centre