Greedy heuristic for the workforce scheduling and routing problem

Russell, Samuel (2017) Greedy heuristic for the workforce scheduling and routing problem. [Dissertation (University of Nottingham only)]

[img] PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (395kB)

Abstract

The Workforce Scheduling and Routing Problem deals with the assignment of work¬ers to tasks throughout the course of the day, where each task is at a different geo¬graphical location. It is a problem that occurs frequently in the real world, with many different variations, that are usually tackled individually. This paper presents a greedy heuristic algorithm designed to solve the problem in a generalised case, containing as many of the common problem features as possible at once, so that it can be used to solve any instance of the problem. The intention is for the algorithm to create feasible solutions to the problem in a short amount of time, preferably with a good quality solution. The algorithm presented here is largely successful when handling the various problem features, but is tripped up by trying to satisfy workers who must work for a minimum number of hours in the day. The paper also presents three new data sets of problem instances generated to test the algorithm, or others like it.

Item Type: Dissertation (University of Nottingham only)
Keywords: WSRP, Workforce Scheduling and Routing Problem, Workforce Schedul¬ing & Routing Problem, Greedy, Constructive, Heuristic, Algorithm
Depositing User: Gonzalez-Orbegoso, Mrs Carolina
Date Deposited: 05 Jan 2018 12:28
Last Modified: 09 Jan 2018 14:16
URI: http://eprints.nottingham.ac.uk/id/eprint/48556

Actions (Archive Staff Only)

Edit View Edit View