Metaheuristic Algorithms - COMPX556 (2020)
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 |
| Restriction(s): | COMP456, COMP556 |
Trimesters and Locations
| Occurrence Code | When taught | Where taught |
|---|---|---|
| 20B (HAM) | B Trimester : 13 Jul 2020 - 8 Nov 2020 | Hamilton |
Timetabled Lectures
The Timetable for 2020 is not available.
Indicative Fees for Metaheuristic Algorithms (COMPX556)
| Occurrence | Domestic | International | |
|---|---|---|---|
| Tuition | Resource | ||
| 20B (HAM) | $1052 | $4293 | |
Paper Outlines for Metaheuristic Algorithms (COMPX556)
The following paper outlines are available for Metaheuristic Algorithms (COMPX556).
If your paper occurrence is not listed contact the Faculty or School office.
Additional Information
Available Subjects: Computer Science
Other available years: Metaheuristic Algorithms - COMPX556 (2023) , Metaheuristic Algorithms - COMPX556 (2022) , Metaheuristic Algorithms - COMPX556 (2021)
Paper details current as of : 31 May 2023 12:20pm
Indicative fees current as of : 3 June 2023 4:30am