Atari-fying the Vehicle Routing Problem with Stochastic Service Requests

11/14/2019
by   Nicholas D. Kullman, et al.
0

We present a new general approach to modeling research problems as Atari-like videogames to make them amenable to recent groundbreaking solution methods from the deep reinforcement learning community. The approach is flexible, applicable to a wide range of problems. We demonstrate its application on a well known vehicle routing problem. Our preliminary results on this problem, though not transformative, show signs of success and suggest that Atari-fication may be a useful modeling approach for researchers studying problems involving sequential decision making under uncertainty.

READ FULL TEXT
research
05/18/2016

The Bees Algorithm for the Vehicle Routing Problem

In this thesis we present a new algorithm for the Vehicle Routing Proble...
research
02/28/2021

Where the Action is: Let's make Reinforcement Learning for Stochastic Dynamic Vehicle Routing Problems work!

There has been a paradigm-shift in urban logistic services in the last y...
research
04/25/2021

RP-DQN: An application of Q-Learning to Vehicle Routing Problems

In this paper we present a new approach to tackle complex routing proble...
research
03/02/2020

UFTR: A Unified Framework for Ticket Routing

Corporations today face increasing demands for the timely and effective ...
research
03/05/2021

Routing algorithms as tools for integrating social distancing with emergency evacuation

We explore the implications of integrating social distancing with emerge...
research
06/16/2019

A concise guide to existing and emerging vehicle routing problem variants

Vehicle routing problems have been the focus of extensive research over ...
research
09/28/2021

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

Despite the extensive research efforts and the remarkable results obtain...

Please sign up or login with your details

Forgot password? Click here to reset