An Oriented Convergent Mutation Operator for Solving a Scalable Convergent Demand Responsive Transport Problem

Rémy Chevrier (1, 2) , Philippe Canalda (3) , Pascal Chatonnay (3) , Didier Josselin (2)

1 LIFL - Laboratoire d'Informatique Fondamentale de Lille
2 ESPACE - Études des Structures, des Processus d’Adaptation et des Changements de l’Espace
3 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174)

This paper presents a method for solving the convergence demand responsive transport problem, by using a stochastic approach based on a steady state genetic algorithm for enumerating a set of optimizing sprawling spanning trees, which constitute the best solutions to this problem. Specifically designed to speed up the convergence to optimal solutions, we introduce an oriented convergent mutation operator, allowing multi-objective considerations. So this solution lays the first stakes for considering real-time solving of such a problem. Led by computer science and geography laboratories, this study is provided with a set of experimental results evaluating the approach.

Mots clés: Transport; DARP; genetic algorithms; spanning trees

Domaines: Recherche opérationnelle [math.OC]

Rémy Chevrier, Philippe Canalda, Pascal Chatonnay, Didier Josselin. An Oriented Convergent Mutation Operator for Solving a Scalable Convergent Demand Responsive Transport Problem. Service Systems and Service Management, 2006, Troyes, France. pp.959-964. ⟨hal-00372164⟩