A Heuristic Algorithm for p-Center Problem Based on Combining Operations on Center Graphs

LI Qing-song; DU Wen; YUAN Qing-da

Volume 1 Issue 2

Turn off MathJax

Article Contents

Article Navigation > Journal of Traffic and Transportation Engineering > 2001 > 1(2): 111-113

Next Previous

LI Qing-song, DU Wen, YUAN Qing-da. A Heuristic Algorithm for p-Center Problem Based on Combining Operations on Center Graphs[J]. Journal of Traffic and Transportation Engineering, 2001, 1(2): 111-113.

Citation:

LI Qing-song, DU Wen, YUAN Qing-da. A Heuristic Algorithm for p-Center Problem Based on Combining Operations on Center Graphs[J]. Journal of Traffic and Transportation Engineering, 2001, 1(2): 111-113.

Citation:

PDF( 154 KB)

A Heuristic Algorithm for p-Center Problem Based on Combining Operations on Center Graphs

School of Traffic & amp; Transportation, Southwest Jiaotong University, Chengdu 610031, China

Received Date: 2000-10-30
Publish Date: 2001-06-25

Abstract

Abstract

The heuristic algorithm given in this paper, which is based on Combining Operations on Center Graph (COCG), lowers the complexity of calculation, and its result is more closer to the optimization than available algorithms from the appliance.
- center graph,
- combining operation,
- breaking combining operation,
- p-Center Problem

FullText(HTML)

References(2)

References

[1]	HARKIMI S L. Optimal locations of switching centers and the absolute centers and medians of a graph[J]. Operations Research, 1964, 12(3): 450-459.
[2]	KARIV O, HARKIMIM S L. An algorithimic approach to network location problems. Ⅰ: the p-Centers. SIAM J[J]. Applied Mathematics, 1979, 37(4): 513-538.

Relative Articles

Supplements(0)

Cited By

Proportional views