Project Title: GHI-T : A Tree Based Greedy Heuristic for The Workforce Scheduling 
Routing Problem  
Student: Grzegorz WACLAWEK 
Course: MSci in Computer Science with Artificial Intelliogence 

Abstract: 
The workforce scheduling routing problem is a combinatorial optimisation problem 
where a set of workers make visits to location and perform tasks. The goal of 
this problem is to minimise the costs associated with these operations. 
This project explores a greedy heuristic for solving this problem on a set 
of instances. The greedy heuristic is modified into a tree-search in order to 
obtain improved solutions for the set of problem instances.