| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 808.36 KB | Adobe PDF |
Autores
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
Multi-objective optimization Sectorization Mixed integer non-linear programming GAMS CPLEX Lingo Python Pulp Pymoo GA NSGA-II