Genetic Algorithms for Multiple-Choice Problems

04/19/2010
by   Uwe Aickelin, et al.
0

This thesis investigates the use of problem-specific knowledge to enhance a genetic algorithm approach to multiple-choice optimisation problems.It shows that such information can significantly enhance performance, but that the choice of information and the way it is included are important factors for success.Two multiple-choice problems are considered.The first is constructing a feasible nurse roster that considers as many requests as possible.In the second problem, shops are allocated to locations in a mall subject to constraints and maximising the overall income.Genetic algorithms are chosen for their well-known robustness and ability to solve large and complex discrete optimisation problems.However, a survey of the literature reveals room for further research into generic ways to include constraints into a genetic algorithm framework.Hence, the main theme of this work is to balance feasibility and cost of solutions.In particular, co-operative co-evolution with hierarchical sub-populations, problem structure exploiting repair schemes and indirect genetic algorithms with self-adjusting decoder functions are identified as promising approaches.The research starts by applying standard genetic algorithms to the problems and explaining the failure of such approaches due to epistasis.To overcome this, problem-specific information is added in a variety of ways, some of which are designed to increase the number of feasible solutions found whilst others are intended to improve the quality of such solutions.As well as a theoretical discussion as to the underlying reasons for using each operator,extensive computational experiments are carried out on a variety of data.These show that the indirect approach relies less on problem structure and hence is easier to implement and superior in solution quality.

READ FULL TEXT
research
05/30/2013

Dienstplanerstellung in Krankenhaeusern mittels genetischer Algorithmen

This thesis investigates the use of problem-specific knowledge to enhanc...
research
12/16/2014

Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups

In this paper, we perform an experimental study of optimal recombination...
research
09/01/2011

Self-Adaptation Mechanism to Control the Diversity of the Population in Genetic Algorithm

One of the problems in applying Genetic Algorithm is that there is some ...
research
06/29/2014

Exploring Task Mappings on Heterogeneous MPSoCs using a Bias-Elitist Genetic Algorithm

Exploration of task mappings plays a crucial role in achieving high perf...
research
11/05/2020

Qualities, challenges and future of genetic algorithms: a literature review

Genetic algorithms, computer programs that simulate natural evolution, a...
research
03/19/2010

Nurse Rostering with Genetic Algorithms

In recent years genetic algorithms have emerged as a useful tool for the...
research
12/10/2020

Comparison of Update and Genetic Training Algorithms in a Memristor Crossbar Perceptron

Memristor-based computer architectures are becoming more attractive as a...

Please sign up or login with your details

Forgot password? Click here to reset