The reviewed record of science sign in
Pith

arxiv: 2109.13983 · v1 · pith:NGH62DSS · submitted 2021-09-28 · cs.LG

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

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:NGH62DSSrecord.jsonopen to challenge →

classification cs.LG
keywords computationalapproachescommunitylearningmachinepossibleproblemsproposed
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.