Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/16677
Title: A branch-and-cut algorithm for a multi-item inventory distribution problem
Author: Agra, Agostinho
Cerveira, Adelaide
Requejo, Cristina
Keywords: Multi-item inventory
Hospital logistics
Branch-and-cut
Supply chain management
Issue Date: 2016
Publisher: Springer International Publishing
Abstract: This paper considers a multi-item inventory distribution problem motivated by a practical case occurring in the logistic operations of an hospital. There, a single warehouse supplies several nursing wards. The goal is to define a weekly distribution plan of medical products that minimizes the visits to wards, while respecting inventory capacities and safety stock levels. A mathematical formulation is introduced and several improvements such as tightening constraints, valid inequalities and an extended reformulation are discussed. In order to deal with real size instances, an hybrid heuristic based on mathematical models is introduced and the improvements are discussed. A branch-and-cut algorithm using all the discussed improvements is proposed. Finally, a computational experimentation is reported to show the relevance of the model improvements and the quality of the heuristic scheme.
URI: http://hdl.handle.net/10773/16677
DOI: 10.1007/978-3-319-51469-7_12
ISBN: 978-3-319-51468-0
ISSN: 0302-9743
Appears in Collections:CIDMA - Capítulo de livro
OGTCG - Capítulo de livro

Files in This Item:
File Description SizeFormat 
MIID-mod2016-paper20-postPrint.pdfMain article310.04 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.