Network Design for Express Shipment Delivery
Computational Optimization and Applications
Multimodal Express Package Delivery: a Service Network Design Application
Transportation Science
Solving hub arc location problems on a cluster of workstations
Parallel Computing - Special issue: Parallel computing in logistics
A hub covering model for cargo delivery systems
Networks - Special Issue on Multicommodity Flows and Network Design
Hub Arc Location Problems: Part I-Introduction and Results
Management Science
Hub Arc Location Problems: Part II-Formulations and Optimal Algorithms
Management Science
Uncapacitated single and multiple allocation p-hub center problems
Computers and Operations Research
The stochastic p-hub center problem with service-level constraints
Computers and Operations Research
Star p-hub center problem and star p-hub median problem with bounded path lengths
Computers and Operations Research
LTL logistics networks with differentiated services
Computers and Operations Research
Twenty-Five Years of Hub Location Research
Transportation Science
Release Time Scheduling and Hub Location for Next-Day Delivery
Operations Research
Computers and Industrial Engineering
GRASP for the uncapacitated r-allocation p-hub median problem
Computers and Operations Research
A Stackelberg hub arc location model for a competitive environment
Computers and Operations Research
Hi-index | 0.01 |
Time definite motor carriers provide very reliable scheduled truck transportation service between specified terminals. They provide service competitive with airfreight carriers over continental-scale distances at a much lower cost. This paper provides time definite models for multiple allocation p-hub median problems and hub arc location problems. Service levels are imposed by limiting the maximum travel distance via the hub network for each origin-destination pair. Computational results are presented to demonstrate the effects of the time definite service levels on practical network design for truck transportation in North America.