The theory of evolution strategies
The theory of evolution strategies
A Hybrid Exact Algorithm for the TSPTW
INFORMS Journal on Computing
Covariance Matrix Adaptation Revisited --- The CMSA Evolution Strategy ---
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Beam-ACO for the travelling salesman problem with time windows
Computers and Operations Research
A new selection ratio for large population sizes
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
Monte-Carlo tree search for the physical travelling salesman problem
EvoApplications'12 Proceedings of the 2012t European conference on Applications of Evolutionary Computation
Nested rollout policy adaptation for Monte Carlo tree search
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Investigating monte-carlo methods on the weak schur problem
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
| Hi-index | 0.00 |
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.