Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > How to know it is the one? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization
Publication

Publications

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

Title
How to know it is the one? Selecting the most suitable solution from the Pareto optimal set. Application to sectorization
Type
Article in International Scientific Journal
Year
2024
Authors
Öztürk, EG
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Rodrigues, AM
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Oliveira, CT
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 34
Pages: 211-232
ISSN: 2081-8858
Indexing
Publicação em ISI Web of Knowledge ISI Web of Knowledge - 0 Citations
Publicação em Scopus Scopus - 0 Citations
Other information
Authenticus ID: P-010-4DS
Abstract (EN): 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.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 22
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

DEFINING A STORAGE-ASSIGNMENT STRATEGY FOR PRECEDENCE-CONSTRAINED ORDER PICKING (2021)
Article in International Scientific Journal
Trindade, MAM; Sousa, PSA; Moreira, MRA
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-25 at 03:40:40 | Privacy Policy | Personal Data Protection Policy | Whistleblowing