e-space
Manchester Metropolitan University's Research Repository

Solving the service technician routing and scheduling problem with time windows

Khalfay, Amy and Crispin, Alan and Crockett, Keeley (2019) Solving the service technician routing and scheduling problem with time windows. In: Intelligent Systems Conference (IntelliSys) 2019, 05 September 2019 - 06 September 2019, London, United Kingdom. (In Press)

[img]
Restricted to Repository staff only

Download (137kB)

Abstract

n this paper a greedy randomized heuristic is used to solve a service technician routing and scheduling problem with time windows. Time window constraints occur in many sectors such as telecommunications, maintenance, call centres, warehouses and healthcare, and is a way of service providers differentiating themselves to maintain customer satisfaction and ultimately retain market share. The greedy randomized heuristic is coupled with a simulated annealing with restart metaheuristic and tested on 36 problem instances. The greedy randomized heuristic is compared against a parallel adaptive large neighbourhood search heuristic, presenting new best known results in 18% of the datasets

Impact and Reach

Statistics

Downloads
Activity Overview
1Download
24Hits

Additional statistics for this dataset are available via IRStats2.

Actions (login required)

Edit Item Edit Item