TY - JFULL
AU - S. Raja Balachandar and K. Kannan
PY - 2010/8/
TI - A Meta-Heuristic Algorithm for Set Covering Problem Based on Gravity
T2 - International Journal of Physical and Mathematical Sciences
SP - 1024
EP - 1030
EM - srbala@maths.sastra.edu, kkannan@maths.sastra.edu
VL - 4
SN - 1307-6892
UR - http://waset.org/publications/16009
PU - World Academy of Science, Engineering and Technology
NX - International Science Index 43, 2010
N2 - A new Meta heuristic approach called "Randomized gravitational emulation search algorithm (RGES)" for solving large size set covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters -velocity- and -gravity- in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility specifically for the set covering problem to yield best solutions. The performance of this algorithm has been evaluated on a large set of benchmark problems from OR-library. Computational results showed that the randomized gravitational emulation search algorithm - based heuristic is capable of producing high quality solutions. The performance of this heuristic when compared with other existing heuristic algorithms is found to be excellent in terms of solution quality.
ER -