L. Allulli, G. Ausiello, V. Bonifaci, and L. Laura, On the power of lookahead in on-line server routing problems, Excursions in Algorithmics: A Collection of Papers in Honor of Franco P. Preparata, pp.116-128, 2008.
DOI : 10.1016/j.tcs.2008.08.003

L. Allulli, G. Ausiello, and L. Laura, On the Power of Lookahead in On-Line Vehicle Routing Problems, Computing and Combinatorics, pp.728-736, 2005.
DOI : 10.1007/11533719_74

S. Angelopoulos, R. Dorrigiv, and A. López-ortiz, On the separation and equivalence of paging strategies, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '07, pp.229-237, 2007.

S. Angelopoulos and P. Schweitzer, Paging and list update under bijective analysis, J. ACM, vol.607, issue.2, pp.1-718, 2013.
DOI : 10.1145/2450142.2450143
URL : https://hal.archives-ouvertes.fr/hal-01185285

M. Antosiewicz, G. Koloch, and B. Kami?ski, Choice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: quality, uncertainty and speed, Journal of Theoretical and Applied Computer Science, vol.7, pp.46-55, 2013.

R. Arnold, V. C. Smith, J. Q. Doan, R. N. Barry, J. L. Blakesley et al., Reducing congestion and funding transportation using road pricing in europe and singapore, American Trade Initiatives, 2010.

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.1878

N. Ascheuer, S. O. Krumke, and J. Rambau, Online Dial-a-Ride Problems: Minimizing the Completion Time, Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, pp.639-650, 2000.
DOI : 10.1007/3-540-46541-3_53

J. Bachand-marleau, B. Lee, and A. El-geneidy, Towards a better understanding of the factors influencing the likelihood of using shared bicycle systems and frequency of use, Gregory Gutin, and Anders Yeo. When the greedy algorithm fails. Discrete Optimization, pp.66-71121, 2004.

N. Bansal, N. Buchbinder, A. Madry, and J. Naor, A polylogarithmiccompetitive algorithm for the k-server problem, FOCS, pp.267-276, 2011.

N. Bansal, N. Buchbinder, and J. , Metrical Task Systems and the k-Server Problem on HSTs, Automata, Languages and Programming, pp.287-298, 2010.
DOI : 10.1007/978-3-642-14165-2_25

Y. Bartal, A. Blum, C. Burch, and A. Tomkins, )-competitive algorithm for metrical task systems, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.711-719, 1997.
DOI : 10.1145/258533.258667
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.4094

S. Basu, Tabu Search Implementation on Traveling Salesman Problem and Its Variations: A Literature Survey, American Journal of Operations Research, vol.02, issue.02, pp.163-173, 2012.
DOI : 10.4236/ajor.2012.22019
URL : http://doi.org/10.4236/ajor.2012.22019

G. Veit-batz and P. Sanders, Time-Dependent Route Planning with Generalized Objective Functions, Lecture Notes in Computer Science, vol.7501, pp.169-180, 2012.
DOI : 10.1007/978-3-642-33090-2_16

L. Becchetti, S. Leonardi, A. Marchetti-spaccamela, G. Schäfer, and T. Vredeveld, Average case and smoothed competitive analysis of the multi-level feedback algorithm, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.462-471, 2003.
DOI : 10.1109/SFCS.2003.1238219

R. Bellman, On a routing problem, Quarterly of Applied Mathematics, vol.16, issue.1, pp.87-90, 1958.
DOI : 10.1090/qam/102435

S. Ben-david and A. Borodin, A new measure for the study of on-line algorithms, Algorithmica, vol.28, issue.2, pp.73-91, 1994.
DOI : 10.1007/BF01294264

M. Benchimol, P. Benchimol, B. Chappert, F. Arnaud-de-la-taille, F. Laroche et al., Balancing the stations of a self service ???bike hire??? system, RAIRO - Operations Research, vol.45, issue.1, pp.37-61, 2011.
DOI : 10.1051/ro/2011102
URL : https://hal.archives-ouvertes.fr/hal-00601443

