15
500
Hamilton
COMPX301 and a further 30 points at 300 level in Computer Science
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.
Teaching Periods and Locations
-
23B (HAM)CancelledContact the School or Faculty Office for more information.
|
|
|
|
|
---|---|---|---|---|
23B (HAM) |
Cancelled | Contact the School or Faculty Office for more information. |
If your paper outline is not linked below, try the previous year's version of this paper.
Additional information
- Paper details current as of 1 Jun 2024 22:18pm
- Indicative fees current as of 13 Sep 2024 01:20am