Solving hard bi-objective knapsack problems using deep reinforcement learning

DOI10.1016/J.DISOPT.2025.100879MaRDI QIDQ6962500zbMATH OpenFDO

Authors Hadi Charkhgard, Hanieh Rastegar Moghaddam, Ali Eshragh, Sasan Mahmoudinazlou, Kimia Keshanian

Publication date 8 July 2025

Published in Discrete Optimization (Search for Journal in Brave)

zbMATH Keywords

\(Q\)-learningmulti-objective optimizationbi-objective knapsack problemdeep reinforcement learning

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Multi-objective and goal programming (90C29) Integer programming (90C10) Markov and semi-Markov decision processes (90C40)

Cites work

• A hybrid approach for biobjective optimization
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• An exact algorithm for biobjective mixed integer linear programming problems
• An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs
• Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• Bicriteria Transportation Problem
• Deep policy dynamic programming for vehicle routing problems
• Discrete-variable extremum problems
• Efficient and sparse neural networks by pruning weights in a multiobjective learning approach
• Efficient computation of the search region in multi-objective optimization
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• Finding all nondominated points of multi-objective integer programs
• Machine learning for combinatorial optimization: a methodological tour d'horizon
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Multi-directional local search
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• Multicriteria Optimization
• On the analytical derivation of quantum Fisher information and skew information for two qubit \(X\) states
• Reinforcement learning. An introduction
• Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
• The \(L\)-shape search method for triobjective integer programming
• Where are the hard knapsack problems?

Cited in

(1)

• Deep reinforcement learning for dynamic order picking in warehouse operations

This page was built for publication: Solving hard bi-objective knapsack problems using deep reinforcement learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6962500)