An End-to-End Predict-Then-Optimize Clustering Method for Stochastic Assignment Problems

作者：Jinlei Zhang, Ergang Shan, Lixia Wu, Jiateng Yin, Lixing Yang, Ziyou Gao · 发表于：IEEE Transactions on Intelligent Transportation Systems · 年份：2024 · DOI：10.1109/tits.2024.3385029 · 被引用次数：13 · 研究领域：Transportation Planning and Optimization、Data Management and Algorithms、Vehicle Routing Optimization Methods

Express pickup and delivery systems play crucial roles in contemporary urban areas. Couriers within these systems retrieve packages from designated Areas of Interest (AOI) that the express company assigns to them during specific time intervals. The express company traditionally employs historical pickup request data for executing AOI assignments (or pickup request assignments) for couriers, and these assignments are conventionally static and do not evolve over time However, future pickup requests display significant temporal variations. Employing historical data for future assignments is, therefore, somewhat impractical. Furthermore, even if we were to predict future pickup requests beforehand and subsequently employ these predictions for assignments, this two-stage approach proves to be both impractical and trivial, potentially harboring drawbacks. For example, the better prediction results may not necessarily guarantee better clustering outcomes. To address these challenges, we introduce an intelligent end-to-end predict-then-optimize clustering method that simultaneously forecasts future pickup requests for AOIs and dynamically allocates AOIs to couriers through clustering. Initially, we propose a deep learning-based prediction model for predicting order quantities within AOIs. Subsequently, we present a differential constrainedK-means clustering method for AOI clustering based on the prediction results. Finally, we introduce a one-stage end-to-end predict-then-optimize cl...