COMPX556-20B (HAM)

Metaheuristic Algorithms

15 Points

Edit Header Content
Division of Health Engineering Computing & Science
School of Computing and Mathematical Sciences
Department of Computer Science

Staff

Edit Staff Content

Convenor(s)

Michael Mayo

Michael Mayo
4403
G.2.24
See Moodle
michael.mayo@waikato.ac.nz

Lecturer(s)

Administrator(s)

Placement/WIL Coordinator(s)

Tutor(s)

Student Representative(s)

Lab Technician(s)

Librarian(s)

: alistair.lamb@waikato.ac.nz

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.
Edit Staff Content

Paper Description

Edit Paper Description Content
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.
Edit Paper Description Content

Paper Structure

Edit Paper Structure Content
The paper involves involves a mixture of online videos and in person or opportunities for discussion.
Edit Paper Structure Content

Learning Outcomes

Edit Learning Outcomes Content

Students who successfully complete the paper should be able to:

  • Understand and apply basic metaheuristic algorithms for solving difficult optimisation problems.
    Linked to the following assessments:
  • Conduct a thorough experimental investigation of a given metaheuristic for a given problem.
    Linked to the following assessments:
  • Communicate the results of a experimental investigation in writing
    Linked to the following assessments:
  • Be conversant with a wide selection of modern metaheuristic algorithms and their properties and characteristics
    Linked to the following assessments:
Edit Learning Outcomes Content
Edit Learning Outcomes Content

Assessment

Edit Assessments Content
This paper is 100% internal assessment. The assessment will consist of a mixture of labs, presentations, and a project.
Edit Additional Assessment Information Content

Assessment Components

Edit Assessments Content

The internal assessment/exam ratio (as stated in the University Calendar) is 100:0. There is no final exam. The final exam makes up 0% of the overall mark.

The internal assessment/exam ratio (as stated in the University Calendar) is 100:0 or 0:0, whichever is more favourable for the student. The final exam makes up either 0% or 0% of the overall mark.

Component DescriptionDue Date TimePercentage of overall markSubmission MethodCompulsory
1. Assignment
21 Aug 2020
5:00 PM
20
  • Online: Submit through Moodle
2. Online Discussion
5
  • Online: Moodle Forum Discussion
3. Online Test
22 Sep 2020
9:00 AM
25
  • Online: Submit through Moodle
4. Project
27 Oct 2020
9:00 AM
50
  • Online: Submit through Moodle
Assessment Total:     100    
Failing to complete a compulsory assessment component of a paper will result in an IC grade
Edit Assessments Content

Required and Recommended Readings

Edit Required Readings Content

Required Readings

Edit Required Readings Content

Handbook of Metaheuristics, 3rd Edition, currently available for free via the library

Edit Required Readings Content

Recommended Readings

Edit Recommended Readings Content
Additional readings will be supplied on Moodle.
Edit Recommended Readings Content

Other Resources

Edit Other Resources Content
In addition to the readings, students should be familiar with the parallel programming capabilities of at least one programming language.
Edit Other Resources Content

Online Support

Edit Online Support Content
Lectures for this course will be in the form on online videos. Moodle and email will be available for discussions and questions. Students will be able to interact with the lecturer both online and in person.
Edit Online Support Content

Workload

Edit Workload Content
The expected workload is about 10 hours per week for the 15 teaching weeks of the semester.
Edit Workload Content

Linkages to Other Papers

Edit Linkages Content

Prerequisite(s)

Prerequisite papers: COMPX301 and a further 30 points at 300 level in Computer Science

Corequisite(s)

Equivalent(s)

Restriction(s)

Restricted papers: COMP456, COMP556

Edit Linkages Content