The capacitated single-allocation hub location problem revisited: A note on a classical formulation
- Denote by G = (N;A) a complete graph where N is the set of nodes and A is the set of edges. Assume that a °ow wij should be sent from each node i to each node j (i; j 2 N). One possibility is to send these °ows directly between the corresponding pairs of nodes. However, in practice this is often neither e±cient nor costly attractive because it would imply that a link was built between each pair of nodes. An alternative is to select some nodes to become hubs and use them as consolidation and redistribution points that altogether process more e±ciently the flow in the network. Accordingly, hubs are nodes in the graph that receive tra±c (mail, phone calls, passengers, etc) from di®erent origins (nodes) and redirect this tra±c directly to the destination nodes (when a link exists) or else to other hubs. The concentration of tra±c in the hubs and its shipment to other hubs lead to a natural decrease in the overall cost due to economies of scale.
Author: | I. Correia, S. Nickel, F. Saldanha-da-Gama |
---|---|
URN: | urn:nbn:de:hbz:386-kluedo-16173 |
Series (Serial Number): | Berichte des Fraunhofer-Instituts für Techno- und Wirtschaftsmathematik (ITWM Report) (164) |
Document Type: | Report |
Language of publication: | English |
Year of Completion: | 2009 |
Year of first Publication: | 2009 |
Publishing Institution: | Fraunhofer-Institut für Techno- und Wirtschaftsmathematik |
Date of the Publication (Server): | 2009/10/16 |
GND Keyword: | Capacitated Hub Location; MIP formulations |
Faculties / Organisational entities: | Fraunhofer (ITWM) |
DDC-Cassification: | 5 Naturwissenschaften und Mathematik / 510 Mathematik |
Licence (German): | Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011 |