27.07.2013 Views

The Doctor Rostering Problem - Asser Fahrenholz

The Doctor Rostering Problem - Asser Fahrenholz

The Doctor Rostering Problem - Asser Fahrenholz

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Chapter 4. Solving the DRP 25<br />

• Reactive GRASP in which the RCL parameter is automatically tuned in each it-<br />

eration of GRASP, produces better results than a static RCL parameter. Resende<br />

and Ribeiro [20] restates a formulation including a set of RCL parameters coupled<br />

with a probability to choose that exact parameter. <strong>The</strong> probability for each pa-<br />

rameter is reevaluated each iteration, using the average value of solutions found<br />

through the parameter and the incumbent.<br />

• Cost pertubation is an idea of maintaining a list of prizes corresponding to the<br />

value of adding each element to the solution in the construction phase. This list<br />

is then maintained by two different schemes: Pertubation by elimination, where a<br />

fraction of the element prizes are set to zero, and Pertubation by prize changes, in<br />

which each prize is changed by a factor produced by a parameter.<br />

• Bias functions are probability distributions used to bias the selection of the RCL<br />

elements.<br />

• Intelligent construction: memory and learning that covers long-term memory, such<br />

as the one used in Tabu Search.<br />

• POP in construction, where a Local Search is applied during the construction of<br />

the initial solution.<br />

• Path-relinking, where paths between elite solutions are constructed and explored<br />

in hope of finding better solutions.<br />

<strong>The</strong> time horizon on this project did not allow implementation of these improvements,<br />

however, specific improvements to the current implementation has been suggested in<br />

chapter 8.<br />

4.3.4 <strong>The</strong> Simulated Annealing metaheuristic<br />

<strong>The</strong> Simulated Annealing (SA) algorithm is an analogue to the real world process that<br />

takes place during controlled cooling of solids. If a solid is melted, the particles in the<br />

matter arranges themselves randomly, whereas in a solid state, the particles arranges<br />

themselves in a structured lattice (Aarts et al. [1]). When cooling the melted solid, the<br />

energy of the atoms decreases and the atoms then arrange themselves in the lattice. At<br />

lower temperatures, a change of state in the solid is less likely to occur. <strong>The</strong> result of the<br />

process, with a high enough maximum temperature and a slow enough cooling, being a<br />

solid whose particles are arranged in the most stable way possible.<br />

Analoguesly, in the appliance of SA to computational problems, the chance of accepting<br />

a neighborhood leading to a worse objective function value (higher energy in the solid)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!