Comparison of three algorithms for solving the convergent demand responsive transportation problem

Author

Chevrier, Rémy ; Canalda, Philippe ; Chatonnay, Pascal ; Josselin, Didier

Author_Institution

Univ. d´´Avignon et des Pays du Vaucluse, Avignon

fYear

2006

fDate

17-20 Sept. 2006

Firstpage

1096

Lastpage

1101

Abstract

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

Keywords

dynamic programming; genetic algorithms; search problems; stochastic programming; transportation; trees (mathematics); convergent demand responsive transportation problem; depth first search algorithm; dynamic programming; spanning trees; steady state genetic algorithm; stochastic programming; Computer science; Dynamic programming; Genetic algorithms; Geography; Heuristic algorithms; Laboratories; Scalability; Steady-state; Stochastic processes; Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Transportation Systems Conference, 2006. ITSC '06. IEEE

Conference_Location

Toronto, Ont.

Print_ISBN

1-4244-0093-7

Electronic_ISBN

1-4244-0094-5

Type

conf

DOI

10.1109/ITSC.2006.1707368

Filename

1707368