Sciweavers

Share
EVOW
2009
Springer

Binary Exponential Back Off for Tabu Tenure in Hyperheuristics

10 years 4 months ago
Binary Exponential Back Off for Tabu Tenure in Hyperheuristics
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) method used in network communication. We compare this method to a reduced Variable Neighbourhood Search (rVNS), greedy and random hyperheuristic approaches and other tabu search based heuristics for a complex real world workforce scheduling problem. Parallelisation is used to perform nearly 155 CPU-days of experiments. The results show that the new methods can produce results fitter than rVNS methods and within 99% of the fitness of those produced by a highly CPU-intensive greedy hyperheuristic in a fraction of the time.
Stephen Remde, Keshav P. Dahal, Peter I. Cowling,
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where EVOW
Authors Stephen Remde, Keshav P. Dahal, Peter I. Cowling, Nic Colledge
Comments (0)
books