skip to main content
10.1145/3653081.3653103acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiotaaiConference Proceedingsconference-collections
research-article

Deep Reinforcement Learning for Solving Multi-period Routing Problem with Binary Driver-customer Familiarity

Published:03 May 2024Publication History

ABSTRACT

This paper proposes a deep reinforcement learning (DRL)-based framework for a novel variant of technician routing and scheduling problem. First, we model the problem as a Markov decision process (MDP). Then, we build the policy network with attention-based Graph Neural Network (GNN), autoregressive decoding, and sampling graph search technique. Finally, reinforcement learning (RL) is adopted in policy learning to overcome the difficulty of creating labelled datasets. Extensive computational results validate the efficacy of the framework and managerial insights are revealed for decision makers in real world practice.

References

  1. Amy Khalfay, Crispin Alan, and Crockett Keeley. 2017. A review of technician and task scheduling problems, datasets and solution approaches. 2017 intelligent systems conference (IntelliSys). IEEE, London, 288-296. https://doi.org/10.1109/IntelliSys.2017.8324306.Google ScholarGoogle ScholarCross RefCross Ref
  2. Matias S. Rasmussen, Tor Justesen, Anders Dohn, and Jesper Larsen. 2012. The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European journal of operational research, Vol 219, 598-610. https://doi.org/10.1016/j.ejor.2011.10.048.Google ScholarGoogle ScholarCross RefCross Ref
  3. Victor Pillac, Guéret Christelle, and Andrés Medaglia. 2012. On the dynamic technician routing and scheduling problem. Proceedings of the Extended Abstracts of the 5th International Workshop on Freight Transportation and Logistics ODYSSEUS 2012. Mykonos, Greece, 509-512.Google ScholarGoogle Scholar
  4. Emilio Zamorano, and Raik Stolletz. 2017. Branch-and-price approaches for the multiperiod technician routing and scheduling problem. European Journal of Operational Research, Vol 257.1, 55-68. https://doi.org/10.1016/j.ejor.2016.06.058.Google ScholarGoogle ScholarCross RefCross Ref
  5. Yuchen Jiang, Xiang Li, Hao Luo, Shen Yin and Okyay Kaynak. 2022. Quo vadis artificial intelligence? Discover Artificial Intelligence, 2.1, 4. https://doi.org/10.1007/s44163-022-00022-8.Google ScholarGoogle ScholarCross RefCross Ref
  6. Mohammadreza Nazari, Afshin Oroojlooy, Lawrence V. Snyder, and Martin Takáč. 2018. Reinforcement learning for solving the vehicle routing problem. Advances in neural information processing systems, 9839–9849. https://doi.org/10.48550/arXiv.1802.04240.Google ScholarGoogle ScholarCross RefCross Ref
  7. Wouter Kool, Herke van Hoof, and Max Welling. 2019. Attention, Learn to Solve Routing Problems! International Conference on Learning Representations. https://doi.org/10.48550/arXiv.1803.08475.Google ScholarGoogle ScholarCross RefCross Ref
  8. Jingwen Li, Liang Xin, Zhiguang Cao, Andrew Lim, Wen Song, and Jie Zhang. 2021. Heterogeneous attentions for solving pickup and delivery problem via deep reinforcement learning. IEEE Transactions on Intelligent Transportation Systems, Vol 23.3, 2306-2315. https://doi.org/10.48550/arXiv.2110.02634Google ScholarGoogle ScholarCross RefCross Ref
  9. Liang Xin, Wen Song, Zhiguang Cao, and Jie Zhang. 2021. Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problems. Proceedings of the AAAI Conference on Artificial Intelligence, Vol 35, 12042-12049. https://doi.org/10.48550/arXiv.2012.10638.Google ScholarGoogle ScholarCross RefCross Ref
  10. Xi Chen, Barrett W. Thomas, and Mike Hewitt. 2016. The technician routing problem with experience-based service times. Omega, Vol 61, 49-61. https://doi.org/10.1016/j.omega.2015.07.006.Google ScholarGoogle ScholarCross RefCross Ref
  11. Marlin Ulmer, Maciek Nowak, Dirk Mattfeld, and Bogumił Kaminski. 2020. Binary driver-customer familiarity in service routing. European Journal of Operational Research, Vol 286, 477-493. https://doi.org/10.1016/j.ejor.2020.03.037.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Deep Reinforcement Learning for Solving Multi-period Routing Problem with Binary Driver-customer Familiarity

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      IoTAAI '23: Proceedings of the 2023 5th International Conference on Internet of Things, Automation and Artificial Intelligence
      November 2023
      902 pages
      ISBN:9798400716485
      DOI:10.1145/3653081

      Copyright © 2023 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 May 2024

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format