63. A mathematical programming-based heuristic for the perishable inventory routing problem with product substitution
Invited abstract in session FC-2: Logistics, stream Logistics.
Friday, 13:30 - 15:00Room: M228
Authors (first author is the speaker)
| 1. | Mustafa Avci
|
| Industrial Engineering, Izmir Bakircay University | |
| 2. | Mualla Gonca Avci
|
| Industrial Engineering, Dokuz Eylul University |
Abstract
The inventory routing problem (IRP) integrates inventory management and vehicle routing decisions. The IRP typically arises in vendor managed inventory systems, where a supplier monitors the inventory levels of a set of retailers and makes the replenishment decisions for each of them. In this study, we address an IRP with multiple perishable products and product substitution option. Each product is assumed to have a fixed shelf-life, and demand of some products can be fulfilled by using a set of substitutable products. We develop a mixed integer linear programming formulation for the problem and propose a matheuristic solution approach to obtain high-quality solutions in reasonable computation times. The matheuristic is applied to a set of randomly generated problem instances. The performance of the developed algorithm is evaluated according to the computational results.
Keywords
- Routing, location and capacity planning
- Logistics and supply chain management
- Heuristics and meta-heuristics
Status: accepted
Back to the list of papers