A comparison among optimization software to solve bi-objective sectorization problem

Detalhes bibliográficos
Autor(a) principal: Teymourifar, Aydin
Data de Publicação: 2023
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10400.14/41995
Resumo: In this study, we compare the performance of optimization software to solve the bi-objective sectorization problem. The used solution method is based on an approach that has not been used before in the literature on sectorization, in which, the bi-objective model is transformed into single-objective ones, whose results are regarded as ideal points for the objective functions in the bi-objective model. Anti-ideal points are also searched similarly. Then, using the ideal and anti-ideal points, the bi-objective model is redefined as a single-objective one and solved. The difficulties of solving the models, which are basically non-linear, are discussed. Furthermore, the models are linearized, in which case how the number of variables and constraints changes is discussed. Mathematical models are implemented in Python's Pulp library, Lingo, IBM ILOG CPLEX Optimization Studio, and GAMS software, and the obtained results are presented. Furthermore, metaheuristics available in Python's Pymoo library are utilized to solve the models' single- and bi-objective versions. In the experimental results section, benchmarks of different sizes are derived for the problem, and the results are presented. It is observed that the solvers do not perform satisfactorily in solving models; of all of them, GAMS achieves the best results. The utilized metaheuristics from the Pymoo library gain feasible results in reasonable times. In the conclusion section, suggestions are given for solving similar problems. Furthermore, this article summarizes the managerial applications of the sectorization problems.
id RCAP_1fa21fefe4d8e7ea5dafef9fac026565
oai_identifier_str oai:repositorio.ucp.pt:10400.14/41995
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A comparison among optimization software to solve bi-objective sectorization problemMulti-objective optimizationSectorizationMixed integer non-linear programmingGAMSCPLEXLingoPythonPulpPymooGANSGA-IIIn this study, we compare the performance of optimization software to solve the bi-objective sectorization problem. The used solution method is based on an approach that has not been used before in the literature on sectorization, in which, the bi-objective model is transformed into single-objective ones, whose results are regarded as ideal points for the objective functions in the bi-objective model. Anti-ideal points are also searched similarly. Then, using the ideal and anti-ideal points, the bi-objective model is redefined as a single-objective one and solved. The difficulties of solving the models, which are basically non-linear, are discussed. Furthermore, the models are linearized, in which case how the number of variables and constraints changes is discussed. Mathematical models are implemented in Python's Pulp library, Lingo, IBM ILOG CPLEX Optimization Studio, and GAMS software, and the obtained results are presented. Furthermore, metaheuristics available in Python's Pymoo library are utilized to solve the models' single- and bi-objective versions. In the experimental results section, benchmarks of different sizes are derived for the problem, and the results are presented. It is observed that the solvers do not perform satisfactorily in solving models; of all of them, GAMS achieves the best results. The utilized metaheuristics from the Pymoo library gain feasible results in reasonable times. In the conclusion section, suggestions are given for solving similar problems. Furthermore, this article summarizes the managerial applications of the sectorization problems.Veritati - Repositório Institucional da Universidade Católica PortuguesaTeymourifar, Aydin2023-07-31T15:55:54Z2023-08-012023-08-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.14/41995eng2405-844010.1016/j.heliyon.2023.e186028516666262237576245001051823200001info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-09-19T01:41:52Zoai:repositorio.ucp.pt:10400.14/41995Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:10:21.951950Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A comparison among optimization software to solve bi-objective sectorization problem
title A comparison among optimization software to solve bi-objective sectorization problem
spellingShingle A comparison among optimization software to solve bi-objective sectorization problem
Teymourifar, Aydin
Multi-objective optimization
Sectorization
Mixed integer non-linear programming
GAMS
CPLEX
Lingo
Python
Pulp
Pymoo
GA
NSGA-II
title_short A comparison among optimization software to solve bi-objective sectorization problem
title_full A comparison among optimization software to solve bi-objective sectorization problem
title_fullStr A comparison among optimization software to solve bi-objective sectorization problem
title_full_unstemmed A comparison among optimization software to solve bi-objective sectorization problem
title_sort A comparison among optimization software to solve bi-objective sectorization problem
author Teymourifar, Aydin
author_facet Teymourifar, Aydin
author_role author
dc.contributor.none.fl_str_mv Veritati - Repositório Institucional da Universidade Católica Portuguesa
dc.contributor.author.fl_str_mv Teymourifar, Aydin
dc.subject.por.fl_str_mv Multi-objective optimization
Sectorization
Mixed integer non-linear programming
GAMS
CPLEX
Lingo
Python
Pulp
Pymoo
GA
NSGA-II
topic Multi-objective optimization
Sectorization
Mixed integer non-linear programming
GAMS
CPLEX
Lingo
Python
Pulp
Pymoo
GA
NSGA-II
description In this study, we compare the performance of optimization software to solve the bi-objective sectorization problem. The used solution method is based on an approach that has not been used before in the literature on sectorization, in which, the bi-objective model is transformed into single-objective ones, whose results are regarded as ideal points for the objective functions in the bi-objective model. Anti-ideal points are also searched similarly. Then, using the ideal and anti-ideal points, the bi-objective model is redefined as a single-objective one and solved. The difficulties of solving the models, which are basically non-linear, are discussed. Furthermore, the models are linearized, in which case how the number of variables and constraints changes is discussed. Mathematical models are implemented in Python's Pulp library, Lingo, IBM ILOG CPLEX Optimization Studio, and GAMS software, and the obtained results are presented. Furthermore, metaheuristics available in Python's Pymoo library are utilized to solve the models' single- and bi-objective versions. In the experimental results section, benchmarks of different sizes are derived for the problem, and the results are presented. It is observed that the solvers do not perform satisfactorily in solving models; of all of them, GAMS achieves the best results. The utilized metaheuristics from the Pymoo library gain feasible results in reasonable times. In the conclusion section, suggestions are given for solving similar problems. Furthermore, this article summarizes the managerial applications of the sectorization problems.
publishDate 2023
dc.date.none.fl_str_mv 2023-07-31T15:55:54Z
2023-08-01
2023-08-01T00:00:00Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10400.14/41995
url http://hdl.handle.net/10400.14/41995
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 2405-8440
10.1016/j.heliyon.2023.e18602
85166662622
37576245
001051823200001
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133353121677312