e-space
Manchester Metropolitan University's Research Repository

Solving the service technician routing and scheduling problem with time windows

Khalfay, Amy, Crispin, Alan and Crockett, Keeley ORCID logoORCID: https://orcid.org/0000-0003-1941-6201 (2020) 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.

[img]
Preview
Accepted Version
Download (137kB) | Preview

Abstract

In 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

Activity Overview
6 month trend
9Downloads
6 month trend
223Hits

Additional statistics for this dataset are available via IRStats2.

Altmetric

Actions (login required)

View Item View Item