Hub-and-spoke network design with congestion
Computers and Operations Research
Capacitated single allocation hub location problem-A bi-criteria approach
Computers and Operations Research
Uncapacitated single and multiple allocation p-hub center problems
Computers and Operations Research
Path relinking approach for multiple allocation hub maximal covering problem
Computers & Mathematics with Applications
The stochastic p-hub center problem with service-level constraints
Computers and Operations Research
Multiple allocation hub-and-spoke network design under hub congestion
Computers and Operations Research
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion
INFORMS Journal on Computing
Two artificial intelligence heuristics in solving multiple allocation hub maximal covering problem
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
LTL logistics networks with differentiated services
Computers and Operations Research
International Journal of Metaheuristics
Release Time Scheduling and Hub Location for Next-Day Delivery
Operations Research
Hi-index | 0.01 |
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.