Heuristic Approaches for K-Center Problem

The allocation of distribution centers or the facility center is an important issue for any company. The problem of facility location is faced by both new and existing companies and its solution is critical to a company´s eventual success. This issue got the highest priority in last few years. It is equally important for both private as well as the public sector. The k-center problem is one of the basic problems in facility location. The aim is to locate a set of k facilities for a given set of demand points, such that for any demand point the nearest facility is as close as possible. Heuristics is a popular way to undertake such kind of typical problems. In this paper we present an intensive analysis of heuristic approach for k-center problem.