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.
|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.
|21B (HAM)||B Trimester : 12 Jul 2021 - 7 Nov 2021||Hamilton|
The Timetable for 2021 is not available.
Indicative Fees for Metaheuristic Algorithms (COMPX556)
|Fees Not Available|
Paper outlines are currently not available for this paper. Please contact the Faculty or School office for further details.
Paper details current as of : 2 February 2023 8:51am
Indicative fees current as of : 3 February 2023 4:30am