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

Show simple item record

dc.contributor.author Antunes, Mark
dc.contributor.author Armant, Vincent
dc.contributor.author Brown, Kenneth N.
dc.contributor.author Desmond, Daniel
dc.contributor.author Escamocher, Guillaume
dc.contributor.author George, Anne-Marie
dc.contributor.author Grimes, Diarmuid
dc.contributor.author O'Keeffe, Mike
dc.contributor.author Lin, Yiqing
dc.contributor.author O'Sullivan, Barry
dc.contributor.author Ozturk, Cemalettin
dc.contributor.author Quesada, Luis
dc.contributor.author Siala, Mohamed
dc.contributor.author Simonis, Helmut
dc.contributor.author Wilson, Nic
dc.date.accessioned 2020-07-31T12:39:13Z
dc.date.available 2020-07-31T12:39:13Z
dc.date.issued 2020-06-18
dc.identifier.citation 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 en
dc.identifier.volume 29 en
dc.identifier.issued 3-4 en
dc.identifier.startpage 1 en
dc.identifier.endpage 31 en
dc.identifier.issn 0218-2130
dc.identifier.uri http://hdl.handle.net/10468/10349
dc.identifier.doi 10.1142/S0218213020600076 en
dc.description.abstract 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. en
dc.description.sponsorship Science Foundation Ireland (Grant No. 12/RC/2289 P2) en
dc.format.mimetype application/pdf en
dc.language.iso en en
dc.publisher World Scientific Publishing Company en
dc.rights © 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: https://doi.org/10.1142/S0218213020600076 en
dc.subject Maintenance scheduling en
dc.subject Service planning en
dc.subject Travelling repair person en
dc.title Assigning and scheduling service visits in a mixed urban/rural setting en
dc.type Article (peer-reviewed) en
dc.internal.authorcontactother Luis Quesada, Computer Science, University College Cork, Cork, Ireland. +353-21-490-3000 Email: l.quesada@4c.ucc.ie en
dc.internal.availability Full text available en
dc.check.info Access to this article is restricted until 12 months after publication by request of the publisher. en
dc.check.date 2021-06-18
dc.date.updated 2020-07-31T12:20:28Z
dc.description.version Accepted Version en
dc.internal.rssid 522472130
dc.contributor.funder United Technologies Corporation, United States en
dc.contributor.funder Science Foundation Ireland en
dc.contributor.funder European Regional Development Fund en
dc.description.status Peer reviewed en
dc.identifier.journaltitle International Journal on Artificial Intelligence Tools en
dc.internal.copyrightchecked Yes
dc.internal.licenseacceptance Yes en
dc.internal.IRISemailaddress luis.quesada@insight-centre.org en
dc.identifier.articleid 2060007 en
dc.identifier.eissn 1793-6349


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement