.png){kind=icon}
返回
Estimating optimal split delivery vehicle routing problem solution values
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2024.106714.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper explores the application of linear regression models to estimate the optimal solution value (i.e., the sum of tour lengths) for the Split Delivery Vehicle Routing Problem (SDVRP). We present novel models that integrate topological features along with the mean and standard deviation of feasible solution values, achieving an impressive accuracy with an error margin of approximately 3%. To obtain random feasible solutions for the SDVRP quickly, we propose a modified Clarke & Wright algorithm with split delivery (MCWSD). Our results demonstrate the potential of extending our earlier work to more complex routing problems, highlighting the importance of incorporating diverse features to obtain accurate approximations.
Keyword:
Split delivery vehicle routing problem
Regression model
Prediction