Using Knowledge Discovery in Cooperative Strategies: Two Case Studies

In this work we discuss to what extent and in what contexts the use of knowledge discovery techniques can improve the performance of cooperative strategies for optimization. The study is approached over two different cases study that differs in terms of the definition of the initial cooperative strategy, the problem chosen as test bed (Uncapacitated Single Allocation p HubMedian and knapsack problems) and the number of instances available for applying data mining. The results obtained show that this techniques can lead to an improvement of the cooperatives strategies as long as the application context fulfils certain characteristics.

[1]  Naren Ramakrishnan,et al.  PYTHIA-II: a knowledge/database system for managing performance data and recommending scientific software , 2000, TOMS.

[2]  William H. Hsu,et al.  A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problem , 2007, Ann. Oper. Res..

[3]  Carlos Cruz Corona,et al.  Using memory and fuzzy rules in a co-operative multi-thread strategy for optimization , 2006, Inf. Sci..

[4]  John E. Beasley,et al.  Obtaining test problems via Internet , 1996, J. Glob. Optim..

[5]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[6]  Francesca Rossi,et al.  Principles and Practice of Constraint Programming – CP 2003 , 2003, Lecture Notes in Computer Science.

[7]  Teodor Gabriel Crainic,et al.  A cooperative parallel meta-heuristic for the vehicle routing problem with time windows , 2005, Comput. Oper. Res..

[8]  J. Christopher Beck,et al.  APPLYING MACHINE LEARNING TO LOW‐KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS , 2005, Comput. Intell..

[9]  Jacques Ferber,et al.  Multi-agent systems - an introduction to distributed artificial intelligence , 1999 .

[10]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[11]  Jozef Kratica,et al.  Discrete Optimization Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem , 2007 .

[12]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[13]  John R. Rice,et al.  The Algorithm Selection Problem , 1976, Adv. Comput..

[14]  Yoav Shoham,et al.  Boosting as a Metaphor for Algorithm Design , 2003, CP.

[15]  Carlos Cruz Corona,et al.  Soft computing and cooperative strategies for optimization , 2005, Proceedings of the 2005 IEEE Midnight-Summer Workshop on Soft Computing in Industrial Applications, 2005. SMCia/05..

[16]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[17]  Pierre Hansen,et al.  Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.

[18]  Natalio Krasnogor,et al.  Fuzzy Memes in Multimeme Algorithms: a Fuzzy-Evolutionary Hybrid , 2003 .

[19]  José L. Verdegay.  Fuzzy Sets Based Heuristics for Optimization , 2010 .

[20]  Thomas Stützle,et al.  Ant Colony Optimization , 2009, EMO.