TY - JOUR
T1 - Assigning and Scheduling Service Visits in a Mixed Urban/Rural Setting
AU - Antunes, Mark
AU - Armant, Vincent
AU - Brown, Kenneth N.
AU - Desmond, Daniel
AU - Escamocher, Guillaume
AU - George, Anne Marie
AU - Grimes, Diarmuid
AU - O'Keeffe, Mike
AU - Lin, Yiqing
AU - O'Sullivan, Barry
AU - Ozturk, Cemalettin
AU - Quesada, Luis
AU - Siala, Mohamed
AU - Simonis, Helmut
AU - Wilson, Nic
N1 - Publisher Copyright:
© 2020 World Scientific Publishing Company.
PY - 2020/6/1
Y1 - 2020/6/1
N2 - This papera 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.
AB - This papera 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.
KW - Maintenance scheduling
KW - service planning
KW - travelling repair person
UR - https://www.scopus.com/pages/publications/85086847987
U2 - 10.1142/S0218213020600076
DO - 10.1142/S0218213020600076
M3 - Article
AN - SCOPUS:85086847987
SN - 0218-2130
VL - 29
JO - International Journal on Artificial Intelligence Tools
JF - International Journal on Artificial Intelligence Tools
IS - 3-4
M1 - 2060007
ER -