Robustness of two common heuristics for the p-median problem
Journal Article
·
· Environment and Planning A; (United States)
- Erasmus Universiteit, Rotterdam, Netherlands
Optimal p-median solutions were computed for six test problems on a network of forty-nine demand nodes and compared with solutions from two heuristic algorithms. Comparison of the optimal solutions with those from the Teitz and Bart heuristic indicates that this heuristic is very robust. Tests of the Maranzana heuristic, however, indicate that it is efficient only for small values of p (numbers of facilities) and that its robustness decreases rapidly as problem size increases. 1 figure, 3 tables.
- DOE Contract Number:
- W-7405-ENG-26
- OSTI ID:
- 5907953
- Journal Information:
- Environment and Planning A; (United States), Journal Name: Environment and Planning A; (United States) Vol. 11
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal and heuristic solutions to the p-median problem
Modeling transmission line constraints in two-stage robust unit commitment problem
Efficient heuristic algorithms for positive 0-1 polynomial programming problems
Journal Article
·
Sun Dec 31 23:00:00 EST 1978
· Geogr. Anal.; (United States)
·
OSTI ID:6778367
Modeling transmission line constraints in two-stage robust unit commitment problem
Journal Article
·
Thu May 01 00:00:00 EDT 2014
· IEEE Transactions on Power Systems
·
OSTI ID:1321135
Efficient heuristic algorithms for positive 0-1 polynomial programming problems
Journal Article
·
Thu Jul 01 00:00:00 EDT 1982
· Manage. Sci.; (United States)
·
OSTI ID:5214158