Afficher la notice abrégée

hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierKedge Business School [Talence]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorBEN MOHAMED, Imen
hal.structure.identifierCentre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport [CIRRELT]
hal.structure.identifierKedge Business School [Talence]
dc.contributor.authorKLIBI, Walid
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorSADYKOV, Ruslan
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierMapotempo
dc.contributor.authorŞEN, Halil
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierReformulations based algorithms for Combinatorial Optimization [Realopt]
hal.structure.identifierAtoptima
dc.contributor.authorVANDERBECK, François
dc.date.accessioned2024-04-04T03:00:33Z
dc.date.available2024-04-04T03:00:33Z
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/192827
dc.description.abstractEnIn the first echelon of the two-echelon stochastic multi-period capacitated location-routing problem (2E-SM-CLRP), one has to decide the number and location of warehouse platforms as well as the intermediate distribution platforms for each period; while fixing the capacity of the links between them. The system must be dimensioned to enable an efficient distribution of goods to customers under a stochastic and time-varying demand. In the second echelon of the 2E-SM-CLRP, the goal is to construct vehicle routes that visit customers from operating distribution platforms. The objective is to minimize the total expected cost. We model this hierarchical decision problem as a two-stage stochastic program with integer recourse. 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 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 subproblem is a capacitated vehicle-routing problem with capacitated multi-depot (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 reasonable time, and that relevant managerial insights are derived on the behavior of the design decisions under the stochastic multi-period characterization of the planning horizon.
dc.language.isoen
dc.title.enA Benders Decomposition Approach for the Two-Echelon Stochastic Multi-period Capacitated Location-Routing Problem
dc.typeDocument de travail - Pré-publication
dc.subject.halInformatique [cs]/Recherche opérationnelle [cs.RO]
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-02178459
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-02178459v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=BEN%20MOHAMED,%20Imen&KLIBI,%20Walid&SADYKOV,%20Ruslan&%C5%9EEN,%20Halil&VANDERBECK,%20Fran%C3%A7ois&rft.genre=preprint


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée