171 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- A. Adamatzky2 profiles133 · h 51
- R. McClatchey2 profiles53 · h 26
- L. Bull37 · h 36
- B. D. L. de Lacy Costello27 · h 16
- G. J. Martínez21 · h 19
- J. Jones18 · h 20
- E. Gale13 · h 17
- Richard Mayne13 · h 19
- R. Preen13 · h 10
- Jetendr Shamdasani2 profiles12 · h 11
- Michail-Antisthenis I. Tsompanas2 profiles12 · h 15
- A. Branson11 · h 13
- European Organization for Nuclear ResearchCH20 papers
- Bristol Robotics LaboratoryGB15 papers
- University of BristolGB14 papers
- Instituto Politécnico NacionalMX10 papers
- Democritus University of ThraceGR8 papers
- Universidad Nacional Autónoma de MéxicoMX7 papers
- Universidad Politécnica de MadridES7 papers
- National University of Sciences and TechnologyPK6 papers
- University of WarwickGB6 papers
- Universidad Autónoma del Estado de HidalgoMX5 papers
- Kanazawa Institute of TechnologyJP4 papers
- Universidad Carlos III de MadridES4 papers
6 papers · 2 filters
Building Better Nurse Scheduling Algorithms
Uwe Aickelin, Paul White
The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, t…
On the Application of Hierarchical Coevolutionary Genetic Algorithms: Recombination and Evaluation Partners
Uwe Aickelin, Larry Bull
This paper examines the use of a hierarchical coevolutionary genetic algorithm under different partnering strategies. Cascading clusters of sub-populations are built from the botto…
An Indirect Genetic Algorithm for Set Covering Problems
Uwe Aickelin
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. t…
Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem
Uwe Aickelin, Kathryn Dowsland
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betwe…
Are complex systems hard to evolve?
Andy Adamatzky, Larry Bull
Evolutionary complexity is here measured by the number of trials/evaluations needed for evolving a logical gate in a non-linear medium. Behavioural complexity of the gates evolved…
Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
Uwe Aickelin, Kathryn Dowsland
There is considerable interest in the use of genetic algorithms to solve problems arising in the areas of scheduling and timetabling. However, the classical genetic algorithm parad…