The inventory routing problem with two-dimensional loading constraints

doi:10.1016/j.cie.2025.111606

The inventory routing problem with two-dimensional loading constraints

2025-10-15

0

PRE

AI

P

Pedro H.B. Hokama

K

Kamyla Maria Ferreira *

DOI：10.1016/j.cie.2025.111606

Original

Original request for help

Save

Abstract

En 中文

• We introduce the Inventory Routing Problem with Two-dimensional Loading Constraints. • A novel integer linear programming formulation is proposed for the problem. • A branch-and-cut algorithm is developed based on the formulation, incorporating the Con- straint Programming approach. • The 2L-IRP is more challenging to solve than both the IRP and the 2L-CVRP. • The 2L-IRP achieves lower distribution costs compared to these traditional variants.

The inventory routing problem with two-dimensional loading constraints

Abstract

Journal

Organization