Skip to Main content Skip to Navigation
Conference papers

Algorithm and knowledge engineering for the TSPTW problem

Abstract : 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
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-01406484
Contributor : Fabien Teytaud <>
Submitted on : Thursday, December 1, 2016 - 11:45:00 AM
Last modification on : Monday, July 19, 2021 - 2:50:42 PM
Long-term archiving on: : Thursday, March 23, 2017 - 12:00:29 AM

File

tsptw.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

312

Files downloads

952