Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Proceedings of the AAAI Conference on Artificial Intelligence Année : 2024

Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem

Résumé

As a classical NP-hard problem and the topic of the PACE 2022 competition, the directed feedback vertex set problem (DFVSP) aims to find a minimum subset of vertices such that, when vertices in the subset and all their adjacent edges are removed from the directed graph, the remainder graph is acyclic. In this paper, we propose a threshold-based responsive simulated annealing algorithm called TRSA for solving DFVSP. First, we simplify the problem instances with two new reduction rules proposed in this paper and eight reduction rules from the literature. Then, based on a new solution representation, TRSA solves DFVSP with a fast local search procedure featured by a swap-based neighborhood structure and three neighborhood acceleration strategies. Finally, all these strategies are incorporated into a threshold-based responsive simulated annealing framework. Computational experiments on 140 benchmark instances show that TRSA is highly competitive compared to the state-of-the-art methods. Specifically, TRSA can improve the best known results for 53 instances, while matching the best known results for 79 ones. Furthermore, some important features of TRSA are analyzed to identify its success factors.

Dates et versions

hal-04524415 , version 1 (28-03-2024)

Identifiants

Citer

Qingyun Zhang, Yuming Du, Zhouxing Su, Chu-Min Li, Junzhou Xu, et al.. Threshold-Based Responsive Simulated Annealing for Directed Feedback Vertex Set Problem. Proceedings of the AAAI Conference on Artificial Intelligence, 2024, 38 (18), pp.20856-20864. ⟨10.1609/aaai.v38i18.30075⟩. ⟨hal-04524415⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More