.png){kind=icon}
.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Combinatorial optimization
Knowledge-based optimization
Transportation optimization
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W