T. Bendixson, . Marting, and . Richards, Witkar: Amsterdam's self-drive hire city car, Transportation, vol.5, issue.1, pp.63-72, 1976.
DOI : 10.1007/BF00165248

G. Berbeglia, J. Cordeau, and G. Laporte, Dynamic pickup and delivery problems, European Journal of Operational Research, vol.202, issue.1, pp.8-15, 2010.
DOI : 10.1016/j.ejor.2009.04.024
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.900

K. Berg-bergvinsdottir, J. Larsen, and R. M. Jørgensen, Solving the Dial-a-Ride Problem using Genetic algorithms, Informatics and Mathematical Modelling, 2004.

N. Biggs, E. K. Lloyd, and R. J. Wilson, Graph Theory, pp.1736-1936, 1986.

A. Billionnet, S. Elloumi, and A. Lambert, Linear Reformulations of Integer Quadratic Programs, MCO'08, 2nd international conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, pp.43-51, 2008.
DOI : 10.1007/BF02253896
URL : https://hal.archives-ouvertes.fr/hal-01125562

M. Bläser, K. Panagiotou, and B. V. Rao, A Probabilistic Analysis of Christofides??? Algorithm, Algorithm Theory -SWAT 2012, pp.225-236, 2012.
DOI : 10.1007/978-3-642-31155-0_20

M. Blom, S. O. Krumke, W. E. De-paepe, and L. Stougie, The Online TSP Against Fair Adversaries, INFORMS Journal on Computing, vol.13, issue.2, pp.138-148, 2001.
DOI : 10.1287/ijoc.13.2.138.10517
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.4445

A. Blum and J. Dunagan, Smoothed analysis of the perceptron algorithm for linear programming, Proc. of the 13th Annual ACM-SIAM Symp. on Discrete Algorithms, pp.905-914, 2002.

V. Bonifaci, M. Lipmann, and L. Stougie, Online multi-server dial-a-ride problems. other TUE -SPOR, 2006.

P. Borgnat, P. Abry, P. Flandrin, C. Robardet, J. Rouquier et al., SHARED BICYCLES IN A CITY: A SIGNAL PROCESSING AND DATA ANALYSIS PERSPECTIVE, Advances in Complex Systems, pp.1-24, 2011.
DOI : 10.1016/0377-0427(87)90125-7
URL : https://hal.archives-ouvertes.fr/ensl-00490325

P. Borgnat, C. Robardet, P. Abry, P. Flandrin, J. Rouquier et al., Dynamics On and Of Complex Networks Applications to Time-Varying Dynamical Systems, chapter A Dynamical Network View of Lyon's Vélo'v Shared Bicycle System, pp.267-284, 2013.

A. Borodin and R. El-yaniv, On Randomization in On-Line Computation, Information and Computation, vol.150, issue.2, pp.244-267, 1999.
DOI : 10.1006/inco.1998.2775
URL : http://doi.org/10.1006/inco.1998.2775

A. Borodin and R. El-yaniv, Online computation and competitive analysis, 1998.

J. Boyar and L. M. Favrholdt, The relative worst order ratio for online algorithms, ACM Transactions on Algorithms, vol.3, issue.2, 2007.
DOI : 10.1145/1240233.1240245

J. Boyar, S. Irani, and K. S. Larsen, A Comparison of Performance Measures for Online Algorithms, Algorithms and Data Structures, pp.119-130, 2009.
DOI : 10.1145/2786.2793

S. Bsaybes, S. O. Krumke, A. Quilliot, A. K. Wagler, and J. Wegener, Reopt: an algorithm with a quality guaranty for solving the static relocation problem

S. Bsaybes, A. Quilliot, A. K. Wagler, and J. Wegener, Two flow-based approaches for the static relocation problem in carsharing systems, 2015.

