Metaheuristic Algorithms - COMPX556 (2022)

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
22B (HAM)B Trimester : 18 Jul 2022 - 13 Nov 2022 Hamilton

Timetabled Lectures

The Timetable for 2022 is not available.


Indicative Fees

Fees for 2022 are not yet 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 (2021) , Metaheuristic Algorithms - COMPX556 (2020)

Paper details current as of : 21 September 2021 3:21pm
Indicative fees current as of : 24 September 2021 4:30am

This page has been reformatted for printing.