IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/9474580.html
   My bibliography  Save this article

A Kriging Model-Based Expensive Multiobjective Optimization Algorithm Using R2 Indicator of Expectation Improvement

Author

Listed:
  • Ding Han
  • Jianrong Zheng

Abstract

Most of the multiobjective optimization problems in engineering involve the evaluation of expensive objectives and constraint functions, for which an approximate model-based multiobjective optimization algorithm is usually employed, but requires a large amount of function evaluation. Aiming at effectively reducing the computation cost, a novel infilling point criterion EIR2 is proposed, whose basic idea is mapping a point in objective space into a set in expectation improvement space and utilizing the R2 indicator of the set to quantify the fitness of the point being selected as an infilling point. This criterion has an analytic form regardless of the number of objectives and demands lower calculation resources. Combining the Kriging model, optimal Latin hypercube sampling, and particle swarm optimization, an algorithm, EIR2-MOEA, is developed for solving expensive multiobjective optimization problems and applied to three sets of standard test functions of varying difficulty and comparing with two other competitive infill point criteria. Results show that EIR2 has higher resource utilization efficiency, and the resulting nondominated solution set possesses good convergence and diversity. By coupling with the average probability of feasibility, the EIR2 criterion is capable of dealing with expensive constrained multiobjective optimization problems and its efficiency is successfully validated in the optimal design of energy storage flywheel.

Suggested Citation

  • Ding Han & Jianrong Zheng, 2020. "A Kriging Model-Based Expensive Multiobjective Optimization Algorithm Using R2 Indicator of Expectation Improvement," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-16, June.
  • Handle: RePEc:hin:jnlmpe:9474580
    DOI: 10.1155/2020/9474580
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/9474580.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/9474580.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/9474580?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    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:hin:jnlmpe:9474580. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.