1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DS2012★ 1 cited
Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling
Thomas Philip Runarsson, Marc Schoenauer, Michèle Sebag
Greedy heuristics may be attuned by looking ahead for each possible choice, in an approach called the rollout or Pilot method. These methods may be seen as meta-heuristics that can…
cs.AI2012★ 1 cited
Alternative Restart Strategies for CMA-ES
Ilya Loshchilov, Marc Schoenauer, Michèle Sebag
This paper focuses on the restart strategy of CMA-ES on multi-modal functions. A first alternative strategy proceeds by decreasing the initial step-size of the mutation while doubl…
cs.AI2005
An efficient memetic, permutation-based evolutionary algorithm for real-world train timetabling
Marc Schoenauer, Yann Semet
Train timetabling is a difficult and very tightly constrained combinatorial problem that deals with the construction of train schedules. We focus on the particular problem of local…