Scribd
Upload
4 views1 page

Tutorial 5 - Evolutionary Algorithms I

This document outlines Tutorial 5 for COMP2024, focusing on Evolutionary Algorithms (EAs) and their applications. It covers the fundamentals of Genetic Algorithms (GAs), including core components, selection methods, crossover, mutation, and replacement strategies, as well as the distinction between GAs and Memetic Algorithms. Additionally, it includes practical applications of GAs, such as solving a MAX-SAT problem and function optimization.

Uploaded by

Simon Lau Boung Yew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views1 page

Tutorial 5 - Evolutionary Algorithms I

This document outlines Tutorial 5 for COMP2024, focusing on Evolutionary Algorithms (EAs) and their applications. It covers the fundamentals of Genetic Algorithms (GAs), including core components, selection methods, crossover, mutation, and replacement strategies, as well as the distinction between GAs and Memetic Algorithms. Additionally, it includes practical applications of GAs, such as solving a MAX-SAT problem and function optimization.

Uploaded by

Simon Lau Boung Yew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

COMP2024 Spring 2025

Tutorial 5 – Evolutionary Algorithms I


1. What are Evolutionary Algorithms (EAs), and why are they useful?

2. Explain the core components of a Genetic Algorithm (GA).

3. What are the key selection methods used in GAs?

4. Explain the role of crossover in Genetic Algorithms and describe its types.

5. What is the role of mutation in Genetic Algorithms?

6. What is a replacement strategy in GAs, and what are the main types?

7. Define Memetic Algorithms and explain how they differ from Genetic Algorithms.

8. Compare Genetic Algorithms (GAs) and Memetic Algorithms (MAs).

9. Apply a Genetic Algorithm to solve a MAX-SAT problem.


Problem:
Given a MAX-SAT formula with 6 variables {a, b, c, d, e, f}, initialize a population
of 4 individuals, evaluate fitness, and apply Roulette Wheel Selection to choose
two parents for crossover.
10. Implement a Genetic Algorithm for function optimization.

Prepared by Simon Lau Boung Yew Page 1 of 1

You might also like