Show simple item record

dc.contributor.authorAraya-Sassi C.
dc.contributor.authorParedes-Belmar G.
dc.contributor.authorGutiérrez-Jarpa G.
dc.date.accessioned2020-09-02T22:12:25Z
dc.date.available2020-09-02T22:12:25Z
dc.date.issued2020
dc.identifier10.1016/j.cie.2020.106410
dc.identifier.citation143, , -
dc.identifier.issn03608352
dc.identifier.urihttps://hdl.handle.net/20.500.12728/3597
dc.descriptionIn this article, we introduce two novel multi-commodity inventory-location models considering continuous and periodic review inventory control policies and modular stochastic capacity constraints. The models address a logistic problem in which a single plant supplies a set of commodities to warehouses where they serve a set of customers or retailers. The problem consists of determining which warehouses should be opened, which commodities are assigned, and which customers should be served by the located warehouses; as well as their reorder points and order sizes in order to minimize costs of the system while satisfying service level requirements. This problem can be formulated as a mixed-integer nonlinear programming model, which is non-convex in terms of modular stochastic capacity constraints and the objective function. A Lagrangian relaxation and the subgradient method solution approach is proposed. We consider the relaxation of three sets of constraints, including customer assignment, warehouse demand, and variance constraints. Thus, we develop a Lagrangian heuristic to determine a feasible integer solution at each iteration of the subgradient method. An experimental study shows that the proposed algorithm provides good quality gaps and near-optimal solutions in a short time. It also evinces significant impacts of the selected inventory control policy into total costs and network design, including risk pooling effects, when it is compared with different review period values and continuous review. © 2020 Elsevier Ltd
dc.language.isoen
dc.publisherElsevier Ltd
dc.subjectChance constrained programming
dc.subjectLagrangian relaxation
dc.subjectModular stochastic capacity constraints
dc.subjectMulti-commodity inventory-location problems
dc.subjectRisk pooling
dc.subjectComputer programming
dc.subjectHeuristic methods
dc.subjectInteger programming
dc.subjectInventory control
dc.subjectIterative methods
dc.subjectLagrange multipliers
dc.subjectLocation
dc.subjectNonlinear programming
dc.subjectSales
dc.subjectStochastic models
dc.subjectWarehouses
dc.subjectChance-constrained programming
dc.subjectInventory location
dc.subjectLaGrangian relaxation
dc.subjectRisk pooling
dc.subjectStochastic capacity
dc.subjectStochastic systems
dc.titleMulti-commodity inventory-location problem with two different review inventory control policies and modular stochastic capacity constraints
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record