Capacity planning;
Variable Sized and Cost Bin packing;
last-mile delivery;
Machine Learning;
SUPPLY CHAIN;
DEMAND;
D O I:
10.1109/COMPSAC51774.2021.00180
中图分类号:
TP39 [计算机的应用];
学科分类号:
081203 ;
0835 ;
摘要:
Tactical Capacity Planning (TCP) is becoming a crucial part of logistics in the current environment of demand-driven economics. This paper proposes an innovative approach in the TCP setting, consisting of using the collected historical data of the geographical position and the volume of the orders to plan the capacity requirements for the next day. To this end, the clustering of the city to microzones is introduced using K-means clustering. Then, four different methods (Gaussian Process regression, ARIMA model, Neural Network regression, and Long Short Term Memory network) are used to forecast the next day order volume for each of the clusters. Finally, the Variable Cost and Size Bin Packing problem solved with the predicted demand to outline the usage of a heterogeneous fleet required to serve the next time period. Through experiments on the real data, we conclude, that the proposed algorithm is satisfying the decision safety framework with completely unknown demand and could also be used for other demand forecast applications.
机构:
Department of Industrial Engineering, Eindhoven University of Technology, Eindhoven
EU Supply Chain Science, Amazon, LuxembourgDepartment of Industrial Engineering, Eindhoven University of Technology, Eindhoven
Özarık S.S.
Costa P.D.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Industrial Engineering, Eindhoven University of Technology, EindhovenDepartment of Industrial Engineering, Eindhoven University of Technology, Eindhoven
Costa P.D.
Florio A.M.
论文数: 0引用数: 0
h-index: 0
机构:
Routing and Planning, Amazon, Bellevue, 98004, WADepartment of Industrial Engineering, Eindhoven University of Technology, Eindhoven