G. Ambrosino, J. Nelson, and M. Romnazzo, Demand Responsive Transport Services: Towards the flexible Mobility Agency, 2004.

B. Julstrom and G. , Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges, Proceedings of the 2002 ACM symposium on Applied computing , SAC '02, pp.547-552, 2002.
DOI : 10.1145/508791.508898

A. Bryant and G. R. Julstrom, A permutation-coded evolutionary algorithm for bounded-diameter minimum spanning tree problem, Genetic and Evolutionary Computation Conference's Workshops Proceedings, Workshop on Analysis And Design of Representations, 2003.

E. Castex, R. Chevrier, D. Josselin, and P. Canalda, Le transport la demande en multi-convergence, SAGEO'06

P. Chalasani and R. Motwani, Approximating Capacitated Routing and Delivery Problems, SIAM Journal on Computing, vol.28, issue.6, 1995.
DOI : 10.1137/S0097539795295468
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.4362

R. Chevrier, P. Canalda, P. Chatonnay, and D. Josselin, An Oriented Convergent Mutation Operator for Solving a Scalable Convergent Demand Responsive Transport Problem, 2006 International Conference on Service Systems and Service Management, 2006.
DOI : 10.1109/ICSSSM.2006.320761
URL : https://hal.archives-ouvertes.fr/hal-00372164

R. Chevrier, P. Canalda, P. Chatonnay, and D. Josselin, Vers une solution robuste et flexible du transportàtransport`transportà la demande en convergence : ´ etude trans-disciplinaire et mise en oeuvre, Actes du Workshop International : Logistique et Transport, pp.49-55, 2006.

D. Goldberg, Genetic algorithms in search, optimization, and machine learning, 1989.

D. Montana, M. Brinn, G. Bidwell, and S. Moore, Genetic algorithms for complex, real-time scheduling, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), pp.2213-2218, 1998.
DOI : 10.1109/ICSMC.1998.724984

D. Whitley, A genetic algorithm tutorial, Statistics and Computing, vol.4, issue.2, pp.65-85, 1994.
DOI : 10.1007/BF00175354

R. Günther, B. A. Raidl, and . Julstrom, Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem, SAC '03: Proceedings of the 2003 ACM symposium on Applied computing, pp.747-752, 2003.

K. A. Dejong and W. M. Spears, Using genetic algorithms to solve np-complete problems, Proceedings of the Third International Conference on Genetic Algorithms, pp.124-132, 1989.

M. Bielli, M. Caramia, and P. Carotenuto, Genetic algorithms in bus network optimization, Transportation Research Part C: Emerging Technologies, vol.10, issue.1, pp.19-34, 2002.
DOI : 10.1016/S0968-090X(00)00048-6

M. Forbes, Capacitated vehicle routing and the k-delivery n-traveling salesman problem, 2004.

M. Wall, Genetic algorithm library

M. E. Horn, Fleet scheduling and dispatching for demand-responsive passenger services, Transportation Research Part C: Emerging Technologies, vol.10, issue.1, pp.35-63, 2002.
DOI : 10.1016/S0968-090X(01)00003-1

M. W. Savelsberg and M. Sol, The General Pickup and Delivery Problem, Transportation Science, vol.29, issue.1, pp.17-29, 1995.
DOI : 10.1287/trsc.29.1.17

N. Christophides, A. Mingozzi, and P. Toth, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Mathematical Programming, vol.19, issue.1, pp.255-282, 1981.
DOI : 10.1007/BF01589353

O. Bräysy and M. Gendreau, Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms, Transportation Science, vol.39, issue.1, pp.104-118, 2005.
DOI : 10.1287/trsc.1030.0056

J. Renaud, F. F. Boctor, and J. Ouenniche, A heuristic for the pickup and delivery traveling salesman problem, Computers & Operations Research, vol.27, issue.9, pp.905-916, 2000.
DOI : 10.1016/S0305-0548(99)00066-0

S. Arora, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, Journal of the ACM, vol.45, issue.5, pp.753-782, 1998.
DOI : 10.1145/290179.290180

T. and D. Koffman, Operational experiences with flexible transit services, a synthesis of transit practice, 2004.