A platform for research: civil engineering, architecture and urbanism
Solution strategies for the single facility minimax hub location problem
Abstract In this paper, the single facility minimax hub location problem is considered. The problem involves siting a hub facility in order to minimize the most costly interaction between a set of fixed nodes. Several solution techniques are reviewed, including: discrete locational evaluation; Helly's Theorem; a graphical approach; linear programming feasibility; and Drezner's round trip location algorithm. A comparison of these approaches favors the Drezner algorithm. The minimax hub location problem and the Drezner solution strategy are illustrated through application to air passenger flows between U.S. cities.
Solution strategies for the single facility minimax hub location problem
Abstract In this paper, the single facility minimax hub location problem is considered. The problem involves siting a hub facility in order to minimize the most costly interaction between a set of fixed nodes. Several solution techniques are reviewed, including: discrete locational evaluation; Helly's Theorem; a graphical approach; linear programming feasibility; and Drezner's round trip location algorithm. A comparison of these approaches favors the Drezner algorithm. The minimax hub location problem and the Drezner solution strategy are illustrated through application to air passenger flows between U.S. cities.
Solution strategies for the single facility minimax hub location problem
O'Kelly, Morton E. (author) / Miller, Harvey J. (author)
1991
Article (Journal)
English
BKL:
74.12
Stadtgeographie, Siedlungsgeographie
Optimal and Minimax Euclidean Facility Location
British Library Conference Proceedings | 1999
|Two-Commodity Facility Location Problem: Exact and Approximate Solution Methods
British Library Conference Proceedings | 1997
|International Assembly Facility Location Problem
British Library Conference Proceedings | 1995
|Competitive facility location problem with fuzzy relative distance
British Library Online Contents | 2003
|