Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Evolution and Optimum Seeking: The Sixth Generation
Evolution and Optimum Seeking: The Sixth Generation
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
A Memetic Approach to the Nurse Rostering Problem
Applied Intelligence
Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Nurse Rostering at the Hospital Authority of Hong Kong
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Selected Papers from AISB Workshop on Evolutionary Computing
Fast Practical Evolutionary Timetabling
Selected Papers from AISB Workshop on Evolutionary Computing
An analysis of the behavior of a class of genetic adaptive systems.
An analysis of the behavior of a class of genetic adaptive systems.
A hybrid AI approach for nurse rostering problem
Proceedings of the 2003 ACM symposium on Applied computing
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
Memetic algorithms for parallel code optimization
International Journal of Parallel Programming
Hill climbers and mutational heuristics in hyperheuristics
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Memetic algorithms for nurse rostering
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Meta-Lamarckian learning in memetic algorithms
IEEE Transactions on Evolutionary Computation
Memetic algorithms for parallel code optimization
International Journal of Parallel Programming
A Grouping Genetic Algorithm Using Linear Linkage Encoding for Bin Packing
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
A multi-objective approach for robust airline scheduling
Computers and Operations Research
A genetic algorithm for generating improvised music
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
The Interleaved Constructive Memetic Algorithm and its application to timetabling
Computers and Operations Research
A harmony search algorithm for nurse rostering problems
Information Sciences: an International Journal
Cooperative search for fair nurse rosters
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
This paper presents an empirical study on memetic algorithms in two parts. In the first part, the details of the memetic algorithm experiments with a set of well known benchmark functions are described. In the second part, a heuristic template is introduced for solving timetabling problems. Two adaptive heuristics that utilize a set of constraint-based hill climbers in a co-operative manner are designed based on this template. A hyper-heuristic is a mechanism used for managing a set of low-level heuristics. At each step, an appropriate heuristic is chosen and applied to a candidate solution. Both adaptive heuristics can be considered as hyper-heuristics. Memetic algorithms employing each hyper-heuristic separately as a single hill climber are experimented on a set of randomly generated nurse rostering problem instances. Moreover, the standard genetic algorithm and two self-generating multimeme memetic algorithms are compared to the proposed memetic algorithms and a previous study.