102 citations · 179 across the 18 of their papers we have counts for
9 papers · 1 filter
DRL4Route: A Deep Reinforcement Learning Framework for Pick-up and Delivery Route Prediction
Xiaowei Mao, Haomin Wen, Hengrui Zhang +5
Pick-up and Delivery Route Prediction (PDRP), which aims to estimate the future service route of a worker given his current task pool, has received rising attention in recent years…
Communication-Efficient Decentralized Online Continuous DR-Submodular Maximization
Qixin Zhang, Zengde Deng, Xiangru Jian +3
Maximizing a monotone submodular function is a fundamental task in machine learning, economics, and statistics. In this paper, we present two communication-efficient decentralized…
Online Learning for Non-monotone Submodular Maximization: From Full Information to Bandit Feedback
Qixin Zhang, Zengde Deng, Zaiyi Chen +3
In this paper, we revisit the online non-monotone continuous DR-submodular maximization problem over a down-closed convex set, which finds wide real-world applications in the domai…
An end-to-end predict-then-optimize clustering method for intelligent assignment problems in express systems
Jinlei Zhang, Ergang Shan, Lixia Wu +3
Express systems play important roles in modern major cities. Couriers serving for the express system pick up packages in certain areas of interest (AOI) during a specific time. How…
Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function
Qixin Zhang, Zengde Deng, Zaiyi Chen +2
In this paper, we revisit Stochastic Continuous Submodular Maximization in both offline and online settings, which can benefit wide applications in machine learning and operations…
Online Allocation Problem with Two-sided Resource Constraints
Qixin Zhang, Wenbing Ye, Zaiyi Chen +3
In this paper, we investigate the online allocation problem of maximizing the overall revenue subject to both lower and upper bound constraints. Compared to the extensively studied…
A Deep Reinforcement Learning Approach for Online Parcel Assignment
Hao Zeng, Qiong Wu, Kunpeng Han +2
In this paper, we investigate the online parcel assignment (OPA) problem, in which each stochastically generated parcel needs to be assigned to a candidate route for delivery to mi…
Balanced Order Batching with Task-Oriented Graph Clustering
Lu Duan, Haoyuan Hu, Zili Wu +4
Balanced order batching problem (BOBP) arises from the process of warehouse picking in Cainiao, the largest logistics platform in China. Batching orders together in the picking pro…
A Multi-task Selected Learning Approach for Solving 3D Flexible Bin Packing Problem
Lu Duan, Haoyuan Hu, Yu Qian +4
A 3D flexible bin packing problem (3D-FBPP) arises from the process of warehouse packing in e-commerce. An online customer's order usually contains several items and needs to be pa…