Stochastic Two-echelon Location-Routing
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| hal.structure.identifier | Kedge Business School [Talence] | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | BEN MOHAMED, Imen | |
| hal.structure.identifier | Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport [CIRRELT] | |
| hal.structure.identifier | Kedge Business School [Talence] | |
| dc.contributor.author | KLIBI, Walid | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | SADYKOV, Ruslan | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| hal.structure.identifier | Mapotempo | |
| dc.contributor.author | ŞEN, Halil | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | VANDERBECK, François | |
| dc.date.accessioned | 2024-04-04T03:00:32Z | |
| dc.date.available | 2024-04-04T03:00:32Z | |
| dc.date.conference | 2018-07-01 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/192826 | |
| dc.description.abstractEn | In the two-echelon location-routing problem one has to decide on the number and the location of primary warehouses as well as intermediate distribution platforms; while xing the capacity of the links between them. The system must be dimensioned to enable a ecient distribution of goods to customers under a stochastic and multi-period demand over a planning horizon. I.e., in the second echelon, the planning prescribes vehicle routes that visit ship-to-points from selected distribution platforms, minimizing the total expected transportation cost. For this two-stage stochastic program with recourse, we developed a Primal-Dual approach. We combine a Benders decomposition where the rst stage are the location and capacity decisions, with a Branch-and-Price algorithm to tackle the second stage routing problem. Our preliminary computational study illustrates the tight optimality gaps that can be obtained on realistic instances. | |
| dc.language.iso | en | |
| dc.title.en | Stochastic Two-echelon Location-Routing | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | ISMP 2018 - 23rd International Symposium on Mathematical Programming | |
| bordeaux.country | FR | |
| bordeaux.conference.city | Bordeaux | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-02178462 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | non | |
| hal.conference.end | 2018-07-06 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-02178462v1 | |
| bordeaux.COinS | ctx_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=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||