
COMPX556-22B (HAM)
Metaheuristic Algorithms
15 Points
Staff
Convenor(s)
Michael Mayo
4403
G.2.24
michael.mayo@waikato.ac.nz
|
|
Administrator(s)
Librarian(s)
You can contact staff by:
- Calling +64 7 838 4466 select option 1, then enter the extension.
-
Extensions starting with 4, 5, 9 or 3 can also be direct dialled:
- For extensions starting with 4: dial +64 7 838 extension.
- For extensions starting with 5: dial +64 7 858 extension.
- For extensions starting with 9: dial +64 7 837 extension.
- For extensions starting with 3: dial +64 7 2620 + the last 3 digits of the extension e.g. 3123 = +64 7 262 0123.
Paper Description
This paper explores common metaheuristic algorithms such as variable neighbourhood search and mimetic algorithms, and their application in areas such as science, engineering and health informatics.
The learning outcomes for this paper are linked to Washington Accord graduate attributes WA1-WA11. Explanation of the graduate attributes can be found at: https://www.ieagreements.org/
Paper Structure
Learning Outcomes
Students who successfully complete the paper should be able to:
Assessment
This paper is 100% internal assessment.
If you are enrolled in a BE(Hons), samples of your work may be required as part of the Engineering New Zealand accreditation process for BE(Hons) degrees. Any samples taken will have the student name and ID redacted. If you do not want samples of your work collected then please email the engineering administrator, Natalie Shaw (natalie.shaw@waikato.ac.nz), to opt out.
Assessment Components
The internal assessment/exam ratio (as stated in the University Calendar) is 100:0. There is no final exam.
Required and Recommended Readings
Required Readings
Handbook of Metaheuristics, 3rd Edition, currently available for free via the library
Recommended Readings
Other Resources
Online Support
Workload
Linkages to Other Papers
Prerequisite(s)
Prerequisite papers: COMPX301 and a further 30 points at 300 level in Computer Science