Hai Wang

Hai Wang

Auto-generated profile, based on publicly available information

Hai Wang

National University of Defense Technology

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 August 2023
Verified
Conference Paper
Open access
LJLin Jiang
Lin Jiang
SWShuai Wang
Shuai Wang
BGBaoshen Guo
Baoshen Guo
HWHai Wang
Hai Wang
DZDesheng Zhang
Desheng Zhang
GWGuang Wang
Guang Wang
In recent years, we have been witnessing a rapid prevalence of instant delivery services (e,g., UberEats, Instacart, and Eleme) due to their convenience and timeliness. A unique characteristic of instant delivery services is the concurrent dispatch mode, where (i) one courier usually simultaneously delivers multiple orders, especially during rush hours, and (ii) couriers can receive new orders when delivering existing orders. Most existing concurrent dispatch systems are efficiency-oriented, which means they usually dispatch a group of orders that have a similar delivery route to a courier. Although this strategy may achieve high overall efficiency, it also potentially causes a huge disparity of earnings between different couriers. To address the problem, in this paper, we design a Fairness-aware Concurrent dispatch system called FairCod, which aims to optimize the overall operation efficiency and individual fairness at the same time. Specifically, in FairCod, we design a Dynamic Advantage Actor-Critic algorithm with Fairness constrain (DA2CF). The basic idea is that it includes an Actor network to make dispatch decisions based on dynamic action space and a Critic network to evaluate the dispatch decisions from the fairness perspective. More importantly, we extensively evaluate our FairCod system based on one-month real-world data consisting of 36.38 million orders from 42,000 couriers collected by one of the largest instant delivery companies in China. Experimental results show that our FairCod improves courier fairness by 30.3% without sacrificing the overall system benefit compared to state-of-the-art baselines.

21 October 2023
Verified
Conference Paper
Open access
ZHZhiqing Hong
Zhiqing Hong
HWHaotian Wang
Haotian Wang
WLWenjun Lyu
Wenjun Lyu
HWHai Wang
Hai Wang
YLYunhuai Liu
Yunhuai Liu
DZDesheng Zhang
Desheng Zhang

21 October 2023
Verified
Conference Paper
Open access
XZXiaohui Zhao
Xiaohui Zhao
SWShuai Wang
Shuai Wang
HWHai Wang
Hai Wang
THTian He
Tian He
DZDesheng Zhang
Desheng Zhang
GWGuang Wang
Guang Wang
Warehouse-distribution integration has been adopted by many e-commerce retailers (e.g., Amazon, TAOBAO, and JD) as an efficient business mode. In warehouse-distribution integration e-commerce, one of the most important problems is to estimate the full-link delivery time for better decision-making. Existing solutions for traditional warehouse-distribution separation mode are challenging to address this problem due to two unique features in the integration mode including (i) contextual influence caused by neighbor units in heterogeneous delivery networks, (ii) uncertain delivery time caused by the dynamic temporal data (e.g., online sales volume) and heterogeneity of delivery units. To incorporate these new factors, we propose Heterogeneous Spatial-Temporal Graph Transformer (HST-GT), a novel full-link delivery time estimation method under the warehouse-distribution integration mode, where we (i) develop heterogeneous graph transformers to capture hierarchical heterogeneous information; and (ii) design a set of spatial-temporal transformers based on heterogeneous features to fully exploit the correlation of spatial and temporal information. We extensively evaluate our method based on one-month real-world data consisting of hundreds of warehouses and sorting centers, and millions of historical orders collected from one of the largest e-commerce retailers in the world. Experimental results demonstrate that our method outperforms state-of-the-art baselines in various metrics.

