The Latest Arrival Hub Location Problem
Authors:
- 1 October 2001
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Management Science
- Vol. 47 (10) , 1408-1420
Abstract
The traditionally studied hub location problems in the literature pay attention to flight times but not to transient times spent at hubs for unloading, loading, and sorting operations. The transient times may constitute a significant portion of the total delivery time for cargo delivery systems. We focus on the minimization of the arrival time of the last arrived item in cargo delivery systems and develop a model that correctly computes the arrival times by taking into account both the flight times and the transient times. Nonlinear and linear integer formulations are given and computational results are provided. The effects of delays on the system performance are analyzed.Keywords
This publication has 19 references indexed in Scilit:
- On the single-assignment p-hub center problemEuropean Journal of Operational Research, 2000
- Hub‐and‐Spoke Networks in Air Transportation: An Analytical ReviewJournal of Regional Science, 1999
- Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problemEuropean Journal of Operational Research, 1998
- Hub Location and the p-Hub Median ProblemOperations Research, 1996
- Efficient algorithms for the uncapacitated single allocation p-hub median problemLocation Science, 1996
- The hub location and routing problemEuropean Journal of Operational Research, 1995
- Integer programming formulations of discrete hub location problemsEuropean Journal of Operational Research, 1994
- Accumulation Point Location on Tree Networks for Guaranteed Time DistributionManagement Science, 1990
- Configuration of an overnight package air networkTransportation Research Part A: General, 1989
- HUB NETWORKS AND SIMULATED SCHEDULE DELAYPapers in Regional Science, 1986