Deep Reinforcement Learning for Multi-Sequence Combinatorial Optimization Problems

We propose a formulation for solving sequential combinatorial optimization problems (COP) by deep reinforcement learning (DRL) method. Some types of decision problems can be reduced to sequence combination optimization problems(SCOP) , such as knapsack problems, flow-shop problems, etc. Besides some

Authors

Publication Details

Published
2025-01-01
DOI
https://doi.org/10.4108/eai.21-11-2024.2354636
Primary Topic
Metaheuristic Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Deep Reinforcement Learning for Multi-Sequence Combinatorial Optimization Problems

Xue Zhang, Dai Zhang
1 links
Metaheuristic Optimization Algorithms Research
article

Deep Reinforcement Learning for Multi-Sequence Combinatorial Optimization Problems

Xue Zhang, Dai Zhang
article en

Abstract

We propose a formulation for solving sequential combinatorial optimization problems (COP) by deep reinforcement learning (DRL) method. Some types of decision problems can be reduced to sequence combination optimization problems(SCOP) , such as knapsack problems, flow-shop problems, etc. Besides some

Openalex Percentile: Top 98%
Metaheuristic Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Deep Reinforcement Learning for Multi-Sequence Combinatorial Optimization Problems — Xue Zhang, Dai Zhang · (2025) | TGRS Research Map | TGRS