Work

Matheuristic Algorithms for the Inventory Routing Problem With Unsplit and Split Deliveries

Year: 2025

Type: article

Abstract: ABSTRACT We introduce new matheuristic algorithms for the Inventory Routing Problem with unsplit and split deliveries for both Order‐Up‐to Level and Maximum Level replenishment policies. The first matheuristic is based on the Capacitated Concentrator Location problem. The second is a route‐based approach using routes found in other schemes as input, including the ones found in the first matheuristic. We carry out extensive experiments on benchmark instances to understand their effectiveness. The results show that they are effective and require a relatively short computational time.

Source: Networks

DOI: 10.1002/net.22276

Authors: Nho Minh Dinh, Claudia Archetti, Luca Bertazzi

Institution: University of Brescia

Language: English

Topic: Vehicle Routing Optimization Methods

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: hybrid

Estimated APC paid: $3,750