A grasp-knapsack hybrid for a nurse-scheduling problem

Authors:
Melissa D. Goodman;Kathryn A. Dowsland;Jonathan M. Thompson
Affiliations:
School of Mathematics, Cardiff University, Cardiff, UK CF24 4AG;School of Mathematics, Cardiff University, Cardiff, UK CF24 4AG and Gower Optimal Algorithms Ltd., Swansea, UK and School of Computer Science and IT, University of Nottingham, Nottingham, UK;School of Mathematics, Cardiff University, Cardiff, UK CF24 4AG
Venue:
Journal of Heuristics
Year:
2009

Citing 11
Cited 3

Constructing school timetables using simulated annealing: sequential and parallel algorithms

Management Science
Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies

DIMACS workshop on on Constraint programming and large scale discrete optimization
A GRASP for Coloring Sparse Graphs

Computational Optimization and Applications
A Memetic Approach to the Nurse Rostering Problem

Applied Intelligence
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

INFORMS Journal on Computing
Parallel GRASP with path-relinking for job shop scheduling

Parallel Computing - Special issue: Parallel computing in numerical optimization
A Tabu-Search Hyperheuristic for Timetabling and Rostering

Journal of Heuristics
An indirect genetic algorithm for a nurse-scheduling problem

Computers and Operations Research
Variable neighborhood search for nurse rostering problems

Metaheuristics
The State of the Art of Nurse Rostering

Journal of Scheduling
How to Solve It: Modern Heuristics

How to Solve It: Modern Heuristics

Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem

Computers and Operations Research
Hybrid swarm-based optimization algorithm of GA & VNS for nurse scheduling problem

ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Solving fuzzy Multidimensional Multiple-Choice Knapsack Problems: The multi-start Partial Bound Enumeration method versus the efficient epsilon-constraint method

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the application of a GRASP approach to a nurse-scheduling problem in which the objective is to optimise a set of preferences subject to a set of binding constraints. The balance between feasibility and optimality is a key issue. This is addressed by using a knapsack model to ensure that the solutions produced by the construction heuristic are easy to repair. Several construction heuristics and neighbourhoods are compared empirically. The best combination is further enhanced by a diversification strategy and a dynamic evaluation criterion. Tests show that it outperforms previously published approaches and finds optimal solutions quickly and consistently.