Learning State-Dependent Policy Parametrizations for Dynamic Technician Routing with Rework

• URL: http://arxiv.org/abs/2409.01815v1
• Date: Tue, 3 Sep 2024 11:56:58 GMT
• Title: Learning State-Dependent Policy Parametrizations for Dynamic Technician Routing with Rework
• Authors: Jonas Stein, Florentin D Hildebrandt, Barrett W Thomas, Marlin W Ulmer,
• Abstract summary: Home repair and installation services require technicians to visit customers and resolve tasks of different complexity. geographical spread of customers makes achieving perfect matches between technician skills and task requirements impractical. We propose a state-dependent balance of these factors via reinforcement learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Home repair and installation services require technicians to visit customers and resolve tasks of different complexity. Technicians often have heterogeneous skills and working experiences. The geographical spread of customers makes achieving only perfect matches between technician skills and task requirements impractical. Additionally, technicians are regularly absent due to sickness. With non-perfect assignments regarding task requirement and technician skill, some tasks may remain unresolved and require a revisit and rework. Companies seek to minimize customer inconvenience due to delay. We model the problem as a sequential decision process where, over a number of service days, customers request service while heterogeneously skilled technicians are routed to serve customers in the system. Each day, our policy iteratively builds tours by adding "important" customers. The importance bases on analytical considerations and is measured by respecting routing efficiency, urgency of service, and risk of rework in an integrated fashion. We propose a state-dependent balance of these factors via reinforcement learning. A comprehensive study shows that taking a few non-perfect assignments can be quite beneficial for the overall service quality. We further demonstrate the value provided by a state-dependent parametrization.

Related papers

• CRMArena: Understanding the Capacity of LLM Agents to Perform Professional CRM Tasks in Realistic Environments [90.29937153770835]
  We introduce CRMArena, a benchmark designed to evaluate AI agents on realistic tasks grounded in professional work environments. We show that state-of-the-art LLM agents succeed in less than 40% of the tasks with ReAct prompting, and less than 55% even with function-calling abilities. Our findings highlight the need for enhanced agent capabilities in function-calling and rule-following to be deployed in real-world work environments.
  arXiv  Detail & Related papers  (2024-11-04T17:30:51Z)
• WorkR: Occupation Inference for Intelligent Task Assistance [8.720927048233458]
  This study introduces WorkR, a framework that leverages passive sensing to capture pervasive signals from various task activities. We argue that signals from application usage, movements, social interactions, and the environment can inform a user's occupation. Our experiments with an anonymized, context-rich activity and task log dataset demonstrate that our models can accurately infer occupations with more than 91% accuracy.
  arXiv  Detail & Related papers  (2024-07-26T05:23:55Z)
• Learning Task Decomposition to Assist Humans in Competitive Programming [90.4846613669734]
  We introduce a novel objective for learning task decomposition, termed value (AssistV) We collect a dataset of human repair experiences on different decomposed solutions. Under 177 hours of human study, our method enables non-experts to solve 33.3% more problems, speeds them up by 3.3x, and empowers them to match unassisted experts.
  arXiv  Detail & Related papers  (2024-06-07T03:27:51Z)
• Contact Complexity in Customer Service [21.106010378612876]
  Customers who reach out for customer service support may face a range of issues that vary in complexity. To tackle this, a machine learning model that accurately predicts the complexity of customer issues is highly desirable. We have developed a novel machine learning approach to define contact complexity.
  arXiv  Detail & Related papers  (2024-02-24T00:09:27Z)
• Can Foundation Models Watch, Talk and Guide You Step by Step to Make a Cake? [62.59699229202307]
  Despite advances in AI, it remains a significant challenge to develop interactive task guidance systems. We created a new multimodal benchmark dataset, Watch, Talk and Guide (WTaG) based on natural interaction between a human user and a human instructor. We leveraged several foundation models to study to what extent these models can be quickly adapted to perceptually enabled task guidance.
  arXiv  Detail & Related papers  (2023-11-01T15:13:49Z)
• Onsite Job Scheduling by Adaptive Genetic Algorithm [0.0]
  Job Scheduling is a specialized variant of Vehicle Problem (VRP) with multiple depots. Job Scheduling is a specialized variant of Vehicle Problem (VRP) with multiple depots. We found an optimized travel route for a substantial number of jobs and technicians, minimizing travel distance overtime duration as well as meeting constraints related to SLA.
  arXiv  Detail & Related papers  (2023-06-04T08:13:33Z)
• Generalizing to New Tasks via One-Shot Compositional Subgoals [23.15624959305799]
  The ability to generalize to previously unseen tasks with little to no supervision is a key challenge in modern machine learning research. We introduce CASE which attempts to address these issues by training an Imitation Learning agent using adaptive "near future" subgoals. Our experiments show that the proposed approach consistently outperforms the previous state-of-the-art compositional Imitation Learning approach by 30%.
  arXiv  Detail & Related papers  (2022-05-16T14:30:11Z)
• Combining Modular Skills in Multitask Learning [149.8001096811708]
  A modular design encourages neural models to disentangle and recombine different facets of knowledge to generalise more systematically to new tasks. In this work, we assume each task is associated with a subset of latent discrete skills from a (potentially small) inventory. We find that the modular design of a network significantly increases sample efficiency in reinforcement learning and few-shot generalisation in supervised learning.
  arXiv  Detail & Related papers  (2022-02-28T16:07:19Z)
• Towards Collaborative Question Answering: A Preliminary Study [63.91687114660126]
  We propose CollabQA, a novel QA task in which several expert agents coordinated by a moderator work together to answer questions that cannot be answered with any single agent alone. We make a synthetic dataset of a large knowledge graph that can be distributed to experts. We show that the problem can be challenging without introducing prior to the collaboration structure, unless experts are perfect and uniform.
  arXiv  Detail & Related papers  (2022-01-24T14:27:00Z)
• Latent Skill Planning for Exploration and Transfer [49.25525932162891]
  In this paper, we investigate how these two approaches can be integrated into a single reinforcement learning agent. We leverage the idea of partial amortization for fast adaptation at test time. We demonstrate the benefits of our design decisions across a suite of challenging locomotion tasks.
  arXiv  Detail & Related papers  (2020-11-27T18:40:03Z)
• Finding teams that balance expert load and task coverage [7.831410227443101]
  In this paper we consider a problem where each task consists of required and optional skills. We show that the BalancedTA problem (and its variant) is NP-hard and design efficients for solving it in practice.
  arXiv  Detail & Related papers  (2020-11-03T18:04:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.