arrow
返回

Bi-objective inventory routing problem with uncertain demand: a data-driven robust optimisation approach

delete2024-12-03
delete0
PRE
AI
Y
Yuqiang Feng
A
Ada Che *
J
Jieyu Lei
DOI:10.1080/00207543.2024.2432464delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This study addresses the single-period inventory routing problem (SIRP) with uncertain demands. We employ the support vector clustering technique to construct a data-driven uncertainty set to characterise demands uncertainty rather than imposing stochastic or fuzzy distribution. We propose a comprehensive expression to granularly calculate the inventory cost of products. Besides minimising the total cost from economics, we also consider the objective of minimising the total deviation level of delivery quantities to match supplies and uncertain demands and further to enhance service quality. We develop a data-driven robust bi-objective SIRP (RBSIRP) model that seeks a trade-off between these two perspectives. We apply the dual theory to obtain equivalent tractable forms of robust counterparts and employ the augmented epsilon-constraint approach to handle the developed objectives. The experimental results show the practical implications of our model and method. The RBSIRP model based on the constructed data-driven uncertainty set can reduce the conservatism of the delivery solution compared with the classical Budgeted and Box+Ball uncertainty sets while ensuring robustness. The trade-off delivery solution provided by the RBSIRP model is better than the one generated by the model minimising only the total cost.
Keyword:
Inventory routing problem
matching supplies and uncertain demands
bi-objective optimisation
data-driven robust optimisation
support vector clustering

期刊

International Journal of Production Research 封面图
International Journal of Production Research
IF:
7.3
论文数:
1.1W
被引数:
3.7W

机构

N
Northwestern Polytechnical University
学者数:
4.6W
论文数: 3.7W
被引数: 5.3W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
学者 查看更多内容