IDEAS home Printed from https://ideas.repec.org/p/ete/kbiper/629347.html
   My bibliography  Save this paper

A stochastic-kriging-based multiobjective simulation optimization algorithm

Author

Listed:
  • S Rojas Gonzalez
  • Inneke Van Nieuwenhuyse

Abstract

We consider the multiobjective simulation optimization problem, where we seek to find the non-dominated set of designs evaluated using noisy simulation evaluations, in the context of numerically expensive simulators. We propose SKMOCBA, a metamodel-based approach built upon the famous ParEGO algorithm. Our approach mainly differentiates from similar algorithms in that we use stochastic kriging, which explicitly characterizes both the extrinsic uncertainty of the unknown response surface, and the intrinsic uncertainty inherent in a stochastic simulation. We additionally integrate the Multiobjective Optimal Computing Budget Allocation (MOCBA) procedure in view of maximizing the probability of selecting systems with the true best expected performance. We evaluate the performance of the algorithm using standard test functions for multiobjective optimizers, perturbed by heterogeneous noise. The experimental results show that the proposed method outperforms its deterministic counterpart based on well-known quality indicators and the members of the true Pareto set found. In addition, we measure the impact of using MOCBA to improve the accuracy of the algorithm during the identification of the observed Pareto front.

Suggested Citation

  • S Rojas Gonzalez & Inneke Van Nieuwenhuyse, 2018. "A stochastic-kriging-based multiobjective simulation optimization algorithm," Working Papers of Department of Decision Sciences and Information Management, Leuven 629347, KU Leuven, Faculty of Economics and Business (FEB), Department of Decision Sciences and Information Management, Leuven.
  • Handle: RePEc:ete:kbiper:629347
    Note: paper number KBI_1814
    as

    Download full text from publisher

    File URL: https://lirias.kuleuven.be/retrieve/521753
    File Function: Published version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ete:kbiper:629347. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: library EBIB (email available below). General contact details of provider: https://feb.kuleuven.be/KBI .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.