IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v34y2024i1p211-232id11.html
   My bibliography  Save this article

How to know it is “the one”? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization

Author

Listed:
  • Elif Göksu Öztürk
  • Ana Maria Rodrigues
  • José Soeiro Ferreira
  • Cristina Teles Oliveira

Abstract

Multi-objective optimization (MOO) considers several objectives to find a feasible set of solutions. Selecting a solution from Pareto frontier (PF) solutions requires further effort. This work proposes a new classification procedure that fits into the analytic hierarchy Process (AHP) to pick the best solution. The method classifies PF solutions using pairwise comparison matrices for each objective. Sectorization is the problem of splitting a region into smaller sectors based on multiple objectives. The efficacy of the proposed method is tested in such problems using our instances and real data from a Portuguese delivery company. A non-dominated sorting genetic algorithm (NSGA-II) is used to obtain PF solutions based on three objectives. The proposed method rapidly selects an appropriate solution. The method was assessed by comparing it with a method based on a weighted composite single-objective function.

Suggested Citation

  • Elif Göksu Öztürk & Ana Maria Rodrigues & José Soeiro Ferreira & Cristina Teles Oliveira, 2024. "How to know it is “the one”? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(1), pages 211-232.
    • Handle: RePEc:wut:journl:v:34:y:2024:i:1:p:211-232:id:11
    DOI: 10.37190/ord240111
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/ord2024vol34no1_11.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.37190/ord240111?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
    ---><---

    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:wut:journl:v:34:y:2024:i:1:p:211-232:id:11. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.html .

    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.