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

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

[1]  Rajeev Motwani,et al.  Approximating Capacitated Routing and Delivery Problems , 1999, SIAM J. Comput..

[2]  G. Raidl,et al.  A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem , 2003 .

[3]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[4]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

[5]  Darrell Whitley,et al.  A genetic algorithm tutorial , 1994, Statistics and Computing.

[6]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[7]  Bryant A. Julstrom,et al.  Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges , 2002, SAC '02.

[8]  Marshall Brinn,et al.  Genetic algorithms for complex, real-time scheduling , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[9]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[10]  Mark E. T. Horn,et al.  Fleet scheduling and dispatching for demand-responsive passenger services , 2002 .

[11]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[12]  David Koffman,et al.  Operational Experiences with Flexible Transit Services , 2004 .

[13]  Bryant A. Julstrom,et al.  Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem , 2003, SAC '03.

[14]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[15]  Michael Forbes,et al.  Capacitated Vehicle Routing and the k-Delivery n-Traveling Salesman Problem November 15 , 2004 .

[16]  J. Nelson,et al.  Demand responsive transport services : towards the flexible mobility agency , 2004 .

[17]  Jacques Renaud,et al.  A heuristic for the pickup and delivery traveling salesman problem , 2000, Comput. Oper. Res..

[18]  R. Chevrier,et al.  An Oriented Convergent Mutation Operator for Solving a Scalable Convergent Demand Responsive Transport Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[19]  Maurizio Bielli,et al.  Genetic algorithms in bus network optimization , 2002 .