An application of causality for representing and providing formal explanations about the behavior of the threshold accepting algorithm

Authors/Editors

Research Areas

Publication Details

Output type: Other

Author list: Perez J, Cruz L, Pazos R, Landero V, Reyes G, Fraire H, Frausto J, Vázques G

Publisher: Springer

Publication year: 2008

Volume number: 5097

Start page: 1087

End page: 1098

Number of pages: 12

ISBN: 978-3-540-69572-1

ISSN: 0302-9743

Languages: English-Great Britain (EN-GB)

Unpaywall Data

Open access status: closed

Abstract

The problem of algorithm selection for solving NP problems arises with the appearance of a variety of heuristic algorithms. The first works claimed the supremacy of some algorithm for a given problem. Subsequent works revealed the supremacy of algorithms only applied to a subset of instances. However, it was not explained why an algorithm solved better a subset of instances. In this respect, this work approaches the problem of explaining through causal model the interrelations between instances characteristics and the inner workings of algorithms. For validating the results of the proposed approach, a set of experiments was carried out in a study case of the Threshold Accepting algorithm to solve the Bin Packing problem. Finally, the proposed approach can be useful for redesigning the logic of heuristic algorithms and for justifying the use of an algorithm to solve an instance subset. This information could contribute to algorithm selection for NP problems.

Keywords

No matching items found.

Documents