Using clustering analysis in a capacitated location-routing problem |
| |
| Authors: | Sé rgio Barreto,Carlos Ferreira,José Paixã o,Beatriz Sousa Santos |
| |
| Affiliation: | 1. Higher Institute of Accounting and Administration/ISCA, University of Aveiro, Aveiro, Portugal;2. Department of Economics, Management and Industrial Engineering, University of Aveiro, Aveiro, Portugal;3. Department of Statistics and Operations Research, University of Lisbon, Lisbon, Portugal;4. Department of Electronics and Telecommunications/IEETA, University of Aveiro, Aveiro, Portugal;5. Operational Research Centre, University of Lisbon, Lisbon, Portugal |
| |
| Abstract: | The location routing problem (LRP) appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP). In this work, we consider a discrete LRP with two levels: a set of potential capacitated distribution centres (DC) and a set of ordered customers. In our problem we intend to determine the set of installed DCs as well as the distribution routes (starting and ending at the DC). The problem is also constrained with capacities on the vehicles. Moreover, there is a homogeneous fleet of vehicles, carrying a single product and each customer is visited just once. As an objective we intend to minimize the routing and location costs. |
| |
| Keywords: | Combinatorial optimization Distribution Heuristics Cluster analysis Location-routing |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
