Fast constructive heuristics for the uncapacitated inventory routing problem

The inventory routing problem (IRP) poses a significant optimization challenge across various industries. This paper focuses on the uncapacitated IRP, by introducing fast constructive heuristics integrating insights from approximation algorithms, particularly rounding techniques in linear programmin...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of heuristics Jg. 31; H. 2; S. 23
Hauptverfasser:	Alarcón, Miguel Ángel Marfurt, Pedrosa, Lehilton Lelis Chaves, Usberti, Fábio Luiz
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2025 Springer Nature B.V
Schlagworte:	Algorithms Approximation Artificial Intelligence Calculus of Variations and Optimal Control; Optimization Distribution costs Effectiveness Heuristic Heuristic methods Inventory Linear programming Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Routing Approximation algorithms Linear programming Inventory routing Heuristic algorithms Branch-and-cut
ISSN:	1381-1231, 1572-9397
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!