R. E. Burkard, V. G. Deineko, and G. J. Woeginger, The travelling salesman and the PQ-tree, Integer Programming and Combinatorial Optimization, pp.490-504, 1996.
DOI : 10.1007/3-540-61310-2_36

R. Wolfler, C. , and N. T. Moungla, A Matheuristic for the Dial-a-Ride Problem, Lecture Notes in Computer Science, vol.5, issue.1, pp.450-463, 2011.
DOI : 10.1007/s10288-007-0034-8

S. V. Casley, A. S. Jardim, and A. M. Quartulli, A study of public acceptance of autonomous cars. Interactive qualifying project, 2013.

P. Chalasani, R. Motwani, and A. Rao, Algorithms for robot grasp and delivery, 2nd International Workshop on Algorithmic Foundations of Robotics, 1996.

Y. Chang and L. Chen, Solve the vehicle routing problem with time windows via a genetic algorithm. Descrete and continous dynamical systems supplement, pp.240-249, 2007.

M. Charikar, S. Khuller, and B. Raghavachari, Algorithms for Capacitated Vehicle Routing, SIAM Journal on Computing, vol.31, issue.3, pp.665-682, 2001.
DOI : 10.1137/S0097539701392056
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.5103

D. Chemla, F. Meunier, and R. W. Calvo, Bike sharing systems: Solving the static rebalancing problem, Discrete Optimization, vol.10, issue.2, pp.120-146, 2013.
DOI : 10.1016/j.disopt.2012.11.005
URL : http://hal.archives-ouvertes.fr/docs/00/72/66/17/PDF/SVOCPDP_HAL.pdf

D. Chemla, F. Meunier, and T. Pradeau, Roberto Wolfler Calvo, and Houssame Yahiaoui. Self-service bike sharing systems: simulation, repositioning, pricing, 2013.

N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, 1976.

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

M. Chrobak, H. Karloff, T. Payne, and S. Vishwanathan, New results on server problems, In SIAM Journal on Discrete Mathematics, pp.291-300, 1990.
DOI : 10.1137/0404017

M. Chrobak and L. L. Larmore, Servers on Trees, SIAM Journal on Computing, vol.20, issue.1, pp.144-148, 1996.
DOI : 10.1137/0220008

C. Leandro, G. Coelho, and . Laporte, The exact solution of several classes of inventoryrouting problems, Computers & Operations Research, vol.40, issue.2, pp.558-565, 2013.

C. Contardo, C. Morency, and L. Rousseau, Balancing a dynamic public bikesharing system

