Location of hubs in a competitive environment
โ Scribed by Vladimir Marianov; Daniel Serra; Charles ReVelle
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 158 KB
- Volume
- 114
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
โฆ Synopsis
We oer a formulation that locates hubs on a network in a competitive environment; that is, customer capture is sought, which happens whenever the location of a new hub results in a reduction of the current cost (time, distance) needed by the trac that goes from the speciยฎed origin to the speciยฎed destination. The formulation presented here reduces the number of variables and constraints as compared to existing covering models. This model is suited for both air passenger and cargo transportation. In this model, each originยฑdestination ยฏow can go through either one or two hubs, and each demand point can be assigned to more than a hub, depending on the dierent destinations of its trac. Links (``spokes'') have no capacity limit. Computational experience is provided.
๐ SIMILAR VOLUMES
## Abstract We consider the problem of locating hubs and assigning terminals to hubs for a telecommunication network. The hubs are directly connected to a central node and each terminal node is directly connected to a hub node. The aim is to minimize the cost of locating hubs, assigning terminals a
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 o