Applications of the DM-GRASP heuristic: a survey

Recent research has shown that the hybridization of metaheuristics is a powerful mechanism to develop more robust and efficient methods to solve hard optimization problems. The combination of different techniques and concepts behind metaheuristics, if well designed, has the potential to exploit their advantages while diminishing their drawbacks, which results in methods suited to a more diverse set of real problems. The DM-GRASP heuristic is one such hybrid method that has achieved promising results. It is a hybrid version of the GRASP metaheuristic that incorporates a data-mining process. In this work, we review how this hybridization was designed and survey the results of its practical applications evaluated until now.

[1]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[2]  Bart Goethals,et al.  Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations (FIMI'03) , 2003 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Luiz Satoru Ochi,et al.  Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem , 2004, WEA.

[5]  Vincent T'Kindt,et al.  An Ant Colony Optimisation Algorithm for the Set Packing Problem , 2004, ANTS Workshop.

[6]  El-Ghazali Talbi,et al.  A Taxonomy of Hybrid Metaheuristics , 2002, J. Heuristics.

[7]  Gösta Grahne,et al.  Efficiently Using Prefix-trees in Mining Frequent Itemsets , 2003, FIMI.

[8]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[9]  Stephen Deering,et al.  Multicast routing in a datagram internetwork , 1992 .

[10]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[11]  Alexandre Plastino,et al.  Hybridization of GRASP Metaheuristic with Data Mining Techniques , 2006, J. Math. Model. Algorithms.

[12]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[13]  Bart Goethals,et al.  Advances in Frequent Itemset Mining Implementations: Introduction to FIMI03 , 2003, FIMI.

[14]  Moni Naor,et al.  Multicast security: a taxonomy and some efficient constructions , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[15]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[16]  R. R. Weitz,et al.  An empirical comparison of heuristic methods for creating maximally diverse groups , 1998, J. Oper. Res. Soc..

[17]  Bo Li,et al.  Server replication and its placement for reliable multicast , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[18]  S. Martins,et al.  MIC 2003 : The Fifth Metaheuristics International Conference ? ?-1 GRASP for the maximum diversity problem , 2005 .

[19]  Georg Carle,et al.  How bad is reliable multicast without local recovery? , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[20]  Alexandre Plastino,et al.  NGL01-4: A Hybrid GRASP with Data Mining for Efficient Server Replication for Reliable Multicast , 2006, IEEE Globecom 2006.

[21]  Alexandre Plastino,et al.  A Hybrid GRASP with Data Mining for the Maximum Diversity Problem , 2005, Hybrid Metaheuristics.

[22]  J. William Atwood,et al.  A classification of reliable multicast protocols , 2004, IEEE Network.

[23]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

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

[25]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[26]  Leo G. Kroon,et al.  Routing Trains Through Railway Stations: Model Formulation and Algorithms , 1996, Transp. Sci..

[27]  Bart Goethals,et al.  Advances in frequent itemset mining implementations: report on FIMI'03 , 2004, SKDD.

[28]  V. Maniezzo,et al.  An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .

[29]  Kevin C. Almeroth,et al.  The evolution of multicast: from the MBone to interdomain multicast to Internet2 deployment , 2000, IEEE Netw..

[30]  Jay B. Ghosh,et al.  Computational aspects of the maximum diversity problem , 1996, Oper. Res. Lett..

[31]  H. Eriksson,et al.  MBone : the multicast backbone : Internet technology , 1994 .

[32]  Y. Zhu,et al.  Heuristics for a Brokering Set Packing Problem , 2004, AI&M.

[33]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[34]  Xavier Gandibleux,et al.  GRASP for set packing problems , 2004, Eur. J. Oper. Res..