The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Reinforcement Learning for Combinatorial Optimization
Abstract
Combinatorial optimization (CO) problems have many important application domains, including social networks, manufacturing, and transportation. However, as an NP-hard problem, the traditional CO problem-solvers require domain knowledge and hand-crafted heuristics. Facing big data challenges, can we solve these challenging problems with a learning structure within a short time? This article will demonstrate how to solve the combinatorial optimization problems with the deep reinforcement learning (DRL) method. Reinforcement learning (RL) is a subfield of machine learning (ML) that learns the optimal policy over time. Building on Markov decision process, RL has the solid theoretical foundation to obtain the optimal solution. Once parameters of DRL are trained, a new problem case can be solved quickly. Moreover, DRL learns the optimal solution without labels by maximizing the accumulative discounted reward received from the environment. This article will discuss three typical CO problems and present the advantages of DRL over other traditional methods.
Related Content
Princy Pappachan, Sreerakuvandana, Mosiur Rahaman.
© 2024.
26 pages.
|
Winfred Yaokumah, Charity Y. M. Baidoo, Ebenezer Owusu.
© 2024.
23 pages.
|
Mario Casillo, Francesco Colace, Brij B. Gupta, Francesco Marongiu, Domenico Santaniello.
© 2024.
25 pages.
|
Suchismita Satapathy.
© 2024.
19 pages.
|
Xinyi Gao, Minh Nguyen, Wei Qi Yan.
© 2024.
13 pages.
|
Mario Casillo, Francesco Colace, Brij B. Gupta, Angelo Lorusso, Domenico Santaniello, Carmine Valentino.
© 2024.
30 pages.
|
Pratyay Das, Amit Kumar Shankar, Ahona Ghosh, Sriparna Saha.
© 2024.
32 pages.
|
|
|