LIAAD - Indexed Articles in Conferences

Permanent URI for this collection

http://localhost:4000/handle/123456789/195

Browse

Browsing LIAAD - Indexed Articles in Conferences by Author "Adelaide Cerveira"
  • Item
    A branch-and-cut algorithm for a multi-item inventory distribution problem
    ( 2016) Agra,A ; Adelaide Cerveira ; Requejo,C
    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. © Springer International Publishing AG 2016.
  • Item
    Lagrangian relaxation bounds for a production-inventory-routing problem
    ( 2016) Agra,A ; Adelaide Cerveira ; Requejo,C
    We consider a single item Production-Inventory-Routing problem with a single producer/supplier and multiple retailers. Inventory management constraints are considered both at the producer and at the retailers, following a vendor managed inventory approach, where the supplier monitors the inventory at retailers and decides on the replenishment policy for each retailer. We assume a constant production capacity. Based on the mathematical formulation we discuss a classical Lagrangian relaxation which allows to decompose the problem into four subproblems, and a new Lagrangian decomposition which decomposes the problem into just a production-inventory subproblem and a routing subproblem. The new decomposition is enhanced with valid inequalities. A computational study is reported to compare the bounds from the two approaches. © Springer International Publishing AG 2016.