Multi-Compartment Inventory Routing Problem with Split Delivery
A proposed solution approach for the Multi-Compartment Inventory Routing Problem (MCIRP) offers versatile applications, such as collecting diverse quality olive oils from manufacturers and distributing various fuel types to gas stations. This problem seeks to minimize total traveling costs while preventing stockouts for multiple products across the planning horizon. Distribution utilizes a uniform fleet of vehicles, with fixed-sized compartments capable of accommodating any product. The supplier orchestrates inventory levels by devising a distribution plan that adheres to compartment and customer capacity constraints. We explore the utilization of compartmentalized vehicles for split deliveries involving multiple products.
In tackling this intricate issue, we introduce a matheuristic approach that integrates Adaptive Large Neighborhood Search (ALNS) with mathematical models. The efficacy of this solution technique is validated through comparison with a conservative lower bound. Extensive computational analysis reveals that our proposed ALNS-based matheuristic achieves solutions with an approximate 18.13% optimality gap relative to the conservative lower bound.
The experiments have been completed. Target submission year is 2024.
This research is granted by The Scientific and Technological Research Institution of Turkey