A Computational Model for Portfolios of Cooperative Heterogeneous Algorithms for Discrete Optimization

Discrete optimization problems arise throughout many real world domains including planning, decision making, and search. NP-hard in general, these problems require novel approaches to algorithm design and development. Algorithm portfolios which consist of multiple algorithm instances and types executing in parallel has been a key novel approach to these problems. \Ve focus oil cooperative portfolios where algorithms actively communicate and interact with one another during problem solving to more efficiently determine the optimal solution. Unfortunately, the added dimension of cooperation greatly complicates our understanding of tile method. The goal of this paper is to provide tile first comprehensive formal computational model of portfolios of cooperative heterogeneous algorithms in order to lay the foundations for rigorous analyses of these portfolios in hopes of eventually leading to provable guarantees of performance, effectiveness, and efficiency.

[1]  Eugene Santos,et al.  Cache Diversity in Genetic Algorithm Design , 2000, FLAIRS Conference.

[2]  Jörg Denzinger,et al.  On cooperation between evolutionary algorithms and other search paradigms , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3]  Solomon Eyal Shimony,et al.  Finding MAPs for Belief Networks is NP-Hard , 1994, Artif. Intell..

[4]  Eugene Santos,et al.  A Linear Constraint Satisfaction Approach to Cost-Based Abduction , 1994, Artif. Intell..

[5]  Pedro S. de Souza,et al.  Asynchronous Teams: Cooperation Schemes for Autonomous Agents , 1998, J. Heuristics.

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

[7]  Solomon Eyal Shimony,et al.  On a Distributed Anytime Architecture for Probabilistic Reasoning. , 1995 .

[8]  Eugene Santos,et al.  Solving Hard Computational Problems through Collections (Portfolios) of Cooperative Heterogeneous Algorithms , 1999, FLAIRS Conference.

[9]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[10]  Arnold Neumaier,et al.  Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure , 1997, SIAM Rev..

[11]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[12]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[13]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[14]  Bart Selman,et al.  Algorithm Portfolio Design: Theory vs. Practice , 1997, UAI.

[15]  Wright-Patterson Afb,et al.  Experiments with Distributed Anytime Inferencing: Working with Cooperative Algorithms , 1997 .

[16]  Patricia Avila,et al.  Learning Network Designs for Asynchronous Teams , 1997, MAAMAW.

[17]  Tad Hogg,et al.  Phase Transitions and the Search Problem , 1996, Artif. Intell..

[18]  Peter B. Luh,et al.  Scheduling of flexible manufacturing systems , 1998 .