Hub Arc Location Problems: Part I-Introduction and Results

Authors:
J. F. Campbell;A. T. Ernst;M. Krishnamoorthy
Affiliations:
College of Business Administration, University of Missouri-St. Louis, 8001 Natural Bridge Road, St. Louis, Missouri 63121-4499;CSIRO Mathematical and Information Sciences, Private Bag 10, South Bank MDC, Clayton, VIC 3169, Australia;CSIRO Mathematical and Information Sciences, Private Bag 10, South Bank MDC, Clayton, VIC 3169, Australia
Venue:
Management Science
Year:
2005

Citing 6
Cited 18

Design and implementation of an interactive optimization system for network design in the motor carrier industry

Operations Research
Avoiding local optima in the p-hub location problem using tabu search and grasp

Annals of Operations Research - Special issue on locational decisions
A clustering approach to the planar hub location problem

Annals of Operations Research - Special issue on locational decisions
Lower bounds for the hub location problem

Management Science
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems

INFORMS Journal on Computing
Hub Arc Location Problems: Part II-Formulations and Optimal Algorithms

Management Science

Solving hub arc location problems on a cluster of workstations

Parallel Computing - Special issue: Parallel computing in logistics
Hub Arc Location Problems: Part II-Formulations and Optimal Algorithms

Management Science
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
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
Tight bounds from a path based formulation for the tree of hub location problem

Computers and Operations Research
A conditional p-hub location problem with attraction functions

Computers and Operations Research
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion

INFORMS Journal on Computing
Single-allocation hub location problems with capacity decisions and balancing requirements

MACMESE'10 Proceedings of the 12th WSEAS international conference on Mathematical and computational methods in science and engineering
Hub location problems with choice of different hub capacities and vehicle types

INOC'11 Proceedings of the 5th international conference on Network optimization
Strategic Design and Analysis of a Relay Network in Truckload Transportation

Transportation Science
Twenty-Five Years of Hub Location Research

Transportation Science
Uncapacitated single allocation p-hub maximal covering problem

Computers and Industrial Engineering
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering
A hub location inventory model for bicycle sharing system design: Formulation and solution

Computers and Industrial Engineering
A Stackelberg hub arc location model for a competitive environment

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

Hub networks play an important role in many transportation and telecommunications systems. This paper introduces a new model called the hub arc location model. Rather than locate discrete hub facilities, this model locates hub arcs, which have reduced unit flow costs. Four special cases of the general hub arc location model are examined in detail. We provide motivation for the new models, and present examples and optimal solutions, using data for U.S. air passenger traffic. Results are used to compare optimal costs, hub locations, and hub arc locations with corresponding hub median optimal solutions. The results reveal interesting spatial patterns and help identify promising cities and regions for hubs. A companion paper (Campbell et al. 2005) presents integer programming formulations and solution algorithms for the new hub arc problems. It also provides details and computation times for these solution algorithms.