A new model for location-allocation problem based on sectorization

• Main Author: Teymourifar, Aydin
• Publication Date: 2021
• Other Authors: Rodrigues, Ana Maria, Ferreira, José Soeiro
• Format: Article
• Language: eng
• Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
• Download full: http://hdl.handle.net/10400.14/36481
• topic: Location-allocation problem; Sectorization; Covering radius; Python; Pulp; Linear programming

Many models have been proposed for the location-allocation problem. In this study, based on sectorization concept, we propose a new single-objective model of this problem, in which, there is a set of customers to be assigned to distribution centres (DCs). In sectorization problems there are two important criteria as compactness and equilibrium, which can be defined as constraints as well as objective functions. In this study, the objective function is defined based on the equilibrium of distances in sectors. The concept of compactness is closely related to the accessibility of customers from DCs. As a new approach, instead of compactness, we define the accessibility of customers from DCs based on the covering radius concept. The interpretation of this definition in real life is explained. As another contribution, in the model, a method is used for the selection of DCs, and a comparison is made with another method from the literature, then the advantages of each are discussed. We generate benchmarks for the problem and we solve it with a solver available in Python’s Pulp library. Implemented codes are presented in brief.