Skip to Main content Skip to Navigation
New interface

Algorithmes pour les problèmes de tournées à la demande

Abstract : As part of this thesis, we investigate the vehicle routing problem. We propose heuristics to solve this problem quickly and efficiently. In this thesis, we deal with three problems: the first is the Dial-a-ride problem. For this problem, we propose heuristics based on the technique of insertion and a constraint propagation technique. We propose also the procedure SPLIT and some operators of local research to solve this problem. The second is the multi-criteria DARP for which we propose an ELS framework. The third is a DARP problem with financial constraints (DARPF), which is an extension of DARP. We solve this problem thanks to insertion heuristics using a constraint propagation technique. The objective function determines the characteristics of the tour. Experimental results show that our (meta-) heuristics give results more favorable to customers (better quality of service)
Document type :
Complete list of metadata

Cited literature [133 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Friday, February 17, 2012 - 11:38:10 AM
Last modification on : Sunday, June 26, 2022 - 9:37:02 AM
Long-term archiving on: : Friday, May 18, 2012 - 2:25:56 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00671350, version 1


Xiagang Zhao. Algorithmes pour les problèmes de tournées à la demande. Gestion et management. Université Blaise Pascal - Clermont-Ferrand II, 2011. Français. ⟨NNT : 2011CLF22125⟩. ⟨tel-00671350⟩



Record views


Files downloads