Case file CS-05ISC747Group project
Ant Colony Optimization for HRDC Auditor Scheduling and Routing
A nature-inspired optimisation project that applies Ant Colony Optimization (ACO) to an auditor scheduling and routing problem for HRDC (HRD Corp).
- Headline
- ACOAnt Colony Optimization
- Course
- ISC747 Optimization with Nature-Inspired Computing
- Format
- Group project
- Programme
- Master of Data Science, UiTM
- Team
- 4 members
// 01 · Problem
The problem
Scheduling auditors and routing them between audits is a combinatorial problem: the number of possible assignments and visit orders grows quickly as auditors and audits are added.
The project models an auditor scheduling and routing problem for HRDC (HRD Corp) and solves it with a nature-inspired metaheuristic.
// 02 · Approach
The approach
STEP 01
Problem framing
Framed the HRDC case as a combined scheduling and routing problem: which auditor takes which audits, and in what order.
STEP 02
Ant Colony Optimization
Applied ACO, in which artificial ants build candidate solutions step by step and pheromone trails reinforce the better ones over successive iterations.
// 03 · Results
Results
- This page covers the problem and the approach only. Results are not published here.
// 04 · Tools
Tools and methods
- Ant Colony Optimization (ACO)
// 05 · Role & team
Role and team
Group project for ISC747 Optimization with Nature-Inspired Computing, Master of Data Science, UiTM.
- Muhammad Aiman Akmal bin Pardan
- Naelah Farafisyah binti Yahaya
- Nur Fathihah binti Salmizi
- Nabil TakiyuddinThis site