Skip to Main content Skip to Navigation

Heuristiques pour un Problème de m-Tournées Sélectives

Abstract : This thesis is devoted to a transportation problem called “the Selective Vehicle Routing Problem” or “the Team Orienteering Problem” TOP. The TOP consists of determining m tours for a fleet of vehicles over a subset of customers. Here, the vehicle capacity is not taken into account since services instead of goods are provided to customers. As a counter part for services, a profit is collected at each served customer. Each vehicle must start from a depot and end at another one once a subset of customers is visited. The tour length of each vehicle must not exceed a preset value. Each customer can be served at most by one vehicle. The objective consists of maximizing the total profit collected. Since the TOP is NP-hard, we develop approximate solution methods. The heuristics proposed are based on the "Cluster first - Route second" strategy. These heuristics could be integrated in a decision support system for the planning of maintenance technicians.
Document type :
Complete list of metadata

Cited literature [105 references]  Display  Hide  Download
Contributor : Mahdi Khemakhem Connect in order to contact the contributor
Submitted on : Friday, December 11, 2009 - 12:18:04 PM
Last modification on : Tuesday, November 23, 2021 - 9:44:22 AM
Long-term archiving on: : Thursday, June 17, 2010 - 11:32:38 PM


  • HAL Id : tel-00440494, version 1


Mahdi Khemakhem. Heuristiques pour un Problème de m-Tournées Sélectives. Modélisation et simulation. Université de Valenciennes et du Hainaut-Cambresis, 2008. Français. ⟨tel-00440494⟩



Record views


Files downloads