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-23B (HAM) has been cancelled. Please contact the School or Faculty Office for more information.
|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 for Metaheuristic Algorithms (COMPX556)
There are no timetabled lectures for 2023 occurrences of COMPX556 in 2023.
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)
|Fees Not Available|
The following 2022 paper outlines are available for COMPX556. Please contact the Faculty or School office for details on 2023 outlines.
Paper details current as of : 23 January 2023 7:25pm
Indicative fees current as of : 28 January 2023 4:30am