A study of evolutionary multiobjective algorithms and their application to knapsack and nurse scheduling problems

Le, Khoi Nguyen (2011) A study of evolutionary multiobjective algorithms and their application to knapsack and nurse scheduling problems. PhD thesis, University of Nottingham.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (16MB) | Preview


Evolutionary algorithms (EAs) based on the concept of Pareto dominance seem the most suitable technique for multiobjective optimisation. In multiobjective optimisation, several criteria (usually conflicting) need to be taken into consideration simultaneously to assess a quality of a solution. Instead of finding a single solution, a set of trade-off or compromise solutions that represents a good approximation to the Pareto optimal set is often required. This thesis presents an investigation on evolutionary algorithms within the framework of multiobjective optimisation. This addresses a number of key issues in evolutionary multiobjective optimisation. Also, a new evolutionary multiobjective (EMO) algorithm is proposed. Firstly, this new EMO algorithm is applied to solve the multiple 0/1 knapsack problem (a wellknown benchmark multiobjective combinatorial optimisation problem) producing competitive results when compared to other state-of-the-art MOEAs.

Secondly, this thesis also investigates the application of general EMO algorithms to solve real-world nurse scheduling problems. One of the challenges in solving real-world nurse scheduling problems is that these problems are highly constrained and specific-problem heuristics are normally required to handle these constraints. These heuristics have considerable influence on the search which could override the effect that general EMO algorithms could have in the solution process when applied to this type of problems. This thesis outlines a proposal for a general approach to model the nurse scheduling problems without the requirement of problem-specific heuristics so that general EMO algorithms could be applied. This would also help to assess the problems and the performance of general EMO algorithms more fairly.

Item Type: Thesis (University of Nottingham only) (PhD)
Supervisors: Burke, E.K.
Landa-Silva, D.
Keywords: evolutionary programming, evolutionary computation, computer algorithms, knapsack problem, nurse scheduling
Subjects: Q Science > QA Mathematics > QA 75 Electronic computers. Computer science
Faculties/Schools: UK Campuses > Faculty of Science > School of Computer Science
Item ID: 13116
Depositing User: EP, Services
Date Deposited: 21 Feb 2013 13:07
Last Modified: 17 Dec 2017 09:14
URI: https://eprints.nottingham.ac.uk/id/eprint/13116

Actions (Archive Staff Only)

Edit View Edit View