Improving the performance of heuristic algorithms based on causal inference

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Causal inference can be used to construct models that explain the performance of heuristic algorithms for NP-hard problems. In this paper, we show the application of causal inference to the algorithmic optimization process through an experimental analysis to assess the impact of the parameters that control the behavior of a heuristic algorithm. As a case study we present an analysis of the main parameters of one state of the art procedure for the Bin Packing Problem (BPP). The studies confirm the importance of the application of causal reasoning as a guide for improving the performance of the algorithms. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Quiroz Castellanos, M., Cruz Reyes, L., Torres-Jiménez, J., Santillán, C. G., Locés, M. C. L., Ibarra, J. E. C., & Valdez, G. C. (2011). Improving the performance of heuristic algorithms based on causal inference. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7094 LNAI, pp. 137–148). https://doi.org/10.1007/978-3-642-25324-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free