An improved model and exact algorithm using local branching for the inventory-routing problem with time windows

The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW) considers time windows for the deliveries to the customers. Due to its importance and several real-world applications, in this paper, we develop...

Celý popis

Podrobná bibliografia

Vydané v:	International journal of production research Ročník 61; číslo 1; s. 49 - 64
Hlavní autori:	Demantova, Bruno E., Scarpin, Cassius T., Coelho, Leandro C., Darvish, Maryam
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Taylor & Francis 02.01.2023 Taylor & Francis LLC
Predmet:	Algorithms exact methods Inventory-routing local branching Optimization time windows valid inequalities vehicle routing Windows (intervals)
ISSN:	0020-7543, 1366-588X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!