Gamifying the Vehicle Routing Problem with Stochastic Requests

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Kullman, Nicholas D., Dudorov, Nikita, Mendoza, Jorge E., Cousineau, Martin, Goodson, Justin C.
Format: Preprint
Published: 2019
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914955352080384
author Kullman, Nicholas D.
Dudorov, Nikita
Mendoza, Jorge E.
Cousineau, Martin
Goodson, Justin C.
author_facet Kullman, Nicholas D.
Dudorov, Nikita
Mendoza, Jorge E.
Cousineau, Martin
Goodson, Justin C.
contents Do you remember your first video game console? We remember ours. Decades ago, they provided hours of entertainment. Now, we have repurposed them to solve dynamic and stochastic optimization problems. With deep reinforcement learning methods posting superhuman performance on a wide range of Atari games, we consider the task of representing a classic logistics problem as a game. Then, we train agents to play it. We consider several game designs for the vehicle routing problem with stochastic requests. We show how various design features impact agents' performance, including perspective, field of view, and minimaps. With the right game design, general purpose Atari agents outperform optimization-based benchmarks, especially as problem size grows. Our work points to the representation of dynamic and stochastic optimization problems via games as a promising research direction.
format Preprint
id arxiv_https___arxiv_org_abs_1911_05922
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle Gamifying the Vehicle Routing Problem with Stochastic Requests
Kullman, Nicholas D.
Dudorov, Nikita
Mendoza, Jorge E.
Cousineau, Martin
Goodson, Justin C.
Machine Learning
Optimization and Control
Do you remember your first video game console? We remember ours. Decades ago, they provided hours of entertainment. Now, we have repurposed them to solve dynamic and stochastic optimization problems. With deep reinforcement learning methods posting superhuman performance on a wide range of Atari games, we consider the task of representing a classic logistics problem as a game. Then, we train agents to play it. We consider several game designs for the vehicle routing problem with stochastic requests. We show how various design features impact agents' performance, including perspective, field of view, and minimaps. With the right game design, general purpose Atari agents outperform optimization-based benchmarks, especially as problem size grows. Our work points to the representation of dynamic and stochastic optimization problems via games as a promising research direction.
title Gamifying the Vehicle Routing Problem with Stochastic Requests
topic Machine Learning
Optimization and Control
url https://arxiv.org/abs/1911.05922