U. M. Aïvodji, S. Gambs, M. Huguet, and M. Killijian, Meeting points in ridesharing: A privacy-preserving approach, Transportation Research Part C: Emerging Technologies, vol.72, pp.239-253, 2016.

M. P. Armstrong, G. Rushton, and D. L. Zimmerman, Geographically masking health data to preserve confidentiality 29, 1999.

A. Atahran, C. Lenté, and V. T'kindt, A Multicriteria Dial-a-Ride Problem with an Ecological Measure and Heterogeneous Vehicles: MULTICRITERIA DIAL-A-RIDE PROBLEM, J. Multi-Crit. Decis. Anal, vol.21, pp.279-298, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01025732

,

A. Attanasio, J. Cordeau, G. Ghiani, and G. Laporte, Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem, Parallel Computing, vol.30, pp.377-387, 2004.

N. Balakrishnan, Simple Heuristics for the Vehicle Routeing Problem with Soft Time Windows, Journal of the Operational Research Society, vol.44, pp.279-287, 1993.

R. Bellman, The theory of dynamic programming, Bull. Amer. Math. Soc, vol.60, pp.503-516, 1954.

G. Berbeglia, J. Cordeau, I. Gribkovskaia, and G. Laporte, Static pickup and delivery problems: a classification scheme and survey, TOP, vol.15, pp.1-31, 2007.

A. R. Beresford and F. Stajano, Location privacy in pervasive computing, IEEE Pervasive Comput, vol.2, pp.46-55, 2003.

A. Bettinelli, A. Ceselli, and G. Righini, A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows, Math. Prog. Comp, vol.6, pp.171-197, 2014.

B. Caulfield, Estimating the environmental benefits of ride-sharing: A case study of Dublin, Transportation Research Part D: Transport and Environment, vol.14, pp.527-531, 2009.

M. Chassaing, Problèmes de transport à la demande avec prise en compte de la qualité de service, 2015.

B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM, vol.47, pp.1028-1047, 2000.

R. Chen, B. C. Fung, N. Mohammed, B. C. Desai, and K. Wang, Privacy-preserving trajectory data publishing by local suppression, Information Sciences, vol.231, pp.83-97, 2013.

R. Cheng, Y. Zhang, E. Bertino, S. Prabhakar, G. Danezis et al., Preserving User Location Privacy in Mobile Data Management Infrastructures, Privacy Enhancing Technologies, pp.393-412, 2006.

N. Christofides, Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem 11, 1976.

N. H. Cohen, A. Purakayastha, J. Turek, L. Wong, and D. Yeh, Challenges in Flexible Aggregation of Pervasive Data 15, 2001.

, Privacy, and Mobility -MPM '12. Présenté à the First Workshop, pp.1-6

T. Garaix, C. Artigues, D. Feillet, and D. Josselin, Vehicle routing problems with alternative paths: An application to on-demand transportation, European Journal of Operational Research, vol.204, pp.62-75, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00109003

B. Gedik and L. Liu, MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries, IEEE Trans. on Mobile Comput, vol.5, pp.1384-1402, 2006.

M. Gendreau, G. Laporte, C. Musaraganyi, and É. D. Taillard, A tabu search heuristic for the heterogeneous fleet vehicle routing problem, Computers & Operations Research, vol.26, pp.1153-1173, 1999.

M. Gendreau and J. Potvin, Handbook of metaheuristics, 2. ed. ed, International series in operations research & management science, 2010.

B. Golden, A. Assad, L. Levy, and F. Gheysens, The fleet size and mix vehicle routing problem, Computers & Operations Research, vol.11, issue.84, pp.90007-90015, 1984.

B. L. Golden and R. T. Wong, Capacitated arc routing problems, Networks, vol.11, pp.305-315, 1981.

T. Gschwind and M. Drexl, Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem, Transportation Science, vol.53, pp.480-491, 2019.

T. Gschwind and S. Irnich, Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem, Transportation Science, vol.49, pp.335-354, 2014.

M. Guan, Graphic programming using odd and even points, Chinese Math, pp.237-277, 1962.

B. Hajek, Optimization by simulated annealing: a necessary and sufficient condition for convergence, Institute of Mathematical Statistics Lecture Notes -Monograph Series. Institute of Mathematical Statistics, pp.417-427, 1986.

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.80, p.90051, 1980.

M. Held and R. M. Karp, A Dynamic Programming Approach to Sequencing Problems, Journal of the Society for Industrial and Applied Mathematics, vol.10, pp.196-210, 1962.

J. Jaw, A. R. Odoni, H. N. Psaraftis, and N. H. Wilson, A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows, Transportation Research Part B: Methodological, vol.20, issue.86, pp.90020-90022, 1986.

R. M. Jorgensen, J. Larsen, and K. B. Bergvinsdottir, Solving the Dial-a-Ride problem using genetic algorithms, Journal of the Operational Research Society, vol.58, pp.1321-1331, 2007.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math, vol.1, pp.269-271, 1959.

J. Dongarra, P. Luszczek, P. Feautrier, F. G. Zee, E. Chan et al., Encyclopedia of Parallel Computing, pp.1033-1036, 2011.

