Article citationsMore>>

T. J. Chen and C. A. Yano, “A Multiplier Adjustment Approach for Set Partitioning Problem,” Operations Research, Vol. 40, No. 1, 1992, pp. 40-47.

has been cited by the following article:

• TITLE: Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem

  AUTHORS: Chandragiri Narashimhamurthy Vijeyamurthy, Ramasamy Panneerselvam

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

  JOURNAL NAME: iBusiness, Vol.2 No.2, June 12, 2010

  ABSTRACT: 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.