How to know it is “the one”? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization
Elif Göksu Öztürk (),
Ana Maria Rodrigues (),
José Soeiro Ferreira () and
Cristina Teles Oliveira ()
Operations Research and Decisions, 2024, vol. 34, issue 1, 211-232
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.
Keywords: AHP; Pareto frontier; selection; decision making; sectorization (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://ord.pwr.edu.pl/assets/papers_archive/ord2024vol34no1_11.pdf (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:wut:journl:v:34:y:2024:i:1:p:211-232:id:11
DOI: 10.37190/ord240111
Access Statistics for this article
More articles in Operations Research and Decisions from Wroclaw University of Science and Technology, Faculty of Management Contact information at EDIRC.
Bibliographic data for series maintained by Adam Kasperski ().