D. Coppersmith, P. Doyle, P. Raghavan, and M. Snir, Random walks on weighted graphs, and applications to on-line algorithms (extended, Journal of the ACM, pp.369-378, 1990.
DOI : 10.1145/174130.174131
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.3774

J. Cordeau and G. Laporte, The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms, Quarterly Journal of the Belgian, French and Italian Operations Research Societies, vol.1, issue.2, 2002.
DOI : 10.1007/s10288-002-0009-8

J. Cordeau and G. Laporte, A tabu search heuristic for the static multi-vehicle dial-aride problem, 2002.

J. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.174, issue.1, pp.29-46, 2007.
DOI : 10.1007/978-1-4613-1361-8_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.490.5999

A. Coté, A. Meyerson, and L. Poplawski, Randomized k-server on hierarchical binary trees, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.227-234, 2008.
DOI : 10.1145/1374376.1374411

G. Dantzig, R. Fulkerson, and S. Johnson, Solution of a Large-Scale Traveling-Salesman Problem, Journal of the Operations Research Society of America, vol.2, issue.4, pp.393-410, 1954.
DOI : 10.1287/opre.2.4.393

G. B. Dantzig and J. H. Ramser, The Truck Dispatching Problem, Management Science, vol.6, issue.1, pp.80-91, 1959.
DOI : 10.1287/mnsc.6.1.80

G. B. Dantzig, Linear Programming and Extensions. Princeton landmarks in mathematics and physics, 1963.

R. Dechter and J. Pearl, Generalized best-first search strategies and the optimality af A*, Journal of the ACM, vol.32, issue.3, pp.505-536, 1985.
DOI : 10.1145/3828.3830

V. Deineko and A. Tiskin, Fast minimum-weight double-tree shortcutting for metric TSP, Journal of Experimental Algorithmics, vol.14, issue.6, pp.4-6, 2010.
DOI : 10.1145/1498698.1594232
URL : http://arxiv.org/pdf/0710.0318v1.pdf

S. Deleplanque and A. Quilliot, Insertion techniques and constraint propagation for the DARP. Federated conference on computer science and information systems, pp.393-400, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00919761

S. Deleplanque and A. Quilliot, Constraint Propagation for the Dial-a-Ride Problem with Split Loads, Recent Advances in Computational Optimization, pp.31-50, 2013.
DOI : 10.1007/978-3-319-00410-5_3
URL : https://hal.archives-ouvertes.fr/hal-00916491

X. Deng and S. Mahajan, Server problems and resistive spaces, Information Processing Letters, vol.37, issue.4, pp.193-196, 1991.
DOI : 10.1016/0020-0190(91)90187-M

M. Desrochers, J. Desrosiers, and M. Solomon, A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows, Operations Research, vol.40, issue.2, pp.342-354, 1992.
DOI : 10.1287/opre.40.2.342

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, vol.4, issue.1, pp.269-271, 1959.
DOI : 10.1007/BF01386390

R. Dorrigiv, Alternative Measures for the Analysis of Online Algorithms, 2010.

R. Dorrigiv and A. López-ortiz, A survey of performance measures for on-line algorithms, SIGACT News, vol.36, issue.3, pp.67-81, 2005.

. Ecoplan, World Carshare Cities Inventories. http://ecoplan.org/carshare/general/ cities.htm, pp.2014-2024, 2008.

M. El-zaher, B. Dafflon, F. Gechter, and J. Contet, Vehicle Platoon Control with Multi-configuration Ability, Procedia Computer Science, vol.9, issue.0, pp.1503-1512, 2012.
DOI : 10.1016/j.procs.2012.04.165

L. Epstein, L. M. Favrholdt, and J. S. Kohrt, Comparing online algorithms for bin packing problems, Journal of Scheduling, vol.51, issue.5, pp.13-21, 2012.
DOI : 10.1287/opre.51.5.759.16753
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.6681

C. Etienne and O. Latifa, Model-Based Count Series Clustering for Bike Sharing System Usage Mining: A Case Study with the V??lib??? System of Paris, ACM Transactions on Intelligent Systems and Technology, vol.5, issue.3, pp.1-39, 2014.
DOI : 10.1068/b32047

A. Fabri and P. Recht, Online dial-a-ride problem with time windows: An exact algorithm using status vectors [75] Joy Fang. Legal liability issues 'preventing mass adoption of self-driving cars'. http://www.todayonline.com/singapore/ legal-liability-issues-preventing-mass-adoption-self-driving-cars, Operations Research Proceedings, pp.445-450, 2006.

E. Feuerstein and L. Stougie, On-line single-server dial-a-ride problems, Theoretical Computer Science, vol.268, issue.1, pp.91-105, 2001.
DOI : 10.1016/S0304-3975(00)00261-9
URL : http://doi.org/10.1016/s0304-3975(00)00261-9

L. Marshall and . Fisher, Optimal solution of vehicle routing problems using minimum k-trees, Operations Research, vol.42, issue.4, pp.626-642, 1994.

L. R. Ford and J. , Network flow theory, 1956.

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3-5, 2009.
DOI : 10.1016/j.physrep.2009.11.002
URL : http://arxiv.org/pdf/0906.0612

J. Froehlich, J. Neumann, and N. Oliver, Measuring the pulse of the city through shared bicycle programs, Proceedings of the International Workshop on Urban, Community, and Social Applications of Networked Sensing Systems (UrbanSense08), 2008.

X. Gan, Y. Wang, S. Li, and B. Niu, Vehicle Routing Problem with Time Windows and Simultaneous Delivery and Pick-Up Service Based on MCPSO, Mathematical Problems in Engineering, vol.11, issue.2, 2012.
DOI : 10.1016/j.amc.2006.07.026
URL : http://doi.org/10.1155/2012/104279

M. Gendreau, A. Hertz, and G. Laporte, A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, vol.40, issue.10, pp.1276-1290, 1994.
DOI : 10.1287/mnsc.40.10.1276

P. Ian, T. Gent, and . Walsh, The TSP phase transition, Artificial Intelligence, vol.88, pp.105-109, 1996.

I. Fatma-pinar-goksal, F. Karaoglan, and . Altiparmak, A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery, Computers & Industrial Engineering, vol.65, issue.1, pp.39-53, 2013.
DOI : 10.1016/j.cie.2012.01.005

I. Li-gørtz, V. Nagarajan, and R. Ravi, Minimum makespan multi-vehicle dial-a-ride. CoRR, abs/1102, 2011.

J. Gudmundsson and C. Levcopoulos, A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation, Computing and Combinatorics, pp.473-482, 1999.
DOI : 10.1007/3-540-48686-0_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.2715

J. Gudmundsson, M. Van-kreveld, and G. Narasimhan, Region-restricted clustering for geographic data mining, Computational Geometry, vol.42, issue.3, pp.231-240, 2009.
DOI : 10.1016/j.comgeo.2008.08.003
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.2226

A. Gupte and S. Ahmed, Solving Mixed Integer Bilinear Problems Using MILP Formulations, SIAM Journal on Optimization, vol.23, issue.2, pp.721-744, 2013.
DOI : 10.1137/110836183
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.5694

G. Gutin and A. Yeo, Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number, Discrete Applied Mathematics, vol.119, issue.1-2, pp.107-116, 2002.
DOI : 10.1016/S0166-218X(01)00267-0

G. Gutin, A. Yeo, and A. Zverovich, Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP, Discrete Applied Mathematics, vol.117, pp.1-381, 2002.

Z. Haider, A. Nikolaev, J. E. Kang, and C. Kwon, Inventory rebalancing through pricing in public bike sharing systems Article under Review, 2014.

P. Halffmann, S. O. Krumke, A. Quilliot, A. K. Wagler, and J. Wegener, On the online max-accept relocation problem, Procedings of 6th International Workshop on Freight Transportation and Logistics, p.2015, 2015.
DOI : 10.1016/j.endm.2015.07.047

P. Halffmann, S. O. Krumke, A. Quilliot, A. K. Wagler, and J. Wegener, On the Online Min-Wait Relocation Problem, Electronic Notes in Discrete Mathematics, vol.50
DOI : 10.1016/j.endm.2015.07.047

K. Helsgaun, An effective implementation of k-opt moves for the Lin-Kernighan TSP, p.109, 2006.

B. Hiller and T. Vredeveld, Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison, Algorithms -ESA 2008, pp.528-539, 2008.
DOI : 10.1007/978-3-540-87744-8_44

B. Hunsaker, M. Savelsbergh, and M. Wagner, Efficient feasibility testing for dial-a-ride problems, Operations Research Letters, vol.30, issue.3, pp.169-173, 2002.
DOI : 10.1016/S0167-6377(02)00120-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.6026

S. Jain and P. Van-hentenryck, Large Neighborhood Search for Dial-a-Ride Problems, Principles and Practice of Constraint Programming ? CP 2011, pp.400-413, 2011.
DOI : 10.1287/trsc.31.1.60

S. David, G. Johnson, . Gutin, A. Lyle, A. Mcgeoch et al., Experimental analysis of heuristics for the atsp, The traveling salesman problem and its variations, pp.445-487, 2007.

S. David, . Johnson, A. Lyle, and . Mcgeoch, The traveling salesman problem: A case study in local optimization. Local search in combinatorial optimization, pp.215-310, 1997.

N. Jozefowiez, F. Glover, and M. Laguna, Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits, Journal of Mathematical Modelling and Algorithms, vol.6, issue.2, pp.177-195, 2008.
DOI : 10.1007/s002910000046

C. Kenyon, Best-fit bin-packing with random order, Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '96, pp.359-364, 1996.

B. Kidd, Free Bicycle Sharing in Japan Runs Into Problems. http://www. tokyobybike.com/2013/06/free-bicycle-sharing-in-japan-runs-into.html, pp.2014-2023, 2013.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.7607

S. Koenig, M. Likhachev, Y. Liu, and D. Furcy, Incremental heuristic search in ai, AI Mag, vol.25, issue.2, pp.99-112, 2004.

E. Koutsoupias and C. Papadimitriou, On the k-server conjecture, Journal of the ACM, vol.42, pp.507-511, 1995.
DOI : 10.1145/195058.195245

S. O. Krumke, Online Optimization: Competitive Analysis and Beyond. Habilitationsschrift, 2002.

S. O. Krumke, L. Laura, M. Lipmann, A. Marchetti-spaccamela, W. E. De-paepe et al., Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem, Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, volume 2462 of Lecture Notes in Computer Science, pp.200-214, 2002.

S. O. Krumke, A. Quilliot, A. K. Wagler, and J. Wegener, Relocation in Carsharing Systems Using Flows in Time-Expanded Networks, Experimental Algorithms, pp.87-98, 2014.
DOI : 10.1007/978-3-319-07959-2_8
URL : https://hal.archives-ouvertes.fr/hal-00908242

S. O. Krumke, A. Quilliot, A. K. Wagler, and J. Wegener, Models and Algorithms for Carsharing Systems and Related Problems, Electronic Notes in Discrete Mathematics, vol.44, issue.0, pp.44201-206, 2013.
DOI : 10.1016/j.endm.2013.10.031

K. Labadi, T. Benarbia, S. Hamaci, and A. Darcherif, Petri nets models for analysis and control of public bicycle-sharing systems. Petri Nets -Manufacturing and Computer Science, 2012.

A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato, Finding Statistically Significant Communities in Networks, PLoS ONE, vol.81, issue.4, 1012.
DOI : 10.1371/journal.pone.0018961.s001
URL : http://doi.org/10.1371/journal.pone.0018961

M. Hoong-chuin-lau, K. Sim, and . Teo, Vehicle routing problem with time windows and a limited number of vehicles, European Journal of Operational Research, vol.148, issue.3, pp.559-569, 2003.

L. Liberti, Compact linearization for binary quadratic problems, 4OR, vol.68, issue.10, pp.231-245, 2007.
DOI : 10.1007/978-1-4613-1379-3

J. Lin, T. Yang, and Y. Chang, A hub location inventory model for bicycle sharing system design: Formulation and solution, Computers & Industrial Engineering, vol.65, issue.1, pp.77-86, 2013.
DOI : 10.1016/j.cie.2011.12.006

L. Lovász, Random walks on graphs: A survey, Combinatorics, Paul Erd?s is Eighty, pp.353-398, 1996.

D. R. Mallampati, P. P. Mutalik, and R. L. Wainwright, A parallel multi-phase implementation of simulated annealing for the traveling salesman problem The Sixth, Distributed Memory Computing Conference, pp.488-491, 1991.

M. Manasse, L. Mcgeoch, and D. Sleator, Competitive algorithms for on-line problems, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pp.322-333, 1988.
DOI : 10.1145/62212.62243

A. Misevi?ius, A. Lenkevicius, and D. Rubliauskas, Iterated tabu search: an improvement to standard tabu search, Information Technology and Control, vol.35, issue.3, pp.187-197, 2006.

A. Misevi?ius, J. Smolinskas, and A. Tomkevi?ius, Iterated tabu search for the traveling salesman problem, Information Technology and Control, vol.34, issue.4, pp.327-337, 2005.

F. Edward and . Moore, The shortest path through a maze, Proc. Internat. Sympos. Switching Theory 1957, Part II, pp.285-292, 1959.

E. Murphy and J. Usher, An analysis of the role of bicycle-sharing in a European city : the case of Dublin, Irish Transport Research Network, 2011.

R. Nair, E. Miller-hooks, R. C. Hampshire, and A. Bu?i?, Large-Scale Vehicle Sharing Systems: Analysis of V??lib', International Journal of Sustainable Transportation, vol.45, issue.2, pp.85-106, 2013.
DOI : 10.3141/1887-15

O. Eoin, D. Mahony, and . Shmoys, Data analysis and optimization for (citi)bike sharing [127] Feargus O'Sullivan. In Paris, thefts and vandalism could force bike-share to shrinkthefts-and-vandalism-could-force-bike-share-shrink, Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp.2014-2021, 2013.

C. H. Papadimitriou, The Euclidean travelling salesman problem is NP-complete, Theoretical Computer Science, vol.4, issue.3, pp.237-244, 1977.
DOI : 10.1016/0304-3975(77)90012-3
URL : http://doi.org/10.1016/0304-3975(77)90012-3

S. D. Parkes, G. Marsden, S. A. Shaheen, and A. P. Cohen, Understanding the diffusion of public bikesharing systems: evidence from Europe and North America, Journal of Transport Geography, vol.31, pp.94-103, 2013.
DOI : 10.1016/j.jtrangeo.2013.06.003

R. C. Prim, Shortest Connection Networks And Some Generalizations, Bell System Technical Journal, vol.36, issue.6, pp.1389-1401, 1957.
DOI : 10.1002/j.1538-7305.1957.tb01515.x

M. Rainer-harbach, P. Papazek, B. Hu, and G. R. , Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach, Lecture Notes in Computer Science, vol.7832, pp.121-132, 2013.
DOI : 10.1007/978-3-642-37198-1_11

A. Rau and D. Bongardt, Facts and figures on transport, GTZ Transport Policy Advisory Service, 2010.

A. Bakar, S. Saman, and I. Abdramane, Solving a reconfigurable maze using hybrid wall follower algorithm, International Journal of Computer Applications, vol.82, issue.3, pp.22-26, 2013.

G. Schäfer and N. Sivadasan, Topology matters: Smoothed competitiveness of metrical task systems, Theoretical Computer Science, vol.341, issue.1-3, pp.216-246, 2005.
DOI : 10.1016/j.tcs.2005.04.006

B. Schoettle and M. Sivak, A survey of public opinion about autonomous and self-driving vehicles in the U, 2014.

A. Schrijver, Theory of Linear and Integer Programming Wiley Series in Discrete Mathematics & Optimization, 1998.

J. Schuijbroek, R. Hampshire, and W. Van-hoeve, Inventory rebalancing and vehicle routing in bike sharing systems, European Journal of Operational Research, vol.257, issue.3, 2013.
DOI : 10.1016/j.ejor.2016.08.029
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.2791

S. Shaheen, D. Sperling, and C. Wagner, Carsharing and Partnership Management: An International Perspective, Transportation Research Record: Journal of the Transportation Research Board, vol.1666, pp.118-124, 1666.
DOI : 10.3141/1666-14

A. Susan, A. P. Shaheen, and . Cohen, Worldwide carsharing growth: An international comparison The text is part of a series Institute of Transportation Studies (UCD), 2008.

S. A. Shaheen, S. Guzman, and H. Zhang, Bikesharing in Europe, the Americas, and Asia, Transportation Research Record: Journal of the Transportation Research Board, vol.2143, pp.159-167, 2010.
DOI : 10.3141/2143-20

S. A. Shaheen, D. Sperling, and C. Wagner, A short history of carsharing in the 90's. World Transport Policy and Practice, 1999.

K. Sharma and C. Munshi, A comprehensive and comparative study of mazesolving techniques by implementing graph theory, IOSR Journal of Computer Engineering (IOSR-JCE)Ver. IV), vol.17, issue.1, pp.24-29, 2015.

