.png){kind=icon}
返回
Knowledge-based optimization algorithm for the inventory routing problem
.png){kind=icon}
OA
AI
DOI：10.1007/s00500-023-09024-9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Inventory Routing Problem (IRP) is a combinatorial optimization problem that combines routing decisions with inventory management. In this paper, an approach to solving the IRP is studied, which aims at using an external knowledge source (a known good solution or user interaction) to improve the results attained by an evolutionary algorithm solving an IRP instance. The proposed method improves the best solution found by the evolutionary algorithm by modifying schedules for some of the retailers according to those present in the known good solution or to schedules provided by a domain expert. The experiments shown that to improve the optimization results it suffices to perform a few repetitions of the knowledge import procedure. This observation motivates further research on user-interactive optimization algorithms for the IRP, because the number of interactions needed to improve the results can easily be handled by the user.
Keyword:
Combinatorial optimization
Knowledge-based optimization
Transportation optimization
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
.png){kind=icon}
An assign-and-route matheuristic for the time-dependent inventory routing problem时间相关的库存路径问题的分配和路径数学
OAAI
OAAI分享收藏The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains闭环供应链中带时间窗和同时提货和交货的可回收运输物品的库存路径问题OAAI
OAAI分享收藏A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs
PREAI
分享收藏分享收藏
查看更多内容