Skip to Main content Skip to Navigation
Journal articles

Column Generation based heuristic for the Vehicle Routing Problem with Time-Dependent Demand

Abstract : This paper presents a novel Capacitated Vehicle Routing Problem with Time- Dependent Demand (CVRP-TDD) applied to humanitarian logistics. This is a problem where the demand is time dependent and the objective is to maximize the total satisfied demand. When a disaster strikes a territory, the people go directly to shelters. If they do not receive the first aid, water, food, etc. They tend to flee out of the shelters looking for the aid outside of the affected area. This mobilization of people generates an increase in the chaos already caused by the disaster. The aid must arrive at shelters as quickly as possible to stop this mobilization. We developed a mixed integer linear program (MILP) and a column generation (CG) algorithm where the promising columns are generated using dynamic programming (DP).
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02485689
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Thursday, February 20, 2020 - 1:40:32 PM
Last modification on : Friday, February 21, 2020 - 1:36:58 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

Jorge Victoria, Hasan Murat Afsar, Christian Prins. Column Generation based heuristic for the Vehicle Routing Problem with Time-Dependent Demand. IFAC-PapersOnLine, Elsevier, 2016, 49 (12), pp.526-531. ⟨10.1016/j.ifacol.2016.07.684⟩. ⟨hal-02485689⟩

Share

Metrics

Record views

45