The capacitated multiple allocation hub location problem: formulations and algorithms

Title: The capacitated multiple allocation hub location problem: formulations and algorithms
Creator: Ebery, Jamie; Krishnamoorthy, Mohan; Ernst, Andreas; Boland, Natashia
Relation: European Journal of Operational Research Vol. 120, Issue 3, p. 614-631
Publisher Link: http://dx.doi.org/10.1016/S0377-2217(98)00395-6
Publisher: Elsevier
Resource Type: journal article
Date: 2000
Description: In this paper we consider and present formulations and solution approaches for the capacitated multiple allocation hub location problem. We present a new mixed integer linear programming formulation for the problem. We also construct an efficient heuristic algorithm, using shortest paths. We incorporate the upper bound obtained from this heuristic in a linear-programming-based branch-and-bound solution procedure. We present the results of extensive computational experience with both the heuristic and the exact methods.
Subject: location; linear programming; heuristics; branch and bound; hubs
Identifier: http://hdl.handle.net/1959.13/939479
Identifier: uon:12819
Identifier: ISSN:0377-2217
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format