13 May 2024
Verified
Conference Paper
Open access
ZZZhiyuan Zhou
Zhiyuan Zhou
LLLi Lin
Li Lin
HWHai Wang
Hai Wang
XZXiaolei Zhou
Xiaolei Zhou
wei gongwei gong
wei gong
SWShuai Wang
Shuai Wang
Accurate customer LifeTime Value (LTV) predictions are crucial for customer relationship management, especially in Supply Chain Platforms (SCP), which involve effectively managing the service resources in business decision-making. Previous LTV prediction methods usually rely on ample historical customer data, which is not available in the early stages of a customer's lifecycle. It makes the modeling of the historical customer data a difficult task due to the data sparsity. Besides, the long-tail distribution of customer LTV also brings new challenges to the prediction of LTV. To tackle the above issues, we propose CDLtvS, a novel Cross Domain method for customer Lifetime value prediction in SCP. It leverages rich cross-domain information from upstream platforms to enhance LTV predictions in downstream platforms. Firstly, CDLtvS pre-trains the customer representations by an LTV modeling framework named LtvS in source and target domains separately. Specifically, LtvS incorporates the Expert Mask Network (ExMN), which not only effectively models the long-tail distribution of LTV in single-domain but also resolves cross-domain learning model bias resulting from this distribution. Then, the various-level alignment mechanism is introduced to keep the consistency of knowledge transferring from source to target domains on both sparse and non-sparse data. Comprehensive experiments on real-world data from JD, one of the world's largest supply chain platforms, demonstrate that CDLtvS achieves a normalized mean average error of 0.3378 in LTV prediction, outperforming 16.3% to the baseline. Additionally, the improvements of ≥2.3% across various data sparsity levels (0% -- 80%) provide valuable insights into cross-domain LTV modeling.

28 November 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HWHai Wang
Hai Wang
XZXiaolei Zhou
Xiaolei Zhou
SWShuai Wang
Shuai Wang
XZXiaohui Zhao
Xiaohui Zhao
Xianjun DengXianjun Deng
Xianjun Deng
wei gongwei gong
wei gong
Motivated by the pursuit of greater efficiency, companies, such as Amazon and JD, are shifting toward a warehouse-distribution integration model to optimize logistics operations. In general full-link logistics scenarios, the collaboration between warehouses and sorting centers managed by different enterprises leads to data silos, posing challenges in securely sharing information and accurately predicting delivery times across the entire logistics network. Current delivery time prediction methods often overlook the heterogeneity of logistics networks and face data sharing constraints. We aim to address these issues by facilitating secure internode relationship analysis and leveraging distinct spatio-temporal characteristics to enhance efficiency. However, challenges remain in overcoming data isolation while maintaining protection and integrating diverse node characteristics for optimized modeling. To address these challenges, we propose the federated heterogeneous graph transformer (Fed-HGT) framework. This framework includes a federated training module that integrates local and central gradients by exchanging node representations and model parameters between logistics nodes and the central server. Additionally, it features a federated prediction module where local nodes compute time representations using their local data and transmit these to the central server. The central server then uses these representations to make accurate full-link delivery time predictions. Our method was evaluated on a dataset from a major e-commerce platform in China, demonstrating significant performance improvements over existing solutions.

21 October 2024
Verified
Conference Paper
Open access
HWHai Wang
Hai Wang
SWShuai Wang
Shuai Wang
LLLi Lin
Li Lin
YYYu Yang
Yu Yang
HWHongkai Wen
Hongkai Wen
Trajectory data is a valuable asset for service management and spatio-temporal mining in transportation and logistics systems. However, due to equipment failure, network delay, and energy constraints, some trajectory point may be missed, which makes it difficult for trajectory-based management. Some researchers have focused on recovering sparse trajectories from road networks and historical trajectory data, but these methods are ineffective when the road network is incomplete. Recent research works have explored learning-based methods to recover trajectories in free space but lack user movement behavior modeling and efficient feature extraction on sparse long-range trajectories. Our work exploits the periodic behavior of couriers and fine-grained Area of Interest (AOI) data for sparse trajectory recovery in last-mile delivery. However, we face challenges with AOI access sequence deviations due to GPS inaccuracies and abnormal courier behaviors, as well as the complex, dynamic relationships within and between courier routes due to uncertain pick-up demands. To address these challenges, we design a graph-based multi-task learning framework, focusing on multi-scale attention fusion for end-to-end free space trajectory recovery. Our approach starts with a behavior-aware graph network that generates detailed spatial features. Following this, we propose a multi-scale attention fusion mechanism to extract intra- and inter-trajectory features. Finally, we design a multi-task learning module that predicts both coarse-grained spatial access sequences and fine-grained trajectory points. We evaluate the model with six-month data involved with more than 360,000 trajectory segments and more than 7.2 million waybills collected from one of the largest logistic companies in China. Extensive experiments on real-world datasets demonstrate that our method outperforms state-of-the-arts in multiple metrics.