C. Duhamel, P. Lacomme, C. Prodhon, and C. Prins, A GRASP-ELS approach for reallife Location Routing Problems, Computers & Industrial Engineering. Présenté à Industrial Engineering, issue.CIE39, pp.1082-1087, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02476460

M. Firat and G. J. Woeginger, Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh, Oper. Res. Lett, vol.39, pp.32-35, 2011.

M. Furuhata, M. Dessouky, F. Ordóñez, M. Brunet, X. Wang et al., Ridesharing: The state-of-the-art and future directions, Transp. Res. Part B Methodol, vol.57, pp.28-46, 2013.

S. Gambs, M. Killijian, and M. N. Del-prado-cortez, Show me how you move and I will tell you who you are, Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS -SPRINGL '10. Présenté à the 3rd ACM SIGSPATIAL International Workshop, p.34, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00660055

S. Lin and B. W. Kernighan, An Effective Heuristic Algorithm for the Traveling-Salesman Problem, Oper. Res, vol.21, pp.498-516, 1973.

H. R. Lourenço, O. C. Martin, T. Stützle, F. Glover, and G. A. Kochenberger, Iterated Local Search, Handbook of Metaheuristics, pp.320-353, 2003.

R. Masson, F. Lehuédé, and O. Péton, The Dial-A-Ride Problem with Transfers, Comput. Oper. Res, vol.41, pp.12-23, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00818800

J. Potvin and J. Rousseau, A parallel route building algorithm for the vehicle routing and scheduling problem with time windows, Eur. J. Oper. Res, vol.66, pp.331-340, 1993.

C. Prins, F. B. Pereira, and J. Tavares, A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem, pp.35-53, 2009.
URL : https://hal.archives-ouvertes.fr/hal-02476253

D. Quercia, N. Lathia, F. Calabrese, G. Di-lorenzo, and J. Crowcroft, Recommending Social Events from Mobile Phone Location Data, 2010 IEEE International Conference on Data Mining. Présenté à 2010 IEEE 10th International Conference on Data Mining (ICDM), pp.971-976, 2010.

R. Beasley and J. , Route first-Cluster second methods for vehicle routing, Omega, vol.11, issue.83, pp.90033-90039, 1983.

L. Bodin and B. Golden, Classification in vehicle routing and scheduling, Networks, vol.11, pp.97-108, 1981.

O. Bor?vka, O jisíém problému minimálním, p.24, 1926.

M. Chassaing, Problèmes de transport à la demande avec prise en compte de la qualité de service, 2015.

M. Chassaing, C. Duhamel, and P. Lacomme, An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem, Eng. Appl. Artif. Intell, vol.48, pp.119-133, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02196345

B. Chazelle, A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM, vol.47, pp.1028-1047, 2000.

P. C. Chu and J. E. Beasley, A Genetic Algorithm for the Multidimensional Knapsack Problem, J. Heuristics, vol.4, pp.63-86, 1998.

G. Clarke and J. W. Wright, Scheduling of Vehicles from a Central Depot to a Number of Delivery Points, Oper. Res, vol.12, pp.568-581, 1964.

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-aride problem, Transp. Res. Part B Methodol, vol.37, pp.579-594, 2003.

,

T. Dantzig, Number: The Language of Science: A Critical Survey Written for the Cultured Non-Mathematician, 1930.

J. Dongarra, P. Luszczek, P. Feautrier, F. G. Zee, E. Chan et al., Encyclopedia of Parallel Computing, pp.1033-1036, 2011.

D. B. Fogel, Artificial Intelligence through Simulated Evolution, in: Evolutionary Computation, 2009.

D. E. Goldberg, Genetic Algorithms in search, optimisation, and machine learning, 1989.

D. E. Goldberg and R. Lingle, Alleles, loci, and the traveling salesman problem, Proc. Int. Conf. Genet. Algorithms Their Appl, pp.154-159, 1985.

J. H. Holland, Adaptation in natural and artificial systems, 1975.

R. M. Karp, R. E. Miller, J. W. Thatcher, and J. D. Bohlinger, Reducibility among Combinatorial Problems, Complexity of Computer Computations, pp.85-103, 1972.

, La recherche dichotomique par somme pondérée introduite par (Geoffrion, 1968) et utilisée dans un contexte bi-objectif par, 1979.

. Haimes, La méthode -contrainte présentée par, 1971.

. Murata, 2003) et utilisée par (Lacomme et al., 2006) sur un problème bi-objectif de tournées sur arcs avec capacité

, Les individus représentant ces solutions sont intégrés à la population en cours avant la fonction de filtrage de l'algorithme génétique, des solutions générées

, Choix du coût fixe par client transporté pour les véhicules publics

, Choix du coût fixe par client transporté pour les véhicules privés

, Choix du coût dépendant du trajet pour les véhicules publics

, Choix du coût dépendant du trajet pour les véhicules privés

, Les modifications doivent prendre en compte les cas les plus défavorables pour l'utilisation des véhicules privés. Par conséquent, si dans les meilleures solutions fournies lors de la résolution des instances, ces derniers sont utilisés dans les cas les moins propices à leur implantation

