KXKaiwen Xia

Kaiwen Xia

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kaiwen Xia has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    CSSG: A Continuous Spatio-temporal Graph Learning Framework with Scalable Spatial Granularity

    by Kaiwen Xia, Li Lin, Qi Zhang, Xinrui Zhang, Shuai Wang, Xuming Hu, Philip S. Yu

    Spatio-temporal data is extensively collected in ubiquitous cyber-physical systems, where modeling complex spatio-temporal dependencies using Spatio-Temporal Graph (STG) is crucial for downstream decision-making tasks. However, these tasks often necessitate that STG methods adapt to the coupling between varying spatial granularity and continuous temporal evolution, leading to certain limitations in the scalability and dynamic continuous-time modeling capabilities of existing methods. To this end, we propose a C ontinuous spatio-temporal graph learning framework with S calable S patial G ranularity (CSSG). This framework establishes the coupling between scalable spatial granularity and continuous temporal evolution through anchor set-based spatial modeling and local conservation-based temporal modeling. Specifically, CSSG first derives the initial node spatio-temporal embeddings using a spatio-temporal encoding module that takes scalable spatial embeddings based on anchor sets as input. Then, a bidirectional differential edge aggregation module dynamically updates the continuous interaction weights of edges based on local conservation. Finally, a spatio-temporal adaptive fusion module integrates continuous change patterns of bidirectional edges into a unified node representation, generating initial node states for the decoder to infer future states. Extensive experiments on various real-world datasets verify the scalability and effectiveness of CSSG in continuous spatio-temporal prediction for varying spatial granularities, while also demonstrating greater efficiency compared to state-of-the-art solutions with comparable performance. The source code, data have been made available at https://github.com/kaiwxai/CSSG.

  • H²DGL: Adaptive Metapath-Based Dynamic Graph Learning for Supply Forecasting in Logistics System

    by Kaiwen Xia, Li Lin, Shuai Wang, Anqi Zheng, Zhao-Dong Xu, Desheng Zhang, Tian He

    The advanced logistics systems are increasingly transitioning towards integrated warehousing and distribution supply networks (IWDSN), where accurately forecasting supply capacity is essential for maintaining delivery capabilities that meet user demands. However, existing research often overlooks the impact of dynamic changes in network topology, resulting in limitations in capturing dynamic routing and diverse node responses. These limitations become particularly pronounced in the context of external events such as pandemics, heavy rain, and promotions. To address the above limitations, we propose H2DGL, a Hierarchical Heterogeneous Dynamic Graph Learning framework based on adaptive metapath aggregation, for forecasting supply capabilities in logistics systems. Specifically, H2DGL comprises three main modules: (1) Hierarchical Heterogeneous Node Representation, where the micro graph captures dynamic routing information through adaptive meta-path aggregation from routing and event view graphs, and the macro graph extracts spatial representations using bipartite graph learning. (2) The Dynamic Graph Encoding module integrates macro and micro features from different snapshots to derive unified node representations. (3) The Spatio-temporal Joint Forecasting combines spatial features with temporal features from a time-series encoder to predict future supply capacity. Extensive experiments on two real-world datasets from different cities demonstrate that H2DGL achieves state-of-the-art performance compared to advanced baseline models. The code is available at https://github.com/kaiwxai/H2DGL


  • Open Access

    Hierarchical Spatio-Temporal Graph Learning Based on Metapath Aggregation for Emergency Supply Forecasting

    by Li Lin, Kaiwen Xia, Anqi Zheng, Shijie Hu, Shuai Wang

    Integrated Warehousing and Distribution Supply Networks (IWDSN) have shown their high efficiency in E-commerce. Efficient supply capacity prediction is crucial for logistics systems to maintain the delivery capacity to meet users' requirements. However, unforeseen events such as extreme weather and public health emergencies pose challenges in supply forecasting. Previous work mainly infers supply optimization based on the invariant topology of logistic networks, neglecting dynamic routing and distinct node effects reacting to emergencies. To address these challenges, the hierarchical relations among warehouses, sorting centers, and delivery stations in logistic networks are necessary to learn the diverse reactions. In this paper, we propose a hierarchical spatio-temporal graph learning model to predict the emergency supply capacity of IWDSN based on micro and macro graphs. The micro graph shows transportation connectivity while the macro graph shows the geographical correlation. Specifically, it consists of three components. (1) For micro graphs, a metapath aggregation strategy is designed to capture dynamic routing information on both route-view and event-view graphs. (2) For macro graphs, a bipartite graph learning approach to extract spatial representations. (3) For spatio-temporal feature fusion, the spatio-temporal joint forecasting module combines the temporal feature from the time-series encoder with hierarchical spatial features to predict the future supply capacity. The extensive experiments on two real-world datasets demonstrate the effectiveness of our proposed model, which achieves state-of-the-art performance compared with advanced baselines.


  • Open Access

    Hierarchical Information Propagation and Aggregation in Disentangled Graph Networks for Audience Expansion

    by Li Lin, Xinyao Chen, Kaiwen Xia, Shuai Wang, Desheng Zhang, Tian He

    With the development of the logistics industry, the user base of logistics services has expanded swiftly. This rapid increase in user scale presents significant challenges for logistics business management. A fundamental issue in such scenarios is audience expansion, which aims to find users willing to sign long-term services with logistics companies to foster business growth. Existing methods in addressing audience expansion mainly assume user modeling is entangled and neglects the inherent community structure among users. Due to these limitations, the effectiveness of traditional methods in achieving accurate user expansion is often restricted. Our work introduces a novel heterogeneous graph-based model, named Hi-DGN, which concentrates on the Hierarchical information propagation and aggregation in Disentangled Graph Networks for audience expansion. It consists of three main components: (i) the disentangled embedding layer to decouple user representations into different aspects, enabling the extraction of differentiated features; (ii) the hierarchical information propagation module partitions individual nodes into distinct groups and propagates information from group nodes to individual nodes hierarchically to capture diverse granularity representations; and (iii) the aggregation module to fuse all relation-specific embeddings to generate global node embeddings. Extensive experiments on two real-world datasets demonstrate the effectiveness of our method in various evaluation settings.


  • Open Access

    A Predict-Then-Optimize Couriers Allocation Framework for Emergency Last-mile Logistics

    by Kaiwen Xia, Li Lin, Shuai Wang, Haotian Wang, Desheng Zhang, Tian He

    In recent years, emergency last-mile logistics (ELML) have played an essential role in urban emergencies. The efficient allocation of couriers in ELML is of practical significance to ensure the supply of essential materials, especially in public health emergencies (PHEs). However, couriers allocation becomes challenging due to the instability of demand, dynamic supply comprehension, and the evolutional delivery environment for ELML caused by PHEs. While existing work has delved into couriers allocation, the impact of PHEs on demand-supply-delivery has yet to be considered. In this work, we design PTOCA, a Predict-Then-Optimize Couriers Allocation framework. Specifically, in the prediction stage, we design a resource-aware prediction module that performs spatio-temporal modeling of unstable demand characteristics using a variational graph GRU encoder and builds a task-resource regressor to predict demand accurately. In the optimization stage, firstly, the priority ranking module solves the matching of delivery resources under demand-supply imbalance. Then the multi-factor task allocation module is used to model the dynamic evolutional environment and reasonably assign the delivery tasks of couriers. We evaluate PTOCA using real-world data covering 170 delivery zones, more than 10,000 couriers, and 100 million delivery tasks. The data is collected from JD Logistics, one of the largest logistics service companies. Extensive experimental results show that our method outperforms the baseline in task delivery rate and on-time delivery rate.


  • Open Access

    Emergency Vehicle Intelligent Distribution System

    by Yongxue Wang, Kaiwen Xia, Yanxiong Yang, Wu Xie, Qunfeng Miao, Tao Liu

    In this study, we developed a vehicle allocation model that can meet the requirements and cost best, the data related to the number of calls in each zone, and the variability required to respond to different types of calls. First, several indicators are extracted to quantify the advantages of station construction in each zone, and the hierarchical analysis method and TOPSIS are used to score each zone, and then select the stations that need to be built according to the score. Subsequently, according to the call requirements of each zone, its distance from the site, the amount of resources owned, etc, we develop a vehicle allocation model based on integer programming.