Résumé
Led by computer science and geography laboratories, this paper presents three algorithms for solving the Convergent Demand Responsive Transport Problem (CDRTP). Two of them are exact: the first one is based on a dynamic programming algorithm to enumerate exhaustively the sprawling spanning trees and the second one is based on a depth first search algorithm. The third one is stochastic and uses a steady state genetic algorithm. These approaches address the problems of scalability and flexibility, are compared and discussed.