R. El-shawi, J. Gudmundsson, and C. Levcopoulos, Quickest path queries on transportation network, Computational Geometry, vol.47, issue.7, 2010.
DOI : 10.1016/j.comgeo.2014.01.004

D. Daniel, R. E. Sleator, and . Tarjan, Amortized efficiency of list update and paging rules, Commun. ACM, vol.28, issue.2, pp.202-208, 1985.

A. Daniel and . Spielman, Lecture notes in spectral graph theory, 2009.

A. Daniel, S. Spielman, and . Teng, Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time, 2001.

A. Daniel, S. Spielman, and . Teng, Smoothed analysis, Algorithms and Data Structures, pp.256-270, 2003.

A. Srebro, Fault-tolerant algorithm for a mobile robot solving a maze. Challenges of Modern Technology, pp.21-29, 2013.

K. C. Tan, L. H. Lee, and K. Ou, Artificial intelligence heuristics in solving vehicle routing problems with time window constraints, Engineering Applications of Artificial Intelligence, vol.14, issue.6, pp.825-837, 2001.
DOI : 10.1016/S0952-1976(02)00011-8

K. C. Tan, L. H. Lee, Q. L. Zhu, and K. Ou, Heuristic methods for vehicle routing problem with time windows, Artificial Intelligence in Engineering, vol.15, issue.3, pp.281-295, 2001.
DOI : 10.1016/S0954-1810(01)00005-X
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.4339

