Solving hub arc location problems on a cluster of workstations

Authors:
James F. Campbell;Gary Stiehr;Andreas T. Ernst;Mohan Krishnamoorthy
Affiliations:
College of Business Administration, University of Missouri--St. Louis, 8001 Natural Bridge Road, St. Louis, MO;Information Technology Services, University of Missouri--St. Louis, 8001 Natural Bridge Road, St. Louis, MO;CSIRO Mathematical and Information Sciences, Private Bag 10, Clayton South MDC, Vic. 3169, Australia;CSIRO Mathematical and Information Sciences, Private Bag 10, Clayton South MDC, Vic. 3169, Australia
Venue:
Parallel Computing - Special issue: Parallel computing in logistics
Year:
2003

Citing 8
Cited 4

A parallel branch-and-bound algorithm for multicommodity location with balancing requirements

Computers and Operations Research
Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem

Parallel Computing - High performance computing in operations research
Node-ejection chains for the vehicle routing problem: sequential and parallel algorithms

Parallel Computing
Branch, Cut, and Price: Sequential and Parallel

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems

INFORMS Journal on Computing
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
Hub Arc Location Problems: Part I-Introduction and Results

Management Science
Hub Arc Location Problems: Part II-Formulations and Optimal Algorithms

Management Science

Hub-and-spoke network design with congestion

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
Improving cluster utilization through intelligent processor sharing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many modern transportation systems rely on a network of hub facilities to help concentrate flows of freight or passengers to exploit the economies of scale in transportation. The design of a hub network, including location of the hub facilities, is a key determinant of the cost and competitiveness of a transportation and logistics system. This paper reports on a parallel implementation of an algorithm for the hub arc location model to design such a network. Computational work was performed on a cluster of workstations with data for air passenger traffic in the United States and postal operations in Sydney, Australia.