WSEAS Transactions on Computers
Print ISSN: 1109-2750, E-ISSN: 2224-2872
Volume 19, 2020
Geographically Separating Sectors in Multi-Objective Location-Routing Problems
Authors: , ,
Abstract: This paper deals with multi-objective location-routing problems (MO-LRPs) and follows a sectorization approach, which means customers are divided into different sectors, and a distribution centre is opened for each sector. The literature has considered objectives such as minimizing the number of opened distribution centres, the variances of compactness, distances and demands in sectors. However, the achievement of these objectives cannot guarantee the geographical separation of sectors. In this sense, and as the geographical separation of sectors can have significant practical relevance, we propose a new objective function and solve a benchmark of problems with the non-dominated sorting genetic algorithm (NSGA-II), which finds multiple non-dominated solutions. A comparison of the results shows the effectiveness of the introduced objective function, since, in the non-dominated solutions obtained, the sectors are more geographically separated when the values of the objective function improve.
Search Articles
Keywords: Location-Routing Problems, Sectorization, Geographically Separated Sectors, Non-Dominated Sorting Genetic Algorithm, Travelling Salesman Problem, Multi-Objective Optimization
Pages: 98-102
DOI: 10.37394/23205.2020.19.13