Professional Documents
Culture Documents
Module ECMM423 (2022) Evolutionary Computation & Optimisation
Module ECMM423 (2022) Evolutionary Computation & Optimisation
DURATION: TERM 1 2 3
DURATION: WEEKS 0 11 0
Introduce the main and advanced concepts and techniques in the field of evolutionary computation and their application to optimisation problems;
Provide students with practical experience on the development and implementation of evolutionary techniques, and their appropriate usage.
INTENDED LEARNING OUTCOMES (ILOs) (see assessment section below for how ILOs will be assessed)
On successful completion of this module you should be able to:
Module Specific Skills and Knowledge
1. Demonstrate a clear and deep understanding of the main flavours of evolutionary algorithms and of types of optimisation problems;
2. Design new evolutionary operators, representations and fitness functions for specific applications (e.g., combinatorial/real, multi-objective, constrained);
3. Implement evolutionary algorithms and determine appropriate parameter settings to make them work well;
Discipline Specific Skills and Knowledge
4. Describe the role of evolutionary computation in the context of computer science, artificial intelligence, and optimisation;
5. Demonstrate familiarity with the main trends in evolutionary computation research;
6. Implement software for addressing real-world optimisation problems;
Personal and Key Transferable / Employment Skills and Knowledge
7. Read and digest research papers from conferences and journals;
8. Relate theoretical knowledge to practical concerns;
9. Conduct a research project including sound statistical analysis of experimental results, and contrast the results found with those expected given previously
published material;
10.Communicate succinctly information from publications to individuals unfamiliar with the material.
SYLLABUS PLAN - summary of the structure and academic content of the module
Indicative list of topics:
Summary of traditional optimisation techniques
History of evolutionary computation and biological background
Basic structure of an evolutionary algorithm
Genetic representation, search operators, selection schemes and selection pressure
Optimisation problems, fitness landscapes and multi-modality
Multi-population methods, co-evolution
Niching and speciation
Multi-objective evolutionary optimisation
Dynamic optimisation
Robust and noisy optimisation
Genetic programming
Evolving learning-machines, e.g. neural networks
Theoretical analysis of evolutionary algorithms
Experimental design
ASSESSMENT
FORMATIVE ASSESSMENT - for feedback and development purposes; does not count towards module grade
Form of Assessment Size of Assessment (e.g. duration/length) ILOs Assessed Feedback Method
Form of Assessment Size of Assessment (e.g. duration/length) ILOs Assessed Feedback Method
RE-ASSESSMENT NOTES
Reassessment will be by coursework in the failed or deferred element only. For referred candidates, the module mark will be capped at 50%. For deferred candidates,
the module mark will be uncapped.
RESOURCES
INDICATIVE LEARNING RESOURCES - The following list is offered as an indication of the type & level of
information that you are expected to consult. Further guidance will be provided by the Module Convener
Basic reading:
ELE: http://vle.exeter.ac.uk/
Other Resources:
Articles in journals and conference proceedings
Reading list for this module: