The p -Centre Problem—Heuristic and Optimal Algorithms
1984; Palgrave Macmillan; Volume: 35; Issue: 8 Linguagem: Inglês
10.1057/jors.1984.150
ISSN1476-9360
Autores Tópico(s)Urban and Freight Transport Logistics
ResumoThe p-centre problem, or minimax location-allocation problem in location theory terminology, is the following: given n demand points on the plane and a weight associated with each demand point, find p new facilities on the plane that minimize the maximum weighted Euclidean distance between each demand point and its closest new facility. We present two heuristics and an optimal algorithm that solves the problem for a given p in time polynomial in n. Computational results are presented.
Referência(s)