Show simple item record

The Two-Echelon Stochastic Multi-period Capacitated Location-Routing Problem

hal.structure.identifierKedge Business School [Kedge BS]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorBEN MOHAMED, Imen
hal.structure.identifierKedge Business School [Kedge BS]
dc.contributor.authorKLIBI, Walid
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierFormulations étendues et méthodes de décomposition pour des problèmes génériques d'optimisation [EDGE]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierMapotempo
dc.contributor.authorŞEN, Halil
hal.structure.identifierAtoptima
dc.contributor.authorVANDERBECK, François
dc.date.accessioned2024-04-04T02:37:11Z
dc.date.available2024-04-04T02:37:11Z
dc.date.issued2022-07-16
dc.identifier.issn0377-2217
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/190784
dc.description.abstractEnGiven the emergence of two-echelon distribution systems in several practical contexts, this paper tackles, at the strategic level, a distribution network design problem under uncertainty. This problem is defined as the two-echelon stochastic multi-period capacitated location-routing problem (2E-SM-CLRP). It considers a network partitioned into two capacitated distribution echelons: each echelon involves a specific location-assignment-transportation schema that must cope with the future demand. It aims to decide the number and location of warehousing/storage platforms (WPs) and distribution/fulfillment platforms (DPs), and on the capacity allocated from first echelon to second echelon platforms. In the second echelon, the goal is to construct vehicle routes that visit ship-to locations (SLs) from operating distribution platforms under a stochastic and time-varying demand and varying costs. This problem is modeled as a two-stage stochastic program with integer recourse, where the first-stage includes location and capacity decisions to be fixed at each period over the planning horizon, while routing decisions of the second echelon are determined in the recourse problem. We propose a logic-based Benders decomposition approach to solve this model. In the proposed approach, the location and capacity decisions are taken by solving the Benders master problem. After these first-stage decisions are fixed, the resulting sub-problem is a capacitated vehicle-routing problem with capacitated multiple depots (CVRP-CMD) that is solved by a branch-cut-and-price algorithm. Computational experiments show that instances of realistic size can be solved optimally within a reasonable time and provide relevant managerial insights on the impact of the stochastic and multi-period settings on the 2E-CLRP.
dc.language.isoen
dc.publisherElsevier
dc.title.enThe Two-Echelon Stochastic Multi-period Capacitated Location-Routing Problem
dc.typeArticle de revue
dc.identifier.doi10.1016/j.ejor.2022.07.022
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.journalEuropean Journal of Operational Research
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-02987266
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-02987266v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=European%20Journal%20of%20Operational%20Research&rft.date=2022-07-16&rft.eissn=0377-2217&rft.issn=0377-2217&rft.au=BEN%20MOHAMED,%20Imen&KLIBI,%20Walid&SADYKOV,%20Ruslan&%C5%9EEN,%20Halil&VANDERBECK,%20Fran%C3%A7ois&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record