IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i10p1822-d430515.html
   My bibliography  Save this article

A Set Based Newton Method for the Averaged Hausdorff Distance for Multi-Objective Reference Set Problems

Author

Listed:
  • Lourdes Uribe

    (Instituto Politécnico Nacional, Mexico City 07738, Mexico)

  • Johan M Bogoya

    (Departamento de Matemáticas, Pontificia Universidad Javeriana, Cra. 7 N. 40-62, Bogotá D.C. 111321, Colombia)

  • Andrés Vargas

    (Departamento de Matemáticas, Pontificia Universidad Javeriana, Cra. 7 N. 40-62, Bogotá D.C. 111321, Colombia)

  • Adriana Lara

    (Instituto Politécnico Nacional, Mexico City 07738, Mexico)

  • Günter Rudolph

    (Department of Computer Science, TU Dortmund University, 44227 Dortmund, Germany)

  • Oliver Schütze

    (Department of Computer Science, Cinvestav-IPN, Mexico City 07360, Mexico)

Abstract

Multi-objective optimization problems (MOPs) naturally arise in many applications. Since for such problems one can expect an entire set of optimal solutions, a common task in set based multi-objective optimization is to compute N solutions along the Pareto set/front of a given MOP. In this work, we propose and discuss the set based Newton methods for the performance indicators Generational Distance (GD), Inverted Generational Distance (IGD), and the averaged Hausdorff distance Δ p for reference set problems for unconstrained MOPs. The methods hence directly utilize the set based scalarization problems that are induced by these indicators and manipulate all N candidate solutions in each iteration. We demonstrate the applicability of the methods on several benchmark problems, and also show how the reference set approach can be used in a bootstrap manner to compute Pareto front approximations in certain cases.

