1 code implementation • 6 Dec 2024 • Youfang Lin, Jinji Fu, Haomin Wen, Jiyuan Wang, Zhenjie Wei, Yuting Qiang, Xiaowei Mao, Lixia Wu, Haoyuan Hu, Yuxuan Liang, Huaiyu Wan
We also present a representative implementation of DRL4AOI - TrajRL4AOI - for AOI segmentation in the logistics service.
1 code implementation • 18 Jun 2024 • Hao Zeng, Jiaqi Wang, Avirup Das, Junying He, Kunpeng Han, Haoyuan Hu, Mingfei Sun
We empirically evaluate our framework on four typical datasets of IP problems, and show that it effectively generates complete feasible solutions with a high probability (> 89. 7 \%) without the reliance of Solvers and the quality of solutions is comparable to the best heuristic solutions from Gurobi.
1 code implementation • 19 Mar 2024 • Yuan Gao, Yiheng Zhu, Yuanbin Cao, Yinzhi Zhou, Zhen Wu, Yujie Chen, Shenglan Wu, Haoyuan Hu, Xinyu Dai
To alleviate this issue, we propose the Discriminate->Re-Compose->Re- Solve->Re-Decompose (Dr3) mechanism.
no code implementations • 24 Oct 2023 • Minfang Lu, Yuchen Jiang, Huihui Dong, Qi Li, Ziru Xu, Yuanlin Liu, Lixia Wu, Haoyuan Hu, Han Zhu, Yuning Jiang, Jian Xu, Bo Zheng
The robust representation learning employs domain adversarial learning and multi-view wasserstein distribution learning to learn robust representations.
1 code implementation • 30 Jul 2023 • Xiaowei Mao, Haomin Wen, Hengrui Zhang, Huaiyu Wan, Lixia Wu, Jianbin Zheng, Haoyuan Hu, Youfang Lin
Deep neural networks based on supervised learning have emerged as the dominant model for the task because of their powerful ability to capture workers' behavior patterns from massive historical data.
no code implementations • 19 Jun 2023 • Lixia Wu, Haomin Wen, Haoyuan Hu, Xiaowei Mao, Yutong Xia, Ergang Shan, Jianbin Zheng, Junhong Lou, Yuxuan Liang, Liuqing Yang, Roger Zimmermann, Youfang Lin, Huaiyu Wan
In this paper, we introduce \texttt{LaDe}, the first publicly available last-mile delivery dataset with millions of packages from the industry.
no code implementations • 4 Apr 2023 • Lixia Wu, Jianlin Liu, Junhong Lou, Haoyuan Hu, Jianbin Zheng, Haomin Wen, Chao Song, Shu He
How to effectively encode the delivery address is a core task to boost the performance of downstream tasks in the logistics system.
no code implementations • 6 Mar 2023 • Yuwei Chen, Zengde Deng, Yinzhi Zhou, Zaiyi Chen, Yujie Chen, Haoyuan Hu
This paper studies the online stochastic resource allocation problem (RAP) with chance constraints.
no code implementations • 22 Nov 2022 • Jinyun Li, Huiwen Zheng, Yuanlin Liu, Minfang Lu, Lixia Wu, Haoyuan Hu
Large-scale commercial platforms usually involve numerous business domains for diverse business strategies and expect their recommendation systems to provide click-through rate (CTR) predictions for multiple domains simultaneously.
no code implementations • 18 Aug 2022 • Qixin Zhang, Zengde Deng, Xiangru Jian, Zaiyi Chen, Haoyuan Hu, Yu Yang
Maximizing a monotone submodular function is a fundamental task in machine learning, economics, and statistics.
no code implementations • 16 Aug 2022 • Qixin Zhang, Zengde Deng, Zaiyi Chen, Kuangqi Zhou, Haoyuan Hu, Yu Yang
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 domain of machine learning, economics, and operations research.
no code implementations • 18 Feb 2022 • Jinlei Zhang, Ergang Shan, Lixia Wu, Lixing Yang, Ziyou Gao, Haoyuan Hu
To solve these problems, we put forward an intelligent end-to-end predict-then-optimize clustering method to simultaneously predict the future pick-up requests of AOIs and assign AOIs to couriers by clustering.
no code implementations • 3 Jan 2022 • Qixin Zhang, Zengde Deng, Zaiyi Chen, Haoyuan Hu, Yu Yang
In the online setting, for the first time we consider the adversarial delays for stochastic gradient feedback, under which we propose a boosting online gradient algorithm with the same non-oblivious function $F$.
no code implementations • 28 Dec 2021 • Qixin Zhang, Wenbing Ye, Zaiyi Chen, Haoyuan Hu, Enhong Chen, Yang Yu
As a result, only limited violations of constraints or pessimistic competitive bounds could be guaranteed.
no code implementations • 8 Sep 2021 • Hao Zeng, Qiong Wu, Kunpeng Han, Junying He, Haoyuan Hu
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 minimize the total cost subject to certain business constraints.
no code implementations • 19 Aug 2020 • Lu Duan, Haoyuan Hu, Zili Wu, Guozheng Li, Xinhang Zhang, Yu Gong, Yinghui Xu
In this paper, rather than designing heuristics, we propose an end-to-end learning and optimization framework named Balanced Task-orientated Graph Clustering Network (BTOGCN) to solve the BOBP by reducing it to balanced graph clustering optimization problem.
no code implementations • 7 Mar 2019 • Yujie Chen, Yu Qian, Yichen Yao, Zili Wu, Rongqi Li, Yinzhi Zhou, Haoyuan Hu, Yinghui Xu
In this paper, we study a courier dispatching problem (CDP) raised from an online pickup-service platform of Alibaba.
no code implementations • 17 Apr 2018 • Lu Duan, Haoyuan Hu, Yu Qian, Yu Gong, Xiaodong Zhang, Yinghui Xu, Jiangwen Wei
A 3D flexible bin packing problem (3D-FBPP) arises from the process of warehouse packing in e-commerce.
no code implementations • 20 Aug 2017 • Haoyuan Hu, Xiaodong Zhang, Xiaowei Yan, Longfei Wang, Yinghui Xu
The objective is to find a way to place these items that can minimize the surface area of the bin.