A State Aggregation Approach for Solving Knapsack Problem with Deep Reinforcement Learning

Abstract

This paper proposes a Deep Reinforcement Learning (DRL) approach for solving knapsack problem. The proposed method consists of a state aggregation step based on tabular reinforcement learning to extract features and construct states. The state aggregation policy is applied to each problem instance of the knapsack problem, which is used with Advantage Actor Critic (A2C) algorithm to train a policy through which the items are sequentially selected at each time step. The method is a constructive solution approach and the process of selecting items is repeated until the final solution is obtained. The experiments show that our approach provides close to optimal solutions for all tested instances, outperforms the greedy algorithm, and is able to handle larger instances and more flexible than an existing DRL approach. In addition, the results demonstrate that the proposed model with the state aggregation strategy not only gives better solutions but also learns in less timesteps, than the one without state aggregation.

References in corpus (9)

• Sequence to Sequence Learning with Neural Networks
• Playing Atari with Deep Reinforcement Learning
• Learning Combinatorial Optimization Algorithms over Graphs
• Discriminative Embeddings of Latent Variable Models for Structured Data
• Neural Combinatorial Optimization with Reinforcement Learning
• Sample Efficient Actor-Critic with Experience Replay
• An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem
• The P versus NP Problem
• Phase transition in the knapsack problem

Cited by in corpus (2)

• Solving the Order Batching and Sequencing Problem using Deep Reinforcement Learning
• Graph Partitioning and Sparse Matrix Ordering using Reinforcement Learning and Graph Neural Networks