• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

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

Cazenave, Tristan; Teytaud, Fabien (2012), Application of the Nested Rollout Policy Adaptation Algorithm to the Traveling Salesman Problem with Time Windows, in Hamadi, Youssef; Schoenauer, Marc, Learning and Intelligent Optimization 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers, Springer : Berlin, p. 42-54. 10.1007/978-3-642-34413-8_4

View/Open
tsptwnrpa.pdf (1.404Mb)
Type
Communication / Conférence
Date
2012
Conference title
6th International Conference on Learning and Intelligent Optimization, LION 6
Conference date
2012-01
Conference city
Paris
Conference country
France
Book title
Learning and Intelligent Optimization 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers
Book author
Hamadi, Youssef; Schoenauer, Marc
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
7219
Published in
Berlin
ISBN
978-3-642-34412-1
Number of pages
514
Pages
42-54
Publication identifier
10.1007/978-3-642-34413-8_4
Metadata
Show full item record
Author(s)
Cazenave, Tristan
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Teytaud, Fabien
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
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.
Subjects / Keywords
Nested Monte-Carlo; Nested Rollout Policy Adaptation; Traveling Salesman Problem with Time Windows

Related items

Showing items related by title and author.

  • Thumbnail
    Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows 
    Cazenave, Tristan; Teytaud, Fabien; Rimmel, Arpad (2011) Communication / Conférence
  • Thumbnail
    Beam Nested Rollout Policy Adaptation 
    Cazenave, Tristan; Teytaud, Fabien (2012) Communication / Conférence
  • Thumbnail
    Perturbed Decomposition Algorithm applied to the multi-objective Traveling Salesman Problem 
    Cornu, Marek; Cazenave, Tristan; Vanderpooten, Daniel (2017) Article accepté pour publication ou publié
  • Thumbnail
    Stabilized Nested Rollout Policy Adaptation 
    Cazenave, Tristan; Sevestre, Jean-Baptiste; Toulemont, Matthieu (2020) Communication / Conférence
  • Thumbnail
    Stabilized Nested Rollout Policy Adaptation 
    Cazenave, Tristan; Sevestre, Jean-Baptiste; Toulemont, Matthieu (2020) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo