Skip to Main content Skip to Navigation

Planning and routing via decomposition approaches

Abstract : Static and deterministic vehicle routing problems cannot be used in many real-life systems, as input data are not reliable and revealedover time. In this thesis, we study a pickup and delivery problem with time windows accounting for maximum ride time constraints – the so-called diala- ride problem – in its static and dynamic variant, and we make specific proposal on robust optimization models for this problem. To solve the static model, we develop a branch-and-price approach that handles ride time constraints in the process of generating feasible vehicle routes in the course of the optimization procedure. Our work is focussed on the pricing problem solver and acceleration techniques for the branch-and-price approach. Our numerical results show that the method is competitive compared to existing approaches that are based on branch-and-cut. In the dynamic context, where some input data are revealed or modified over time, we apply our branchand- price algorithm for re-optimization in a rolling horizon approach.
Document type :
Complete list of metadata

Cited literature [41 references]  Display  Hide  Download
Contributor : Boris Detienne Connect in order to contact the contributor
Submitted on : Monday, February 9, 2015 - 9:45:05 AM
Last modification on : Saturday, December 4, 2021 - 3:43:00 AM
Long-term archiving on: : Wednesday, May 27, 2015 - 5:21:05 PM


  • HAL Id : tel-01104752, version 2



Nastaran Rahmani. Planning and routing via decomposition approaches. General Mathematics [math.GM]. Université de Bordeaux, 2014. English. ⟨NNT : 2014BORD0141⟩. ⟨tel-01104752v2⟩



Record views


Files downloads