Suggested Citation

  • Lourdes Uribe & Johan M Bogoya & Andrés Vargas & Adriana Lara & Günter Rudolph & Oliver Schütze, 2020. "A Set Based Newton Method for the Averaged Hausdorff Distance for Multi-Objective Reference Set Problems," Mathematics, MDPI, vol. 8(10), pages 1-29, October.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:10:p:1822-:d:430515
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/10/1822/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/10/1822/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Benjamin Martin & Alexandre Goldsztejn & Laurent Granvilliers & Christophe Jermann, 2016. "On continuation methods for non-linear bi-objective optimization: towards a certified interval-based approach," Journal of Global Optimization, Springer, vol. 64(1), pages 3-16, January.
    2. Cui, Yunfei & Geng, Zhiqiang & Zhu, Qunxiong & Han, Yongming, 2017. "Review: Multi-objective optimization methods and application in energy saving," Energy, Elsevier, vol. 125(C), pages 681-704.
    3. Beume, Nicola & Naujoks, Boris & Emmerich, Michael, 2007. "SMS-EMOA: Multiobjective selection based on dominated hypervolume," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1653-1669, September.
    4. M. Dellnitz & O. Schütze & T. Hestermeyer, 2005. "Covering Pareto Sets by Multilevel Subdivision Techniques," Journal of Optimization Theory and Applications, Springer, vol. 124(1), pages 113-136, January.
    5. Maria Cristina Recchioni, 2003. "A path following method for box-constrained multiobjective optimization with applications to goal programming problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(1), pages 69-85, September.
    6. Matthias Ehrgott, 2005. "Multicriteria Optimization," Springer Books, Springer, edition 0, number 978-3-540-27659-3, July.
    Full references (including those not matched with items on IDEAS)

    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. Oliver Cuate & Oliver Schütze, 2020. "Pareto Explorer for Finding the Knee for Many Objective Optimization Problems," Mathematics, MDPI, vol. 8(10), pages 1-24, September.
    2. Braun, Marlon & Shukla, Pradyumn, 2024. "On cone-based decompositions of proper Pareto-optimality in multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 317(2), pages 592-602.
    3. Paritosh Jha & Marco Cucculelli, 2023. "Enhancing the predictive performance of ensemble models through novel multi-objective strategies: evidence from credit risk and business model innovation survey data," Annals of Operations Research, Springer, vol. 325(2), pages 1029-1047, June.
    4. Li, Shunxi & Su, Bowen & St-Pierre, David L. & Sui, Pang-Chieh & Zhang, Guofang & Xiao, Jinsheng, 2017. "Decision-making of compressed natural gas station siting for public transportation: Integration of multi-objective optimization, fuzzy evaluating, and radar charting," Energy, Elsevier, vol. 140(P1), pages 11-17.
    5. Ma, Yixiang & Yu, Lean & Zhang, Guoxing & Lu, Zhiming & Wu, Jiaqian, 2023. "Source-load uncertainty-based multi-objective multi-energy complementary optimal scheduling," Renewable Energy, Elsevier, vol. 219(P1).
    6. Fang, Ping & Fu, Wenlong & Wang, Kai & Xiong, Dongzhen & Zhang, Kai, 2022. "A compositive architecture coupling outlier correction, EWT, nonlinear Volterra multi-model fusion with multi-objective optimization for short-term wind speed forecasting," Applied Energy, Elsevier, vol. 307(C).
    7. Liagkouras, Konstantinos & Metaxiotis, Konstantinos, 2021. "Improving multi-objective algorithms performance by emulating behaviors from the human social analogue in candidate solutions," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1019-1036.
    8. Yichen Lu & Chao Yang & Jun Yang, 2022. "A multi-objective humanitarian pickup and delivery vehicle routing problem with drones," Annals of Operations Research, Springer, vol. 319(1), pages 291-353, December.
    9. Wu, Weitiao & Lin, Yue & Liu, Ronghui & Jin, Wenzhou, 2022. "The multi-depot electric vehicle scheduling problem with power grid characteristics," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 322-347.
    10. You, Junyu & Ampomah, William & Sun, Qian, 2020. "Co-optimizing water-alternating-carbon dioxide injection projects using a machine learning assisted computational framework," Applied Energy, Elsevier, vol. 279(C).
    11. 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.
    12. Fonseca, Juan D. & Commenge, Jean-Marc & Camargo, Mauricio & Falk, Laurent & Gil, Iván D., 2021. "Sustainability analysis for the design of distributed energy systems: A multi-objective optimization approach," Applied Energy, Elsevier, vol. 290(C).
    13. Changyu Zhou & Guohe Huang & Jiapei Chen, 2019. "A Type-2 Fuzzy Chance-Constrained Fractional Integrated Modeling Method for Energy System Management of Uncertainties and Risks," Energies, MDPI, vol. 12(13), pages 1-21, June.
    14. Bogdana Stanojević & Milan Stanojević & Sorin Nădăban, 2021. "Reinstatement of the Extension Principle in Approaching Mathematical Programming with Fuzzy Numbers," Mathematics, MDPI, vol. 9(11), pages 1-16, June.
    15. Gong, Wenyin & Cai, Zhihua, 2009. "An improved multiobjective differential evolution based on Pareto-adaptive [epsilon]-dominance and orthogonal design," European Journal of Operational Research, Elsevier, vol. 198(2), pages 576-601, October.
    16. Stelios Rozakis & Athanasios Kampas, 2022. "An interactive multi-criteria approach to admit new members in international environmental agreements," Operational Research, Springer, vol. 22(4), pages 3461-3487, September.
    17. Andrea Ponti & Antonio Candelieri & Ilaria Giordani & Francesco Archetti, 2023. "Intrusion Detection in Networks by Wasserstein Enabled Many-Objective Evolutionary Algorithms," Mathematics, MDPI, vol. 11(10), pages 1-14, May.
    18. David Quintana & Roman Denysiuk & Sandra García-Rodríguez & Antonio Gaspar-Cunha, 2017. "Portfolio implementation risk management using evolutionary multiobjective optimization," Post-Print hal-01881379, HAL.
    19. Manuel V. C. Vieira & Margarida Carvalho, 2023. "Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer," 4OR, Springer, vol. 21(3), pages 491-512, September.
    20. Miglierina, E. & Molho, E. & Recchioni, M.C., 2008. "Box-constrained multi-objective optimization: A gradient-like method without "a priori" scalarization," European Journal of Operational Research, Elsevier, vol. 188(3), pages 662-682, August.

    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:gam:jmathe:v:8:y:2020:i:10:p:1822-:d:430515. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.