Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows

Abstract

In this paper, we are interested in the minimization of the travel cost of the traveling salesman problem with time windows. In order to do this minimization we use a Nested Rollout Policy Adaptation (NRPA) algorithm. NRPA has multiple levels and maintains the best tour at each level. It consists in learning a rollout policy at each level. We also show how to improve the original algorithm with a modified rollout policy that helps NRPA to avoid time windows violations.
Fichier principal
Vignette du fichier
tsptwnrpa.pdf (1.41 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01406457 , version 1 (01-12-2016)

Identifiers

Cite

Tristan Cazenave, Fabien Teytaud. Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows. LION, Jan 2012, Paris, France. pp.42 - 54, ⟨10.1007/978-3-642-34413-8_4⟩. ⟨hal-01406457⟩
161 View
353 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More