Issue: 2024/Vol.34/No.1, Pages 211-232
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 , Cristina Teles Oliveira
Cite as: E. G. Öztürk, A. M. Rodrigues, J. S. Ferreira, C. T. Oliveira. How to know it is “the one”? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization. Operations Research and Decisions 2024: 34(1), 211-232. DOI 10.37190/ord240111
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
Received: 15 February 2023 Accepted: 12 January 2023
Published online: 28 March 2024