Solving Inventory Routing Problems with the Gurobi Branch-and-Cut Algorithm

Autor:	Markus Kolb, Benjamin Keller, Danny Meier, Thomas Hanne
Rok vydání:	2021
Předmět:	Inventory routing problem Computer science Routing (electronic design automation) Software package Branch and cut Algorithm Test (assessment)
Zdroj:	Communications in Computer and Information Science ISBN: 9783030856717 OLA
DOI:	10.1007/978-3-030-85672-4_13
Popis:	This study is about the implementation and test of a branch-and-cut algorithm for an Inventory-Routing Problem (IRP). The considered mathematical model and the dedicated problem instances have been published by C. Archetti and others. The performance of the implementation on present day computer hardware has been compared to results published in literature several years ago. Also, the influence of the configuration of the used optimizing software package as well as experiences with the publication of the mentioned researchers are documented in this paper.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::e7093eac7e3545f0641891de7531f804 https://doi.org/10.1007/978-3-030-85672-4_13 Zobrazit plný text záznamu