A tabu-search based heuristic for the hub covering problem over incomplete hub networks
Computers and Operations Research
Multiple allocation hub-and-spoke network design under hub congestion
Computers and Operations Research
Hub location for time definite transportation
Computers and Operations Research
LTL logistics networks with differentiated services
Computers and Operations Research
Twenty-Five Years of Hub Location Research
Transportation Science
Uncapacitated single allocation p-hub maximal covering problem
Computers and Industrial Engineering
International Journal of Metaheuristics
Release Time Scheduling and Hub Location for Next-Day Delivery
Operations Research
A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems
Discrete Applied Mathematics
| Hi-index | 0.00 |
The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze the application areas separately, we observe that each area has its own characteristics. In this research we focus on cargo delivery systems. Our interviews with various cargo delivery firms operating in Turkey enabled us to determine the constraints, requirements, and criteria of the hub location problem specific to the cargo delivery sector. We present integer programming formulations and large-scale implementations of the models within Turkey. The results are compared with the current structure of a cargo delivery firm operating in Turkey. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 49(1), 28–39 2007