The stochastic -hub center problem with service-level constraints
Introduction
Customers looking for delivery services are increasingly requiring delivery companies to offer fast and reliable service, as well as guarantees on when deliveries will be made. These guarantees are characterized by the next-day or second-day delivery services offered by companies such as UPS and FedEx. In UPS’ case, for example, these services represented $6.8 billion in revenue in 2006 (a 6.2% increase from 2005) from delivery of 1.27 million packages a day, accounting for 22% of its domestic revenues [1].
With such large volumes of packages transported between many different origin–destination points during a single year, it is paramount that the delivery networks operate efficiently and reliably so as to be able to meet the service guarantees. The configuration of the network thus has an important role in this regard [2], [3]. Package delivery companies operate complex hub-and-spoke networks, which have many sorting hub centers and many more local service centers. The delivery network configuration will determine the company's ability to meet service guarantees, or determine what service guarantees it can offer. The -hub center problem (HCP), one of many different hub location models, can be used as an aid in designing such time-sensitive delivery services.
The HCP simultaneously finds the optimal location of hubs and the assignment of non-hub nodes to the hubs so as to minimize the longest origin–destination path in the network. The solution to the HCP essentially provides an upper bound on the delivery times in the hub-and-spoke network, or put differently, the HCP returns the minimum time period needed to guarantee that a package from any origin to any destination will be delivered within that time-frame. This minimum delivery time value can be used to design time-constrained service offerings to customers, or to ascertain if certain current service guarantees are feasible.
Considering the solution of the HCP from a strategic point of view, once a service guarantee has been established, a company can then evaluate alternative delivery transportation modes for those origin–destination pairs that are not tightly constrained by the time service guarantee. For example, the company may choose to use a slower but lower cost transportation option to service a particular origin–destination pair and still meet the service guarantee, or perhaps use a combination of different transportation modes to service the demand flows [4]. The company could also consider differential pricing strategies to account for customers’ service demands and the company's operational constraints.
With variability in the transportation time from the origin to the destination, there is the possibility that a package may not be delivered on time. A failure in on-time delivery may result in a company having to compensate an unhappy customer. For example, FedEx and UPS refund the delivery service charges in the event of a service failure [5], [6]. While this remunerative value is known, it is more difficult to quantify the potential cost of lost goodwill, and thus a company may insist on a minimum service level instead.
In this paper, we introduce the stochastic -hub center problem (SHCP), which employs a chance-constrained formulation [7], [8] to model the minimum service-level requirement. This model accounts for the variability in travel times when designing the hub network so that the maximum travel time through the network is minimized. Our work is the first to incorporate stochastic travel times in hub location models. We know of only one other published article on stochastic hub location problems, which is that by Marianov and Serra [9]. In their paper, the authors focus on stochasticity at the hub nodes by representing the hub airports as queues and limiting via chance constraints the number of airplanes that can be in a queue at the hub airports.
In the next section, we provide an overview of the hub location problem, and review the literature related to the problem presented in this paper. A general formulation for the SHCP is given in Section 3, and we also present a mixed-integer linear programming formulation for the SHCP under the assumption that the travel time on each link is normally distributed, and that the travel time on a link is independent of that on any other link. Because of the size of the mixed-integer linear programming problem, CPLEX is only able to solve problems with small number of nodes (less than 10 nodes). In Section 4, we discuss some insights obtained from analyzing the optimal solutions of the SHCP, and then propose several heuristics for solving the SHCP. Results from our computational experiments are provided in Section 5. Concluding remarks and future research directions arising from this work are discussed in Section 6.
Section snippets
Literature review
In the general form of the hub location problem on a network, a subset of the nodes is chosen to be hubs. The hub nodes are assumed to be fully interconnected as shown in Fig. 1, where the squares and circles represent hub and non-hub nodes, respectively. We will refer to this collection of hub nodes and the arcs connecting these nodes as the hub network. The non-hub nodes are connected to the hub nodes following either a single-assignment or multiple-assignment rule. In a single-assignment
Model formulation
In the S HCP, the problem is to locate hubs in the network and assign each non-hub node to a hub node (i.e., the single-assignment rule) so that the longest path duration in the network is minimized for a given service level . It is reasonable to assume that will be close to 1 (e.g., ).
Let be the set of nodes in the network, and the random variable represent the travel time on the link from nodes to . We assume that is normally distributed with mean and variance
Heuristic solution approach
Due to the size of the problem, we had limited success in solving problem SHCP using CPLEX. As such, we focus our research on heuristic solution approaches, which we will describe shortly.
It is known that the center version of facility location problems may have multiple optimal solutions. We observed from the results of our computational experiments that this multiple optima issue also is present for the SHCP. Because of this multiple optima issue, we wanted to analyze all the globally
Computational results
To compare the three heuristics to optimal solutions, we first test the three heuristics using the 10-, 15-, 20-, and 25-node CAB data set, as well as the 10-, 20-, and 25-node AP data set. We set , , and . We coded all three heuristics in MATLAB [32], and the hub center single-assignment problem HCSAP is solved using CPLEX. For each problem instance, is found by searching over all possible hub configurations and finding an optimal assignment for each
Conclusion
In this paper, we introduce the stochastic =hub center problem with service-level constraints, which seeks to configure a network that minimizes the longest transportation time in the network for a specified service level in delivery times. Chance constraints are used to model the service-level constraints.
We find that the optimal locations of the -hubs tend to form a certain structure, where one hub is located in the center of the service region with the remaining hubs located around this
Acknowledgments
The authors thank the two anonymous referees for their thoughtful comments on an earlier version of the paper. Their suggestions helped improved the paper.
References (32)
- et al.
Hub networks and simulated schedule delays
Papers of the Regional Science Association
(1986) Configuration of an overnight package air network
Transportation Research Part A
(1989)- et al.
Location models for airline hubs behaving as queues
Computers & Operations Research
(2003) - et al.
Hub location with flow economies of scale
Transportation Research B
(1998) Integer programming formulations of discrete hub location problems
European Journal of Operational Research
(1994)Hub location in backbone/tributary network design: a review
Location Science
(1998)- et al.
Network hub location problems: the state of the art
European Journal of Operational Research
(2008) - et al.
Solution strategies for the single facility minimax hub location problem
Papers in Regional Science: The Journal of the RSAI
(1991) - et al.
On the single-assignment -hub center problem
European Journal of Operational Research
(2000) - et al.
Uncapacitated single and multiple allocation -hub center problems
Computers & Operations Research
(2009)
The latest arrival hub location problem for cargo delivery systems with stopovers
Transportation Research Part B
The -hub center allocation problem
European Journal of Operational Research
A simple heuristic for the -center problem
Operations Research Letters
Efficient algorithms for the uncapacitated single allocation -hub median problems
Location Science
Mode choice in a hub-and-spoke network: a zero-one linear programming approach
Geographical Analysis
Cited by (145)
Optimal-transport satisficing with applications to capacitated hub location
2024, Computers and Operations ResearchA stochastic hub location and fleet assignment problem for the design of reconfigurable park-and-ride systems
2024, Transportation Research Part E: Logistics and Transportation ReviewStable and weakly additive cost sharing in shortest path problems
2024, Journal of Mathematical EconomicsA heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
2024, European Journal of Operational ResearchThe maximal detour liner shipping hub location problem: Improving the applicability of the p-hub center problem
2023, Transportation Research Part E: Logistics and Transportation ReviewA mean-CVaR approach to the risk-averse single allocation hub location problem with flow-dependent economies of scale
2023, Transportation Research Part B: Methodological