| Article ID: | iaor2009124 |
| Country: | Netherlands |
| Volume: | 179 |
| Issue: | 3 |
| Start Page Number: | 968 |
| End Page Number: | 977 |
| Publication Date: | Jun 2007 |
| Journal: | European Journal of Operational Research |
| Authors: | Paixo Jos, Ferreira Carlos, Barreto Srgio, Santos Beatriz Sousa |
| Keywords: | vehicle routing & scheduling, combinatorial optimization, heuristics |
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.