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.
|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|
|COMPX556-22B (HAM) is offered in a FLEXI mode. No online elements of this paper require student engagement at specific times / days.|
Timetabled Lectures for Metaheuristic Algorithms (COMPX556)
There are no timetabled lectures for 2022 occurrences of COMPX556 in 2022.
NB:There may be other timetabled events for this paper such as tutorials or workshops.
Visit the online timetable for COMPX556 for more details
Indicative Fees for Metaheuristic Algorithms (COMPX556)
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.
Paper details current as of : 3 October 2023 8:50am
Indicative fees current as of : 5 October 2023 4:30am