Metaheuristic Algorithms - COMPX556 (2021)
Metaheuristic are stochastic search algorithms for solving massive scale combinatorial problems where exact algorithms do not exist. This paper explores the state-of-the-art metaheuristics such as GRASP, particle swarm optimisation, and parallel metaheuristics, along with their applications in operations research, science and engineering.
Paper Information
| Points: | 15.0 |
|---|---|
| Prerequisite(s): | COMPX301 and a further 30 points at 300 level in Computer Science |
| Internal assessment / examination: | 100:0 |
Trimesters and Locations
| Occurrence Code | When taught | Where taught |
|---|
COMPX556-21B (HAM) has been cancelled. Please contact the School or Faculty Office for more information.
Cancelled Occurrences
| Cancelled Occurrences | ||
|---|---|---|
| 21B (HAM) | B Trimester : 12 Jul 2021 - 7 Nov 2021 | Hamilton |
Timetabled Lectures
The Timetable for 2021 is not available.
Indicative Fees for Metaheuristic Algorithms (COMPX556)
| Occurrence | Domestic | International | |
|---|---|---|---|
| Tuition | Resource | ||
| Fees Not Available | |||
Paper Outlines
Paper outlines are currently not available for this paper. Please contact the Faculty or School office for further details.
Additional Information
Available Subjects: Computer Science | Software Engineering
Other available years: Metaheuristic Algorithms - COMPX556 (2023) , Metaheuristic Algorithms - COMPX556 (2022) , Metaheuristic Algorithms - COMPX556 (2020)
Paper details current as of : 31 May 2023 12:20pm
Indicative fees current as of : 3 June 2023 4:30am