An Alternating Heuristic for Medianoid and Centroid Problems in the Plane

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Joyendu Bhadury, Professor, Information Systems and Supply Chain Management (Creator)
The University of North Carolina at Greensboro (UNCG )
Web Site:

Abstract: This paper develops two heuristics for solving the centroid problem on a plane with discrete demand points. The methods are based on the alternating step well known in location methods. Extensive computational testing with the heuristics reveals that they converge rapidly, giving good solutions to problems that are up to twice as large as those reported in the literature. The testing also provides some managerial insight into the problem and its solution.

Additional Information

Computers & Operations Research 30, 553–565. DOI: 10.1016/S0305-0548(02)00024-2
Language: English
Date: 2003
Competitive location model, Medianoid, Centroid, Stackelberg solution, Heuristic methods

Email this document to