Multi-armed bandit for the cyclic minimum sitting arrangement problem Robles, Marcos Cavero, Sergio Pardo, Eduardo Cordón García, Óscar Signed graphs Cyclic minimum sitting arrangement Multi-armed bandit Variable neighborhood descent Graphs are commonly used to represent related elements and relationships among them. Signed graphs are a special type of graphs that can represent more complex structures, such as positive or negative connections in a social network. In this work, we address a combinatorial optimization problem, known as the Cyclic Minimum Sitting Arrangement, that consists of embedding a signed input graph into a cycle host graph, trying to locate in the embedding positive connected vertices closer than negative ones. This problem is a variant of the well-known Minimum Sitting Arrangement where the host graph has the structure of a path graph. To tackle the problem, we propose an algorithm based on the Multi-Armed Bandit method that combines three greedy-randomized constructive procedures with a Variable Neighborhood Descent local search algorithm. To assess the merit of our proposal, we compare it with the state-of-the-art method. Our experiments show that our algorithm outperforms the best-known method in the literature to date, and the results are statistically significant, establishing itself as the new state of the art for the problem. 2025-07-18T08:59:20Z 2025-07-18T08:59:20Z 2025-03-01 journal article Robles, M., Cavero, S., Pardo, E. G., & Cordón, O. (2025). Multi-armed bandit for the cyclic minimum sitting arrangement problem. Computers & Operations Research, 179(107034), 107034. https://doi.org/10.1016/j.cor.2025.107034 https://hdl.handle.net/10481/105426 10.1016/j.cor.2025.107034 eng http://creativecommons.org/licenses/by/4.0/ open access Atribución 4.0 Internacional Elsevier