Dominant, an algorithm for the \(p\)-center problem.

*(English)*Zbl 1035.90037Summary: In this paper we present \(Dominant\), an algorithm for the \(p\)-center problem, that is the problem of locating p facilities on a network so as to minimise the maximum distance from each customer to his nearest facility. The algorithm \(Dominant\) solves a series of set covering problems, according to a predefined maximum distance: it has four versions, two of which can solve optimally problems with up to 900 demand points. A set of 45 test problems taken from literature is solved, and results are reported.

##### MSC:

90B80 | Discrete location and assignment |

90C27 | Combinatorial optimization |

90C59 | Approximation methods and heuristics in mathematical programming |

PDF
BibTeX
Cite

\textit{C. Caruso} et al., Eur. J. Oper. Res. 149, No. 1, 53--64 (2003; Zbl 1035.90037)

Full Text:
DOI

##### References:

[1] | Beasley, J.E., A note on solving large p-Median problems, European journal of operational research, 21, 270-273, (1985) · Zbl 0569.90021 |

[2] | Beasley, J.E., OR-library: distributing test problems by electronic mail, Journal of the operational research society, 41, 1069-1072, (1990) |

[3] | Chandrasekaran, R.; Tamir, A., Polynomially bounded algorithms for locating p-centers on a tree, Mathematical programming, 22, 304-315, (1982) · Zbl 0486.90036 |

[4] | Christofides, N.; Korman, S., A computational survey of methods for the set covering problem, Management science, 21, 591-599, (1975) · Zbl 0314.65029 |

[5] | Daskin, M.S., Network and discrete location: models, algorithms and applications, (1995), John Wiley and Sons, Inc New York · Zbl 0870.90076 |

[6] | Drezner, Z., The p-center problem: heuristic and optimal algorithms, Journal of the operational research society, 35, 741-748, (1984) · Zbl 0544.90024 |

[7] | Garey, M.; Johnson, D., Computers and intractability: A guide to the theory of NP-completeness, (1979), Freeman & Company New York · Zbl 0411.68039 |

[8] | Hakimi, S.L., Optimal location of switching centers and the absolute centers and medians of a graph, Operations research, 12, 450-459, (1964) · Zbl 0123.00305 |

[9] | Handler, G.Y., Finding two-centers of a tree: the continuos case, Transportation science, 12, 93-106, (1978) |

[10] | Handler, G.Y., P-center problems, in discrete location theory, (), 305-347 |

[11] | Handler, G.Y.; Mirchandani, P.B., Location on networks, (1979), M.I.T. Press Cambridge, MA · Zbl 0533.90026 |

[12] | Ho, A.C., Worst case analysis of a class of set covering heuristics, Mathematical programming, 23, 170-180, (1982) · Zbl 0489.90066 |

[13] | Jaeger, M.; Kariv, I., Algorithms for finding p-centers on a weighted tree, Networks, 15, 381-389, (1985) · Zbl 0579.90024 |

[14] | Kariv, O.; Hakimi, S.L., An algorithmic approach to network location problems. part 1. the p-centers, SIAM journal on applied mathematics, 37, 513-538, (1979) · Zbl 0432.90074 |

[15] | Klein, C.M.; Kincaid, R.K., The discrete anti-p-center problem, Transportation science, 28, 77-79, (1994) · Zbl 0802.90064 |

[16] | Minieka, E., The m-center problem, SIAM review, 12, 138-139, (1970) · Zbl 0193.24204 |

[17] | Minieka, E., Conditional centers and medians on a graph, Networks, 10, 265-272, (1980) |

[18] | Pelegrin, B., Heuristic methods for the p-center problem, RAIRO recherche operationelle, 25, 65-72, (1991) · Zbl 0732.90056 |

[19] | Vasko, F.J.; Wilson, G.R., An efficient heuristic for large set covering problems, Naval research logistics quarterly, 31, 163-171, (1984) · Zbl 0534.90064 |

[20] | Vasko, F.J.; Wilson, G.R., Hybrid heuristics for minimum cardinality set covering problems, Naval research logistics quarterly, 33, 241-249, (1986) · Zbl 0592.90065 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.