Author(s)

Chandragiri Narashimhamurthy Vijeyamurthy, Ramasamy Panneerselvam

.

This paper discusses the comparison of two different heuristics for total covering problem. The total covering problem is a facility location problem in which the objective is to identify the minimum number of sites among the potential sites to locate facilities to cover all the customers. This problem is a combinatorial problem. Hence, heuristic development to provide solution for such problem is inevitable. In this paper, two different heuristics, viz., GA based heuristic and GRASP based heuristic are compared and the best is suggested for implementation.

Genetic Algorithm, GRASP, Total Covering Problem, Boolean Operators, Care and Share Operator

C. Vijeyamurthy and R. Panneerselvam, "Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem," iBusiness, Vol. 2 No. 2, 2010, pp. 156-167. doi: 10.4236/ib.2010.22019.