Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem

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.

[1]  Omer Saatcioglu,et al.  Mathematical programming models for airport site selection , 1982 .

[2]  Sibel A. Alumur,et al.  The design of single allocation incomplete hub networks , 2009 .

[3]  Morton E. O'Kelly,et al.  The Location of Interacting Hub Facilities , 1986, Transp. Sci..

[4]  Glaydston Mattos Ribeiro,et al.  A decomposition approach for the probabilistic maximal covering location-allocation problem , 2009, Comput. Oper. Res..

[5]  M. Munot,et al.  Research Methodology , 2019, Storytelling with Data in Healthcare.

[6]  W. Art Chaovalitwongse,et al.  Set covering approach for reconstruction of sibling relationships , 2007, Optim. Methods Softw..

[7]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[8]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[9]  A W Neebe,et al.  A Procedure for Locating Emergency-Service Facilities for All Possible Response Distances , 1988, The Journal of the Operational Research Society.

[10]  T. B. Boffey.  Location Problems Arising in Computer Networks , 1989 .

[11]  T. D. Klastorin,et al.  Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem , 1979 .

[12]  Radivoj Petrovic,et al.  Fuzzy logic based algorithms for maximum covering location problems , 2009, Inf. Sci..

[13]  Vladimir Marianov,et al.  The heuristic concentration-integer and its application to a class of location problems , 2009, Comput. Oper. Res..

[14]  Blas Pelegrín,et al.  GASUB: finding global optima to discrete location problems by a genetic-like algorithm , 2007, J. Glob. Optim..

[15]  Ramasamy Panneerselvam.  Production and Operations Management , 2004 .

[16]  Candace A. Yano,et al.  A Multiplier Adjustment Approach for the Set Partitioning Problem , 1992, Oper. Res..