all AI news
Reinforcement Learning to Solve NP-hard Problems: an Application to the CVRP. (arXiv:2201.05393v1 [cs.AI])
Jan. 17, 2022, 2:10 a.m. | Leo Ardon
cs.LG updates on arXiv.org arxiv.org
In this paper, we evaluate the use of Reinforcement Learning (RL) to solve a
classic combinatorial optimization problem: the Capacitated Vehicle Routing
Problem (CVRP). We formalize this problem in the RL framework and compare two
of the most promising RL approaches with traditional solving techniques on a
set of benchmark instances. We measure the different approaches with the
quality of the solution returned and the time required to return it. We found
that despite not returning the best solution, the …
More from arxiv.org / cs.LG updates on arXiv.org
A Single-Loop Algorithm for Decentralized Bilevel Optimization
1 day, 3 hours ago |
arxiv.org
CLEANing Cygnus A deep and fast with R2D2
1 day, 3 hours ago |
arxiv.org
Jobs in AI, ML, Big Data
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Stagista Technical Data Engineer
@ Hager Group | BRESCIA, IT
Data Analytics - SAS, SQL - Associate
@ JPMorgan Chase & Co. | Mumbai, Maharashtra, India