The success of portfolio algorithms in competitions in the area of combinatorial problem solving, as well as in practice, has motivated interest in the development of new approaches to determine the best solver for the problem at hand. In this thesis, however, it is firstly shown how not all the features in the problem have the same relevancy. Then it is presented how one of the most successful portfolio approaches, ISAC, can be augmented by taking into account the past performance of solvers

SNNAP: Solver-based Nearest Neighbor for Algorithm Portfolios

Collautti, Marco
2013/2014

Abstract

The success of portfolio algorithms in competitions in the area of combinatorial problem solving, as well as in practice, has motivated interest in the development of new approaches to determine the best solver for the problem at hand. In this thesis, however, it is firstly shown how not all the features in the problem have the same relevancy. Then it is presented how one of the most successful portfolio approaches, ISAC, can be augmented by taking into account the past performance of solvers
2013-10-15
algorithm portfolios, machine learning, artificial intelligence
File in questo prodotto:
File Dimensione Formato  
Thesis.pdf

accesso aperto

Dimensione 2.57 MB
Formato Adobe PDF
2.57 MB Adobe PDF Visualizza/Apri

The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12608/17492