Thumbnail - Request a copy

Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows

Cazenave, Tristan; Teytaud, Fabien; Rimmel, Arpad (2011), Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows, in Uyar, Sima A.; Urquhart, Neil; Tettamanzi, Andrea G.B.; Tarantino, Ernesto; Squillero, Giovanni; Romero, Juan; Prins, Christian; Greenfield, Gary; Grahl, Jörn; Farooq, Muddassar; Drechsler, Rolf; Di Caro, Gianni A.; Brabazon, Anthony; Di Chio, Cecilia, Applications of Evolutionary Computation. EvoApplications 2011: EvoCOMNET, EvoFIN, EvoHOT, EvoMUSART, EvoSTIM, and EvoTRANSLOG, Torino, Italy, April 27-29, 2011, Proceedings, Part II, Springer : Berlin, p. 501-510. http://dx.doi.org/10.1007/978-3-642-20520-0_51

Type
Communication / Conférence
Date
2011
Conference title
EvoApplications 2011
Conference date
2011-04
Conference city
Turin
Conference country
Italie
Book title
Applications of Evolutionary Computation. EvoApplications 2011: EvoCOMNET, EvoFIN, EvoHOT, EvoMUSART, EvoSTIM, and EvoTRANSLOG, Torino, Italy, April 27-29, 2011, Proceedings, Part II
Book author
Uyar, Sima A.; Urquhart, Neil; Tettamanzi, Andrea G.B.; Tarantino, Ernesto; Squillero, Giovanni; Romero, Juan; Prins, Christian; Greenfield, Gary; Grahl, Jörn; Farooq, Muddassar; Drechsler, Rolf; Di Caro, Gianni A.; Brabazon, Anthony; Di Chio, Cecilia
Publisher
Springer
Series title
Lecture Notes in Computer Science
Series number
6625
Published in
Berlin
ISBN
978-3-642-20519-4
Pages
501-510
Publication identifier
Metadata
Show full item record
Author(s)
Cazenave, Tristan
Teytaud, Fabien
Rimmel, Arpad
Abstract (EN)
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of the travel cost. To solve this problem, we propose to use the nested Monte-Carlo algorithm combined with a Self-Adaptation Evolution Strategy. We compare the efficiency of several fitness functions. We show that with our technique we can reach the state of the art solutions for a lot of problems in a short period of time.
Subjects / Keywords
Traveling-salesman problem; Time Window; Self Adaptation; Nested Monte-Carlo