O. Tange, Gnu parallel -the command-line power tool. ;login: The USENIX Magazine, pp.42-47, 2011.

P. Toth and D. Vigo, Heuristic Algorithms for the Handicapped Persons Transportation Problem, Transportation Science, vol.31, issue.1, pp.60-71, 1997.
DOI : 10.1287/trsc.31.1.60

D. Tali-eilam-tzoreff, F. Granot, G. Granot, and . So?i?, The vehicle routing problem with pickups and deliveries on some special graphs, Discrete Applied Mathematics, vol.116, issue.3, pp.193-229, 2002.
DOI : 10.1016/S0166-218X(00)00283-3

F. Yi and L. Tian, On the Online Dial-A-Ride Problem with Time-Windows, Algorithmic Applications in Management: First International Conference, AAIM 2005, pp.85-94, 2005.
DOI : 10.1007/11496199_11

B. Yu, H. Zhu, W. Cai, N. Ma, Q. Kuang et al., Two-phase optimization approach to transit hub location ??? the case of Dalian, Journal of Transport Geography, vol.33, issue.0, pp.62-71, 2013.
DOI : 10.1016/j.jtrangeo.2013.09.008

J. Yu, Y. Liu, G. Chang, W. Ma, and X. Yang, Cluster-Based Hierarchical Model for Urban Transit Hub Location Planning, Transportation Research Record: Journal of the Transportation Research Board, vol.2112, pp.8-16, 2009.
DOI : 10.3141/2112-02

A. Yurtkuran and E. Emel, A new Hybrid Electromagnetism-like Algorithm for capacitated vehicle routing problems, Expert Systems with Applications, vol.37, issue.4, pp.3427-3433, 2010.
DOI : 10.1016/j.eswa.2009.10.005