J. Peiró, Á. Corberán, M. Laguna, R. Martí
Hub networks are commonly used in telecommunications and logistics to connect origins to destinations in situations where a direct connection between each origin-destination (o-d) pair is impractical or too costly. Hubs serve as switching points to consolidate and route demand in order to consider economies of scale. The main decisions associated with hub-network problems include 1) determining the number of hubs (p), 2) selecting the p nodes in the network that will serve as hubs, 3) allocating non-hub nodes to r hubs, and 4) routing the pairwise o-d demand. Hub location problems include all four decisions while hub allocation problems assume that p is given. In hub median problems, the objective is to minimize the total cost while in hub center problems, the objective is to minimize the maximum cost between origin-destination pairs.
In this paper we study the quality service offered to customers. The reason is that cost-minimizing solutions found with p-hub median models might include routes for o-d demand pairs that are unreasonably long, calling into question the quality of the service that the network design will provide to some of the customers. We will discuss how to address this issue by minimizing a function of the cost of meeting individual o-d demands and present some computational results.
Keywords: facility location, r-allocation, p-hub, quality of service, heuristic optimization
Scheduled
T4 Location 3
October 1, 2015 5:00 PM
Salón de actos
