Entropy-based Reduction Operator for Heuristic Binary Optimization
Operations Research and Decisions · 16.08.2026
DOI: 10.37190/ord/231140 ↗Kurz gefasst
Fachartikel in der Zeitschrift Operations Research and Decisions, online erschienen am 16.08.2026. Verfasst von Nedjmeddine KANTOUR und 2 weiteren Autor:innen.
Abstract (Originalsprache)
In this paper, we propose a reduction operator addressing discrete optimization problems, more precisely, for optimization problems with binary represented decisions. This operator may be integrated within various metaheuristics in order to reduce the dimension of the target problem. This is, by performing an iterative supervision over the browsed admissible space throughout the search process. We thus use the information entropy concept to measure the current uncertainty towards decision variables current values provided by an iterative heuristic search algorithm. Hence, it allows to explore the decision space more efficiently. Furthermore, we present two frameworks as effective applications of this operator: a pre-process for a hybrid approach and an interactive heuristic approach. We compare it against established approaches from the literature.
Zitieren
APA
KANTOUR, N., Chaabane, K., & Bouroubi, S. (2026). Entropy-based Reduction Operator for Heuristic Binary Optimization. Operations Research and Decisions. https://doi.org/10.37190/ord/231140
Vancouver
KANTOUR N, Chaabane K, Bouroubi S. Entropy-based Reduction Operator for Heuristic Binary Optimization. Operations Research and Decisions. 2026. doi:10.37190/ord/231140
BibTeX
@article{KANTOUR2026,
author = {KANTOUR, Nedjmeddine and Chaabane, Khadidja and Bouroubi, Sadek},
title = {Entropy-based Reduction Operator for Heuristic Binary Optimization},
journal = {Operations Research and Decisions},
year = {2026},
doi = {10.37190/ord/231140}
}
EUVIMED