Dispatching Strategies for Dynamic Vehicle Routing Problems
Résumé
Online vehicle routing problems are highly complex problems for which several techniques have been successfully proposed. Traditionally, the solutions concern the optimization of conventional criteria (such as the number of mobilized vehicles and the total traveled distance). However, in online systems, the optimization of the response time to the connected users becomes at least as important as the optimization of the traditional criteria. Multi-agent systems and greedy insertion heuristics are the most promising approaches to optimize this criteria. To this end, we propose a multi-agent system and we focus on the clients dispatching strategy. The strategy decides which agents perform the computation to answer the clients requests. We propose three dispatching strategies: centralized, decentralized and hybrid. We compare these three approaches based on their response time to online users. We consider two experiments configuration, a centralized configuration and a network configuration. The results show the superiority of the centralized approach in the first configuration and the superiority of the hybrid approach in the second configuration.
Origine : Fichiers produits par l'(les) auteur(s)