L. Ainsi and . Coût, fixe par client transporté pour les véhicules publics (1) est fixé à 0? car l'entreprise de transport n'a pas de dépenses fixes engendrées par chaque client supplémentaire dans ses tournées

, ) représente un montant versé par l'entreprise à un conducteur privé pour chaque client que ce dernier va transporter et qui n'aura donc pas besoin d'être pris en charge par un véhicule public. Pour chaque instance résolue, 5 scénarios différents ont été envisagés avec chacun un coût fixe différent, Le coût fixe des clients transporté par les véhicules privés, vol.15, pp.25-30

Y. P. Aneja and K. P. Nair, Bicriteria Transportation Problem. Manag. Sci, vol.25, pp.73-78, 1979.

A. Cerqueus, Bi-objective branch-and-cut algorithms applied to the binary knapsack problem : surrogate bound sets, dynamic branching strategies, generation and exploitation of cover inequalities, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01242210

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput, vol.6, pp.182-197, 2002.

J. Dongarra, P. Luszczek, P. Feautrier, F. G. Zee, E. Chan et al., Encyclopedia of Parallel Computing, pp.1033-1036, 2011.

M. Ehrgott, Multicriteria optimization, 2005.

M. Ehrgott and X. Gandibleux, A survey and annotated bibliography of multiobjective combinatorial optimization, Spectr, vol.22, pp.425-460, 2000.
URL : https://hal.archives-ouvertes.fr/hal-00462047

,

A. M. Geoffrion, Proper efficiency and the theory of vector maximization, J. Math. Anal. Appl, vol.22, pp.90201-90202, 1968.

F. Guerriero, F. Pezzella, O. Pisacane, and L. Trollini, Multi-objective Optimization in Dial-a-ride Public Transportation, Transp. Res. Procedia, vol.3, pp.299-308, 2014.

Y. Y. Haimes, L. S. Lasdon, and D. A. Wismer, On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization, IEEE Trans. Syst. Man Cybern. SMC, vol.1, pp.296-297, 1971.

C. Hugrel and R. Joumard, Transport routier -parc, usage et émissions des véhicules en France de, 1970.

N. Jozefowiez, F. Semet, and E. Talbi, Multi-objective vehicle routing problems, Eur. J. Oper. Res, vol.189, pp.293-309, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00831915

N. Jozefowiez, F. Semet, and E. Talbi, The bi-objective covering tour problem, Comput. Oper. Res, vol.34, pp.1929-1942, 2007.

P. Lacomme, C. Prins, and M. Sevaux, A genetic algorithm for a bi-objective capacitated arc routing problem, Comput. Oper. Res, vol.33, pp.3473-3493, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00069404

,

O. B. Madsen, H. F. Ravn, and J. M. Rygaard, A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives, Ann. Oper. Res, vol.60, pp.193-208, 1995.

T. Murata, H. Nozawa, H. Ishibuchi, M. Gen, C. M. Fonseca et al., Modification of Local Search Directions for Non-dominated Solutions in Cellular Multiobjective Genetic Algorithms for Pattern Classification Problems, Evolutionary Multi-Criterion Optimization, 2003.

H. Springer-berlin, , pp.593-607

J. Pacheco and R. Martí, Tabu search for a multi-objective routing problem, J. Oper. Res. Soc, vol.57, pp.29-37, 2006.

S. N. Parragh, K. F. Doerner, R. F. Hartl, and X. Gandibleux, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, Networks, vol.54, pp.227-242, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00461739

J. M. Pasia, K. F. Doerner, R. F. Hartl, M. Reimann, T. Stützle et al., Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics, pp.187-191, 2007.

I. Zidi, K. Mesghouni, K. Zidi, and K. Ghedira, A multi-objective simulated annealing for the multi-criteria dial a ride problem, Eng. Appl. Artif. Intell, vol.25, pp.1121-1131, 2012.

E. Zitzler, S. Künzli, X. Yao, E. K. Burke, J. A. Lozano et al., Indicator-Based Selection in Multiobjective Search, pp.832-842, 2004.

E. Zitzler, M. Laumanns, and L. Thiele, SPEA2: Improving the strength pareto evolutionary algorithm, 2001.

E. Zitzler and L. Thiele, Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach, IEEE Trans. Evol. Comput, vol.3, pp.257-271, 1999.

R. Baldacci, R. Mingozzi, and A. , A unified exact method for solving different classes of vehicle routing problems, Math. Program, vol.120, pp.347-380, 2009.

,

M. Chassaing, C. Duhamel, and P. Lacomme, An ELS-based approach with dynamic probabilities management in local search for the Dial-A-Ride Problem, Engineering Applications of Artificial Intelligence, vol.48, pp.119-133, 2016.
URL : https://hal.archives-ouvertes.fr/hal-02196345

,

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, pp.579-594, 2003.

M. Firat and G. J. Woeginger, Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh, Operations Research Letters, vol.39, pp.32-35, 2011.

,