15
500
Hamilton
COMPX301 and a further 30 points at 300 level in Computer Science
COMP456, COMP556
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
-
21B (HAM)CancelledContact the School or Faculty Office for more information.
|
|
|
|
|
|
|---|---|---|---|---|
|
21B (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.
Indicative Fees
You will be sent an enrolment agreement which will confirm your fees. Tuition fees shown are indicative only and may change. There are additional fees and charges related to enrolment - please see the Table of Fees and Charges for more information.
|
|
|
|---|---|
| 21B (HAM) | $1,063 |
You will be sent an enrolment agreement which will confirm your fees. Tuition fees shown are indicative only and may change. There are additional fees and charges related to enrolment - please see the Table of Fees and Charges for more information.
|
|
|
|---|---|
| 21B (HAM) | $4,422 |
You will be sent an enrolment agreement which will confirm your fees. Tuition fees shown are indicative only and may change. There are additional fees and charges related to enrolment - please see the Table of Fees and Charges for more information.
Available subjects
Additional information
- Paper details current as of 27 Jan 2024 20:05pm
- Indicative fees current as of 16 Apr 2024 01:30am