IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v240y2016i1d10.1007_s10479-015-2017-z.html
   My bibliography  Save this article

Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization

Author

Listed:
  • Carlos Segura

    (Área de Computación)

  • Carlos A. Coello Coello

    (CINVESTAV-IPN)

  • Gara Miranda

    (Universidad de La Laguna)

  • Coromoto León

    (Universidad de La Laguna)

Abstract

In recent decades, several multi-objective evolutionary algorithms have been successfully applied to a wide variety of multi-objective optimization problems. Along the way, several new concepts, paradigms and methods have emerged. Additionally, some authors have claimed that the application of multi-objective approaches might be useful even in single-objective optimization. Thus, several guidelines for solving single-objective optimization problems using multi-objective methods have been proposed. This paper offers an updated survey of the main methods that allow the use of multi-objective schemes for single-objective optimization. In addition, several open topics and some possible paths of future work in this area are identified.

Suggested Citation

  • Carlos Segura & Carlos A. Coello Coello & Gara Miranda & Coromoto León, 2016. "Using multi-objective evolutionary algorithms for single-objective constrained and unconstrained optimization," Annals of Operations Research, Springer, vol. 240(1), pages 217-250, May.
    • Handle: RePEc:spr:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2017-z
    DOI: 10.1007/s10479-015-2017-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-015-2017-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-015-2017-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lochtefeld, Darrell F. & Ciarallo, Frank W., 2015. "Multi-objectivization Via Decomposition: An analysis of helper-objectives and complete decomposition," European Journal of Operational Research, Elsevier, vol. 243(2), pages 395-404.
    2. Garza-Fabre, Mario & Toscano-Pulido, Gregorio & Rodriguez-Tello, Eduardo, 2015. "Multi-objectivization, fitness landscape transformation and search performance: A case of study on the hp model for protein structure prediction," European Journal of Operational Research, Elsevier, vol. 243(2), pages 405-422.
    3. Eduardo Segredo & Carlos Segura & Coromoto León, 2014. "Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem," Journal of Global Optimization, Springer, vol. 58(4), pages 769-794, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ji, Bin & Zhang, Binqiao & Yu, Samson S. & Zhang, Dezhi & Yuan, Xiaohui, 2021. "An enhanced Borg algorithmic framework for solving the hydro-thermal-wind Co-scheduling problem," Energy, Elsevier, vol. 218(C).
    2. Adeel, Muhammad & Hassan, Ahmad Kamal & Sher, Hadeed Ahmed & Murtaza, Ali Faisal, 2021. "A grade point average assessment of analytical and numerical methods for parameter extraction of a practical PV device," Renewable and Sustainable Energy Reviews, Elsevier, vol. 142(C).
    3. Fernanda Nakano Kazama & Aluizio Fausto Ribeiro Araujo & Paulo Barros Correia & Elaine Guerrero-Peña, 2021. "Constraint-guided evolutionary algorithm for solving the winner determination problem," Journal of Heuristics, Springer, vol. 27(6), pages 1111-1150, December.
    4. Gabriele Eichfelder & Kathrin Klamroth & Julia Niebling, 2021. "Nonconvex constrained optimization by a filtering branch and bound," Journal of Global Optimization, Springer, vol. 80(1), pages 31-61, May.
    5. Han, Xiaojuan & Liu, Dahe & Liu, Jian & Kong, Lingda, 2017. "Sensitivity analysis of acquisition granularity of photovoltaic output power to capacity configuration of energy storage systems," Applied Energy, Elsevier, vol. 203(C), pages 794-807.
    6. Mohammed Mahrach & Gara Miranda & Coromoto León & Eduardo Segredo, 2020. "Comparison between Single and Multi-Objective Evolutionary Algorithms to Solve the Knapsack Problem and the Travelling Salesman Problem," Mathematics, MDPI, vol. 8(11), pages 1-23, November.
    7. Gloria Milena Vargas Gil & Lucas Lima Rodrigues & Roberto S. Inomoto & Alfeu J. Sguarezi & Renato Machado Monaro, 2019. "Weighted-PSO Applied to Tune Sliding Mode Plus PI Controller Applied to a Boost Converter in a PV System," Energies, MDPI, vol. 12(5), pages 1-18, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rodriguez-Tello, Eduardo & Lardeux, Frédéric & Duarte, Abraham & Narvaez-Teran, Valentina, 2019. "Alternative evaluation functions for the cyclic bandwidth sum problem," European Journal of Operational Research, Elsevier, vol. 273(3), pages 904-919.
    2. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    3. Zhang, Yue & Zhang, Qi & Farnoosh, Arash & Chen, Siyuan & Li, Yan, 2019. "GIS-Based Multi-Objective Particle Swarm Optimization of charging stations for electric vehicles," Energy, Elsevier, vol. 169(C), pages 844-853.
    4. Drake, John H. & Kheiri, Ahmed & Özcan, Ender & Burke, Edmund K., 2020. "Recent advances in selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 405-428.

    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:spr:annopr:v:240:y:2016:i:1:d:10.1007_s10479-015-2017-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.