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|
Timetabled Lectures for Metaheuristic Algorithms (COMPX556)
There are no timetabled lectures for 2021 occurrences of COMPX556 in 2021.
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 2020 paper outlines are available for COMPX556. Please contact the Faculty or School office for details on 2021 outlines.
Other available years: Metaheuristic Algorithms - COMPX556 (2020)
Paper details current as of : 18 May 2021 9:05am
Indicative fees current as of : 18 May 2021 4:30am