Column Generation based heuristic for the Vehicle Routing Problem with Time-Dependent Demand - Archive ouverte HAL Access content directly
Journal Articles IFAC-PapersOnLine Year : 2016

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

(1) , (1) , (1)
1

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).

Dates and versions

hal-02485689 , version 1 (20-02-2020)

Identifiers

Cite

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

Collections

CNRS UTT LOSI
12 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More