Double bound method for solving the p-center location problem
Author
Calik, H.
Tansel, B. C.
Date
2013Source Title
Computers and Operations Research
Print ISSN
0305-0548
Electronic ISSN
1873-765X
Publisher
Elsevier
Volume
40
Issue
12
Pages
2991 - 2999
Language
English
Type
ArticleItem Usage Stats
159
views
views
196
downloads
downloads
Abstract
We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method based on successive restrictions of the new formulation. A specialization of the new method with two-element restrictions obtains the optimal p-center solution by solving a series of simple structured integer programs in recognition form. This specialization is called the double bound method. A relaxation of the proposed formulation gives the tightest known lower bound in the literature (obtained earlier by Elloumi et al., [1]). A polynomial time algorithm is presented to compute this bound. New lower and upper bounds are proposed. Problems from the OR-Library [2] and TSPLIB [3] are solved by the proposed algorithms with up to 3038 nodes. Previous computational results were restricted to networks with at most 1817 nodes.
Keywords
Covering locationMinimax location
Multi-center location
P-Center location
Set covering
Computational results
Integer programming formulations
Lower and upper bounds
Minimax location
P-center
P-center problems
Polynomial-time algorithms
Set coverings
Polynomial approximation
Integer programming
Permalink
http://hdl.handle.net/11693/20855Published Version (Please cite this version)
http://dx.doi.org/10.1016/j.cor.2013.07.011Collections
Related items
Showing items related by title, author, creator and subject.
-
Optimization of locating logistic supply coordination centers (LSCC) of Turkish land forces in an earthquake region
Karaca, Murat (Bilkent University, 2003)This research aims at finding the optimum location of Military Logistic Supply Coordination Centers (LSCC) that are established by Turkish Land Forces for gathering and distributing the logistic supply materials among ... -
p-center problems
Çalık, Hatice; Labbé, M.; Yaman, Hande (Springer, 2015)A p-center is a minimax solution that consists in a set of p points that minimizes the maximum distance between a demand point and a closest point belonging to that set. We present different variants of that problem. We ... -
A spanning tree approach to the absolute p-center problem
Bozkaya, B.; Tansel, B. (Elsevier, 1998)We consider the absolute p-center problem on a general network and propose a spanning tree approach which is motivated by the fact that the problem is NP-hard on general networks but solvable in polynomial time on trees. ...