Algorithm and knowledge engineering for the TSPTW problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Algorithm and knowledge engineering for the TSPTW problem


In this paper we consider knowledge and algorithm engineering in combinatorial optimization for improved solving of complex TSPs with Time Windows. In addition to Nested MonteCarlo Search with Policy Adaption, as invented by Rosin (2011) and applied to TSP by Cazenave and Teytaud (2012), among other refinements to speed-up the exploration we perform beam search for an improved compromise of search breadth and depth and automated knowledge elicitation to seed the distribution for the exploration. We show promising results on TSPTW benchmarks and indicate improvements for real-world logistics scenarios by using a multiagent simulation system with each agent computing and trading their individual TSPTW solutions
Fichier principal
Vignette du fichier
tsptw.pdf (228.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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



Stefan Edelkamp, Max Gath, Tristan Cazenave, Fabien Teytaud. Algorithm and knowledge engineering for the TSPTW problem. IEEE Symposium on Computational Intelligence in Scheduling (CISched), Apr 2013, Singapour, Singapore. pp.44 - 51, ⟨10.1109/SCIS.2013.6613251⟩. ⟨hal-01406484⟩
88 View
545 Download



Gmail Facebook Twitter LinkedIn More