paper-with-me

Papers

Generalized Nested Rollout Policy Adaptation with Limited Repetitions

2024-01-18 · Tristan Cazenave

Generalized Nested Rollout Policy Adaptation (GNRPA) is a Monte Carlo search algorithm for optimizing a sequence of choices. We propose to improve on GNRPA by avoiding too deterministic policies that find again and again the same sequence of choices. We do so by limiting the number of repetitions of the best sequence found at a given level. Experiments show that it improves the algorithm for three different combinatorial problems: Inverse RNA Folding, the Traveling Salesman Problem with Time Windows and the Weak Schur problem.

📄 PDF Abstract BibTeX arXiv:2401.10420

Code (0)

등록된 구현이 없습니다.

Tasks

Traveling Salesman Problem

Similar Papers 제목 키워드 기반

Generalized Nested Rollout Policy Adaptation with Dynamic Bias for Vehicle Routing

2021-11-12 · Julien Sentuc, Tristan Cazenave, Jean-Yves Lucas

In this paper we present an extension of the Nested Rollout Policy Adaptation algorithm (NRPA), namely the Generalized Nested Rollout Policy Adaptation (GNRPA), as well as its use for solving some instances of the Vehicl…

Generalized Nested Rollout Policy Adaptation

2020-03-22 · Tristan Cazenave

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorithm for single player games. In this paper we propose to generalize NRPA with a temperature and a bias and to analyze theoretically the algorithms. Th…

Traveling Salesman Problem

Eterna is Solved

2025-05-04 · Tristan Cazenave

RNA design consists of discovering a nucleotide sequence that folds into a target secondary structure. It is useful for synthetic biology, medicine, and nanotechnology. We propose Montparnasse, a Multi Objective Generali…

Stabilized Nested Rollout Policy Adaptation

2021-01-10 · Tristan Cazenave, Jean-Baptiste Sevestre, Matthieu Toulemont

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorithm for single player games. In this paper we propose to modify NRPA in order to improve the stability of the algorithm. Experiments show it improves …

Adaptive Bias Generalized Rollout Policy Adaptation on the Flexible Job-Shop Scheduling Problem

2025-05-13 · Lotfi Kobrosly, Marc-Emmanuel Coupvent des Graviers, Christophe Guettier, Tristan Cazenave

The Flexible Job-Shop Scheduling Problem (FJSSP) is an NP-hard combinatorial optimization problem, with several application domains, especially for manufacturing purposes. The objective is to efficiently schedule multipl…

Combinatorial OptimizationJob Shop SchedulingScheduling