Search Results for author:
Found 4 papers, 0 papers with code
Introduction to The Dynamic Pickup and Delivery Problem Benchmark -- ICAPS 2021 Competition
The Dynamic Pickup and Delivery Problem (DPDP) is an essential problem within the logistics domain.
A Hierarchical Reinforcement Learning Based Optimization Framework for Large-scale Dynamic Pickup and Delivery Problems
To address this problem, existing methods partition the overall DPDP into fixed-size sub-problems by caching online generated orders and solve each sub-problem, or on this basis to utilize the predicted future orders to optimize each sub-problem further.
Learning to Optimize Industry-Scale Dynamic Pickup and Delivery Problems
Our method is entirely data driven and thus adaptive, i. e., the relational representation of adjacent vehicles can be learned and corrected by ST-DDGN from data periodically.
Bilevel Learning Model Towards Industrial Scheduling
In this paper, we propose a Bilevel Deep reinforcement learning Scheduler, \textit{BDS}, in which the higher level is responsible for exploring an initial global sequence, whereas the lower level is aiming at exploitation for partial sequence refinements, and the two levels are connected by a sliding-window sampling mechanism.
