HubLocator: an exact solution method for the multiple allocation hub location problem

Authors:
Gabriela Mayer;Bernd Wagner
Affiliations:
Institute of Operations Research, Darmstadt University of Technology, Hochschulstrasse 1, Darmstadt, Germany;Institute of Operations Research, Darmstadt University of Technology, Hochschulstrasse 1, Darmstadt, Germany
Venue:
Computers and Operations Research - Location analysis
Year:
2002

Citing 4
Cited 10

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

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

Management Science
On the selection of hub airports for an airline hub-and-spoke system

Computers and Operations Research - location science
An Exact Solution Approach Based on Shortest-Paths for P-Hub Median Problems

INFORMS Journal on Computing

Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm

Journal of Global Optimization
Exact procedures for solving the discrete ordered median problem

Computers and Operations Research
Benders decomposition for the uncapacitated multiple allocation hub location problem

Computers and Operations Research
Benders Decomposition for Hub Location Problems with Economies of Scale

Transportation Science
A conditional p-hub location problem with attraction functions

Computers and Operations Research
e-Work based collaborative optimization approach for strategic logistic network design problem

Computers and Industrial Engineering
A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion

INFORMS Journal on Computing
Benders Decomposition for Large-Scale Uncapacitated Hub Location

Operations Research
An iterated local search heuristic for a capacitated hub location problem

HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

HubLocator is a new branch-and-bound procedure for the uncapacitated multiple allocation hub location problem. An existing optimal method developed by Klincewicz (Location Sci. 4 (1996) 173) is based on dual ascent and dual adjustment techniques applied to a disaggregated model formulation. These techniques have already successfully been used to solve the closely related simple plant location problem. However, due to the specific structure of the problem at hand, the success of these techniques in reducing the computational effort is rather restricted. Therefore, HubLocator additionally considers an aggregated model formulation enabling us to significantly tighten the lower bounds. Upper bounds which satisfy complementary slackness conditions for some constraints are constructed and improved by means of a simple heuristic procedure. Computational experiments demonstrate that optimal solutions for problems with up to 40 nodes can be found in a reasonable amount of time.