Guidelines for the Computational Testing of Machine Learning approaches to Vehicle Routing Problems

• URL: http://arxiv.org/abs/2109.13983v1
• Date: Tue, 28 Sep 2021 18:47:43 GMT
• Title: Guidelines for the Computational Testing of Machine Learning approaches to Vehicle Routing Problems
• Authors: Luca Accorsi, Andrea Lodi, Daniele Vigo
• Abstract summary: We highlight challenges arising during the computational studies of approaches to VRPs proposed by the Machine Learning community. We hope this will produce a computational study having the characteristics of those presented in OR papers.
• Score: 3.3946853660795884
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Despite the extensive research efforts and the remarkable results obtained on Vehicle Routing Problems (VRP) by using algorithms proposed by the Machine Learning community that are partially or entirely based on data-driven analysis, most of these approaches are still seldom employed by the Operations Research (OR) community. Among the possible causes, we believe, the different approach to the computational evaluation of the proposed methods may play a major role. With the current work, we want to highlight a number of challenges (and possible ways to handle them) arising during the computational studies of heuristic approaches to VRPs that, if appropriately addressed, may produce a computational study having the characteristics of those presented in OR papers, thus hopefully promoting the collaboration between the two communities.

Related papers

• RLIF: Interactive Imitation Learning as Reinforcement Learning [56.997263135104504]
  We show how off-policy reinforcement learning can enable improved performance under assumptions that are similar but potentially even more practical than those of interactive imitation learning. Our proposed method uses reinforcement learning with user intervention signals themselves as rewards. This relaxes the assumption that intervening experts in interactive imitation learning should be near-optimal and enables the algorithm to learn behaviors that improve over the potential suboptimal human expert.
  arXiv  Detail & Related papers  (2023-11-21T21:05:21Z)
• Flexible Job Shop Scheduling via Dual Attention Network Based Reinforcement Learning [73.19312285906891]
  In flexible job shop scheduling problem (FJSP), operations can be processed on multiple machines, leading to intricate relationships between operations and machines. Recent works have employed deep reinforcement learning (DRL) to learn priority dispatching rules (PDRs) for solving FJSP. This paper presents a novel end-to-end learning framework that weds the merits of self-attention models for deep feature extraction and DRL for scalable decision-making.
  arXiv  Detail & Related papers  (2023-05-09T01:35:48Z)
• Sample-Efficient, Exploration-Based Policy Optimisation for Routing Problems [2.6782615615913348]
  This paper presents a new reinforcement learning approach that is based on entropy. In addition, we design an off-policy-based reinforcement learning technique that maximises the expected return. We show that our model can generalise to various route problems.
  arXiv  Detail & Related papers  (2022-05-31T09:51:48Z)
• Learning to Solve Vehicle Routing Problems: A Survey [0.0]
  We present the taxonomy of the studies for learning paradigms, solution structures, underlying models, and algorithms. The paper outlines the future research directions to incorporate learning-based solutions to overcome the challenges of modern transportation systems.
  arXiv  Detail & Related papers  (2022-05-05T05:48:16Z)
• Deep Learning Methods for Abstract Visual Reasoning: A Survey on Raven's Progressive Matrices [0.0]
  We focus on the most common type of tasks -- the Raven's Progressive Matrices ( RPMs) -- and provide a review of the learning methods and deep neural models applied to solve RPMs. We conclude the paper by demonstrating how real-world problems can benefit from the discoveries of RPM studies.
  arXiv  Detail & Related papers  (2022-01-28T19:24:30Z)
• An Overview and Experimental Study of Learning-based Optimization Algorithms for Vehicle Routing Problem [49.04543375851723]
  Vehicle routing problem (VRP) is a typical discrete optimization problem. Many studies consider learning-based optimization algorithms to solve VRP. This paper reviews recent advances in this field and divides relevant approaches into end-to-end approaches and step-by-step approaches.
  arXiv  Detail & Related papers  (2021-07-15T02:13:03Z)
• Scaling up Search Engine Audits: Practical Insights for Algorithm Auditing [68.8204255655161]
  We set up experiments for eight search engines with hundreds of virtual agents placed in different regions. We demonstrate the successful performance of our research infrastructure across multiple data collections. We conclude that virtual agents are a promising venue for monitoring the performance of algorithms across long periods of time.
  arXiv  Detail & Related papers  (2021-06-10T15:49:58Z)
• A review of approaches to modeling applied vehicle routing problems [77.34726150561087]
  We review the approaches for modeling vehicle routing problems. We formulate several criteria for evaluating modeling methods. We discuss several future research avenues in the field of modeling VRP domains.
  arXiv  Detail & Related papers  (2021-05-23T14:50:14Z)
• Analytics and Machine Learning in Vehicle Routing Research [8.524039202121974]
  Vehicle Problem Routing (VRP) is one of the most intensively studied optimisation problems. To tackle the complexities, uncertainties and dynamics involved in real-world VRP applications, Machine Learning (ML) methods have been used. This paper presents a first, comprehensive review of hybrid methods that combine analytical techniques with ML tools in addressing VRP problems.
  arXiv  Detail & Related papers  (2021-02-19T16:26:17Z)
• A Survey on Large-scale Machine Learning [67.6997613600942]
  Machine learning can provide deep insights into data, allowing machines to make high-quality predictions. Most sophisticated machine learning approaches suffer from huge time costs when operating on large-scale data. Large-scale Machine Learning aims to learn patterns from big data with comparable performance efficiently.
  arXiv  Detail & Related papers  (2020-08-10T06:07:52Z)

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.