2026-07-20T02:15:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2189 2024-03-06T11:08:48Z ddc:004 open_access

Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem Gendron, Bernard Khuong, Paul-Virak Semet, Frédéric Two-echelon location problem formulations relaxations variable neighborhood search We consider a two-echelon location-distribution problem arising from an actual application in fast delivery service. This problem belongs to the class of adaptive logistics problems, as the locations of the facilities (typically, parking spaces) are revised on a daily basis according to demand variations. We present and compare two formulations for this problem: an arc-based model and a path-based model. Since these formulations cannot be solved in reasonable time for large-scale instances, we introduce a heuristic method based on a variable neighborhood search approach. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Bernard Gendron and Paul-Virak Khuong and Frédéric Semet 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09261.8 urn:nbn:de:0030-drops-21892 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.8 eng https://creativecommons.org/licenses/by/4.0/legalcode