The capacitated multiple allocation hub location problem: Formulations and algorithms

By Jamie Ebery, Mohan Krishnamoorthy, Andreas T. Ernst, N. Boland. European Journal of Operational Research, 2000

323 citations recorded by the source corpus.

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.

Subfields: Control and Systems Engineering, Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management

View Paper: https://www.semanticscholar.org/paper/c33bd48bfa30ddb747cb7e5ff83d368d4f506375

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

In Industrial and Manufacturing Engineering

In Organizational Behavior and Human Resource Management

Citations in the corpus

Hub location under uncertainty (2012, unknown): “Ernst and Krishnamoorthy (1996) proposed a set of 3-index flow variables for formulating hub location problems, which led to models that could better achieve a tradeoff between compactness and tightness.”
Facility location models for distribution system design (2005, background): “The capacitated case is studied by, e.g., Aykin (1994) and Ebery et al. (2000).”
Network hub location problems: The state of the art (2008, methodology): “Marín (2005a) presented a new formulation for the multiple allocation capacitated hub location problem based on the same idea used in Ebery et al. (2000) but exploiting some of the ideas used in Marín et al. (2006) to reduce the size.”
A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem (2011, methodology): “Capacities on hub nodes can limit the volume of flow into the hub (Ebery et al., 2000; Ernst et al., 1999; Aykin, 1994), or for the total flow through the hub.”