Metaheuristic Algorithms - COMPX556 (2023)

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
23B (HAM)B Trimester : 10 Jul 2023 - 5 Nov 2023 Hamilton
COMPX556-23B (HAM) is offered in FLEXI mode. For those taking the paper online, please note there are some elements that require students to be online at specified times.

Timetabled Lectures

The Timetable for 2023 is not available.


Indicative Fees

Fees for 2023 are not yet available.


Paper Outlines

The following 2022 paper outlines are available for COMPX556. Please contact the Faculty or School office for details on 2023 outlines.

Additional Information

Available Subjects:  Artificial Intelligence | Computer Science | Software Engineering

Other available years: Metaheuristic Algorithms - COMPX556 (2022) , Metaheuristic Algorithms - COMPX556 (2021) , Metaheuristic Algorithms - COMPX556 (2020)

Paper details current as of : 19 August 2022 4:03pm
Indicative fees current as of : 20 August 2022 4:30am

This page has been reformatted for printing.