The Inventory Routing Problem (IRP) is an integration of two operational problems: inventory management and routing. The Time-Dependent Travel-Time Constrained (TD-TC-IRP) is a new proposed variant of the IRP where the travelling time between two locations depend on the time of departure throughout the day and the length of a trip is time-constrained. The real-world discontinuous time-dependent data that we use will be modelled by a piece-wise linear continuous function. A mathematical formulation for the TD-TC-IRP is proposed, to emulate such transformation. Numerical experiments are conducted, to validate the mathematical formulation, on a new benchmark combining benchmarks from the IRP and time-dependent routing problems literature.
https://doi.org/10.1007/978-3-030-59747-4_10Cite as:
@incollection{Touzout_2020,
doi = {10.1007/978-3-030-59747-4_10},
url = {https://doi.org/10.1007%2F978-3-030-59747-4_10},
year = 2020,
publisher = {Springer International Publishing},
pages = {151--166},
author = {Faycal A. Touzout and Anne-Laure Ladier and Khaled Hadj-Hamou},
title = {Time-Dependent Travel-Time Constrained Inventory Routing Problem},
booktitle = {Lecture Notes in Computer Science}
}