| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 310.24 KB | Adobe PDF |
Advisor(s)
Abstract(s)
In sectorization problems, a large district is split into small ones, usually meeting certain criteria. In this study, at first, two single-objective integer programming models for sectorization are presented. Models contain sector centers and customers, which are known beforehand. Sectors are established by assigning a subset of customers to each center, regarding objective functions like equilibrium and compactness. Pulp and Pyomo libraries available in Python are utilised to solve related benchmarks. The problems are then solved using a genetic algorithm available in Pymoo, which is a library in Python that contains evolutionary algorithms. Furthermore, the multi-objective versions of the models are solved with NSGA-II and RNSGA-II from Pymoo. A comparison is made among solution approaches. Between solvers, Gurobi performs better, while in the case of setting proper parameters and operators the evolutionary algorithm in Pymoo is better in terms of solution time, particularly for larger benchmarks.
Description
Keywords
Gurobi Optimization Pulp Pymoo Pyomo Sectorization