Skip to Main content Skip to Navigation

Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique

Abstract : Nowadays, the transport goods problem occupies an important place in the economic life of modern societies. The PDPTW (Pickup and delivery problem with Time Windows) is one which a large part of researchers was interested. This is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence and capacity.Researchers developed in this thesis concerns the resolution of the PDPTW with multiple vehicles (m-PDPTW). The latter was treated in two cases: static and dynamic.We have proposed some approaches to solving the m- PDPTW, based on genetic algorithms, multicriteria optimization and the lower bounds, and this to minimize a number of criteria such as: the vehicles number, the total travel cost, and the total tardiness time.Computational results indicate that the proposed approach gives good results with a total tardiness equal to zero with a tolerable cost
Document type :
Complete list of metadatas

Cited literature [76 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Tuesday, May 3, 2011 - 3:11:18 PM
Last modification on : Tuesday, November 24, 2020 - 2:18:22 PM
Long-term archiving on: : Thursday, August 4, 2011 - 2:30:07 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00590443, version 1



Imen Harbaoui Dridi. Optimisation heuristique pour la résolution du m-PDPTW statique et dynamique. Autre. Ecole Centrale de Lille, 2010. Français. ⟨NNT : 2010ECLI0031⟩. ⟨tel-00590443⟩



Record views


Files downloads