Assigning and scheduling service visits in a mixed urban/rural setting

Thumbnail Image
printed.pdf(915.37 KB)
Accepted Version
Antunes, Mark
Armant, Vincent
Brown, Kenneth N.
Desmond, Daniel
Escamocher, Guillaume
George, Anne-Marie
Grimes, Diarmuid
O'Keeffe, Mike
Lin, Yiqing
O'Sullivan, Barry
Journal Title
Journal ISSN
Volume Title
World Scientific Publishing Company
Research Projects
Organizational Units
Journal Issue
This paper describes a maintenance scheduling application, which was developed together with an industrial partner. This is a highly combinatorial decision process, to plan and schedule the work of a group of travelling repair technicians, which perform preventive and corrective maintenance tasks at customer locations. Customers are located both in urban areas, where many customers are in close proximity, and in sparsely populated rural areas, where the travel time between customer sites is significant. To balance the workload for the agents, we must consider both the productive working time, as well as the travel between locations. As the monolithic problem formulation is unmanageable, we introduce a problem decomposition into multiple sequential steps, that is compatible with current management practice. We present and compare different models for the solution steps, and discuss results on datasets provided by the industrial partner.
Maintenance scheduling , Service planning , Travelling repair person
Antunes, M., Armant, V., Brown, K. N., Desmond, D., Escamocher, G., George, A.-M., Grimes, D., O'Keeffe, M., Lin, Y., O'Sullivan, B., Ozturk, C., Quesada, L., Siala, M., Simonis, H. and Wilson, N. (2020) 'Assigning and scheduling service visits in a mixed urban/rural setting', International Journal on Artificial Intelligence Tools, 29(3-4), 2060007 (31pp). doi: 10.1142/S0218213020600076
Link to publisher’s version
© 2020, World Scientific Publishing Company. All rights reserved. This is the accepted version of an article published in International Journal on Artificial Intelligence Tools, available online: