Skip to Main content Skip to Navigation

Modélisation et résolution de problèmes généralisés de tournées de véhicules

Abstract : The Routing Problem is one of the most popular and challenging combinatorial optimization problems. It involves finding the optimal set of routes for fleet of vehicles in order to serve a given set of customers. In the classic transportation problems, each customer is normally served by only one node (or arc). Therefore, there is always a given set of required nodes (or arcs) that have to be visited or traversed, and we just need to find the solution from this set of nodes (or arcs). But in many real applications where a customer can be served by from more than one node (or arc), the generalized resulting problems are more complex. The primary goal of this thesis is to study three generalized routing problems. The first one, the Close-Enough Arc Routing Problem(CEARP), has an interesting real-life application to routing for meter reading while the others two, the multi-vehicle Covering Tour Problem (mCTP) and the Generalized Vehicle Routing Problem(GVRP), can model problems concerned with the design of bilevel transportation networks. The problems are solved by exact methods as well as metaheuristics. To develop exact methods, we formulate each problem as a mathematical program, and then develop branch-and-cut algorithms. The metaheuristics are based on the evolutionary local search (ELS) method et on the greedy randomized adaptive search procedure (GRASP) method. The extensive computational experiments show the performance of our methods.
Document type :
Complete list of metadata
Contributor : Abes Star :  Contact
Submitted on : Tuesday, January 29, 2013 - 4:02:40 PM
Last modification on : Tuesday, September 21, 2021 - 4:12:11 PM
Long-term archiving on: : Tuesday, April 30, 2013 - 5:25:12 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00782375, version 1


Minh Hoang Ha. Modélisation et résolution de problèmes généralisés de tournées de véhicules. Automatique. Ecole des Mines de Nantes, 2012. Français. ⟨NNT : 2012EMNA0068⟩. ⟨tel-00782375⟩



Record views


Files downloads