A Survey on Reinforcement Learning for Combinatorial Optimization

08/17/2020
by   Andrew Whinston, et al.
0

This paper gives a detailed review of reinforcement learning in combinatorial optimization, introduces the history of combinatorial optimization starting in the 1960s, and compares with the reinforcement learning algorithms in recent years. We explicitly look at a famous combinatorial problem known as the Traveling Salesman Problem. We compare the approach of the modern reinforcement learning algorithms on Traveling Salesman Problem with the approach published in the 1970s. Then, we discuss the similarities between these algorithms and how the approach of reinforcement learning changes due to the evolution of machine learning techniques and computing power.

READ FULL TEXT
research
03/07/2020

Reinforcement Learning for Combinatorial Optimization: A Survey

Combinatorial optimization (CO) is the workhorse of numerous important a...
research
11/07/2020

A Reinforcement Learning Approach to the Orienteering Problem with Time Windows

The Orienteering Problem with Time Windows (OPTW) is a combinatorial opt...
research
12/08/2020

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem

We address the Traveling Salesman Problem (TSP), a famous NP-hard combin...
research
07/07/2022

Learning the Quality of Machine Permutations in Job Shop Scheduling

In recent years, the power demonstrated by Machine Learning (ML) has inc...
research
03/01/2012

Statistical Approach for Selecting Elite Ants

Applications of ACO algorithms to obtain better solutions for combinator...
research
11/09/2020

Geometric Deep Reinforcement Learning for Dynamic DAG Scheduling

In practice, it is quite common to face combinatorial optimization probl...
research
05/18/2018

Solving the Rubik's Cube Without Human Knowledge

A generally intelligent agent must be able to teach itself how to solve ...

Please sign up or login with your details

Forgot password? Click here to reset