, Network flows: theory, algorithms, and applications, 1993.
On the power of lookahead in on-line vehicle routing problems, COCOON, pp.728-736, 2005. ,
Teodor Gabriel Crainic, and Roar Grønhaug. Branch and price for service network design with asset management constraints, Transportation Science, vol.45, issue.1, pp.33-49, 2011. ,
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. ,
Certification of an optimal tsp tour through 85,900 cities, Operations Research Letters, vol.37, issue.1, pp.11-15, 2009. ,
A survey of dynamic network flows, Annals of Operations Research, vol.20, issue.1, pp.1-66, 1989. ,
Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems, J. ACM, vol.45, issue.5, pp.753-782, 1998. ,
Competitive scheduling of elevators, 1998. ,
Online dial-a-ride problems: Minimizing the completion time, STACS 2000, pp.639-650, 2000. ,
Routing and scheduling of vehicles and crews, Computers & Operations Research, vol.10, issue.2, pp.63-211, 1983. ,
Efficient solutions to some transportation problems with applications to minimizing robot arm travel, SIAM Journal on Computing, vol.17, issue.5, pp.849-869, 1988. ,
On-line algorithms, real time, the virtue of laziness, and the power of clairvoyance, Lecture notes in computer science, vol.3959, issue.1, 2006. ,
The on-line asymmetric traveling salesman problem, WADS, pp.306-317, 2005. ,
Algorithms for the on-line quota traveling salesman problem, Computing and Combinatorics, pp.290-299, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00004070
, Serving requests with on-line routing. Algorithm Theory-SWAT'94, pp.37-48, 1994.
Algorithms for the on-line travelling salesman, Algorithmica, vol.29, issue.4, pp.560-581, 2001. ,
Social networks, mobility biographies, and travel: survey challenges. Environment and Planning B: Planning and design, vol.35, pp.981-996, 2008. ,
A genetic algorithm for the vehicle routing problem, Computers & Operations Research, vol.30, issue.5, pp.787-800, 2003. ,
A polylogarithmic-competitive algorithm for the k-server problem, FOCS, pp.267-276, 2011. ,
Seffi) Naor. Metrical task systems and the k-server problem on HSTs, Automata, Languages and Programming, vol.6198, pp.287-298, 2010. ,
A polylog(n)-competitive algorithm for metrical task systems, Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, STOC '97, pp.711-719, 1997. ,
Hannemann, thomas pajor, peter sanders, dorothea wagner, and renato f. werneck. route planning in transportation networks, 2014. ,
Static pickup and delivery problems: a classification scheme and survey, Top, vol.15, pp.1-31, 2007. ,
Dynamic pickup and delivery problems, European journal of operational research, vol.202, issue.1, pp.8-15, 2010. ,
Solving the Dial-a-Ride Problem using Genetic algorithms. Informatics and Mathematical Modelling, 2004. ,
, Graph Theory, pp.1736-1936, 1976.
Tight bounds for online tsp on the line, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.994-1005, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01549685
The online TSP against fair adversaries, INFORMS Journal on Computing, vol.13, issue.2, pp.138-148, 2001. ,
The continuous-time service network design problem, Operations Research, 2017. ,
Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks, International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp.254-262, 2017. ,
Online k-server routing problems, Lecture Notes in Computer Science, vol.4368, pp.83-94, 2006. ,
Online algorithms and competitive analysis, 1998. ,
An optimization framework for the development of efficient one-way car-sharing systems, European Journal of Operational Research, vol.240, issue.3, pp.718-733, 2015. ,
The travelling salesman and the PQ-tree, Integer Programming and Combinatorial Optimization, vol.1084, pp.490-504, 1996. ,
A matheuristic for the diala-ride problem, INOC, Lecture Notes in Computer Science, pp.450-463, 2011. ,
Solve the vehicle routing problem with time windows via a genetic algorithm. Descrete and continous dynamical systems supplement, pp.240-249, 2007. ,
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, Mathematical Programming, vol.20, issue.1, pp.255-282, 1981. ,
New results on server problems, In SIAM Journal on Discrete Mathematics, pp.291-300, 1990. ,
An optimal on-line algorithm for k servers on trees, SIAM Journal on Computing, vol.20, pp.144-148, 1996. ,
Scheduling of vehicles from a central depot to a number of delivery points, Operations research, vol.12, issue.4, pp.568-581, 1964. ,
The exact solution of several classes of inventory-routing problems, Computers & Operations Research, vol.40, issue.2, pp.558-565, 2013. ,
Random walks on weighted graphs, and applications to on-line algorithms (extended, Journal of the ACM, pp.369-378, 1990. ,
A branch-and-cut algorithm for the dial-a-ride problem, Operations Research, vol.54, issue.3, pp.573-586, 2006. ,
The dial-a-ride problem (DARP): Variants, modeling issues and algorithms, Quarterly Journal of the Belgian, vol.1, issue.2, pp.89-101, 2003. ,
A tabu search heuristic for the static multi-vehicle dial-a-ride problem, Transportation Research Part B: Methodological, vol.37, issue.6, pp.579-594, 2003. ,
The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol.153, issue.1, pp.29-46, 2007. ,
Randomized k-server on hierarchical binary trees, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC '08, pp.227-234, 2008. ,
Service network design with resource constraints, Transportation Science, vol.50, issue.4, pp.1380-1393, 2014. ,
The truck dispatching problem, Management Science, vol.6, issue.1, pp.80-91, 1959. ,
The role of well-being in transport policy, Transport Policy, vol.23, pp.25-33, 2012. ,
Insertion techniques and constraint propagation for the darp, FEDERATED CONFERENCE ON COMPUTER SCIENCE AND INFORMATION SYSTEMS-WCO 2012, vol.2012, pp.393-400, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00919761
Robustness tools in dynamic dial-a-ride problems, Recent Advances in Computational Optimization -Results of the Workshop on Computational Optimization WCO 2013, pp.35-51, 2013. ,
Transfers in the on-demand transportation: the DARPT Dial-a-Ride Problem with transfers allowed, Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA), number 2013, pp.185-205, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00917197
Server problems and resistive spaces, Information Processing Letters, vol.37, issue.4, pp.193-196, 1991. ,
A new optimization algorithm for the vehicle routing problem with time windows, Operations Research, vol.40, issue.2, pp.342-354, 1992. ,
Improved load plan design through integer programming based local search, Transportation Science, vol.47, issue.3, pp.412-427, 2013. ,
Online dial-a-ride problem with time windows: an exact algorithm using status vectors, Operations Research Proceedings, pp.445-450, 2006. ,
Online dial-a-ride problem with time windows: An exact algorithm using status vectors, Operations Research Proceedings, pp.445-450, 2006. ,
On-line single-server dial-a-ride problems, Theoretical Computer Science, vol.268, issue.1, pp.91-105, 2001. ,
Optimal solution of vehicle routing problems using minimum k-trees, Operations Research, vol.42, issue.4, pp.626-642, 1994. ,
Flows in networks princeton university press, 1962. ,
Constructing maximal dynamic flows from static flows, Operations research, vol.6, issue.3, pp.419-433, 1958. ,
Nonpreemptive ensemble motion planning on a tree, Journal of Algorithms, vol.15, issue.1, pp.29-60, 1993. ,
Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on mcpso, Mathematical Problems in Engineering, vol.2012, 2012. ,
A tabu search heuristic for the vehicle routing problem, Management Science, vol.40, issue.10, pp.1276-1290, 1994. ,
Sequencing a one state-variable machine: A solvable case of the traveling salesman problem, Operations research, vol.12, issue.5, pp.655-679, 1964. ,
A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery, Computers and Industrial Engineering, vol.65, issue.1, pp.39-53, 2013. ,
, Algorithmic graph theory and perfect graphs, 2004.
Generalized maximum flows over time, International Workshop on Approximation and Online Algorithms, pp.247-260 ,
, , 2011.
Routing a vehicle of capacity greater than one, Discrete Applied Mathematics, vol.81, issue.1-3, pp.41-57, 1998. ,
A fast approximation algorithm for TSP with neighborhoods and red-blue separation, Computing and Combinatorics, vol.1627, pp.473-482, 1999. ,
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. ,
Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP, Discrete Applied Mathematics, vol.117, issue.1-3, pp.81-86, 2002. ,
Multicommodity flows over time: Efficient algorithms and complexity, Theoretical Computer Science, vol.379, issue.3, pp.387-404, 2007. ,
Scheduling semiconductor burn-in operations to minimize total flowtime, Operations research, vol.45, issue.6, pp.874-885, 1997. ,
Linear inequalities and related systems, Annals of Mathematics Studies, pp.223-246, 1956. ,
A linear programming approach for the traveling salesman problem, 1973. ,
Efficient feasibility testing for dial-a-ride problems, Operations Research Letters, vol.30, issue.3, pp.169-173, 2002. ,
The family of vehicle routing problems, Vehicle Routing: Problems, Methods, and Applications, vol.18, pp.1-36, 2014. ,
Online routing problems: value of advanced information as improved competitive ratios, Transportation Science, vol.40, issue.2, 2006. ,
Online vehicle routing problems: A survey. The Vehicle Routing Problem: Latest Advances and New Challenges, pp.221-237, 2008. ,
Principles and Practice of Constraint Programming -CP, Lecture Notes in Computer Science, vol.6876, pp.400-413, 2011. ,
Large-scale, less-thantruckload service network design, Operations Research, vol.57, issue.3, pp.609-625, 2009. ,
Multi-objective metaheuristics for the traveling salesman problem with profits, Journal of Mathematical Modelling and Algorithms, vol.7, issue.2, pp.177-195, 2008. ,
Reducibility among combinatorial problems, In Complexity of computer computations, pp.85-103, 1972. ,
Continuous and discrete flows over time, Mathematical Methods of Operations Research, vol.73, issue.3, p.301, 2011. ,
On the k-server conjecture, Journal of the ACM, vol.42, pp.507-511, 1995. ,
Non-abusiveness helps: An O(1)-competitive algorithm for minimizing the maximum flow time in the online traveling salesman problem, Proceedings of the 5th, vol.2462, pp.200-214, 2002. ,
Models and algorithms for carsharing systems and related problems, Proceedings of the VII Latin-American Algorithms, Graphs, and Optimization Symposium, 2013. ,
Online optimization: Competitive analysis and beyond, 2006. ,
Relocation in carsharing systems using flows in time-expanded networks, International Symposium on Experimental Algorithms, pp.87-98, 2014. ,
The vehicle routing problem: An overview of exact and approximate algorithms, European journal of operational research, vol.59, issue.3, pp.345-358, 1992. ,
Exact algorithms for the vehicle routing problem, North-Holland Mathematics Studies, vol.132, pp.147-184, 1987. ,
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. ,
The online traveling salesman problem on the line, 1999. ,
A rejected-reinsertion heuristic for the static diala-ride problem, Transportation Research Part B: Methodological, vol.41, issue.7, pp.736-755, 2007. ,
Combinatorial optimization and vehicle fleet planning: Perspectives and prospects, Networks, vol.11, issue.2, pp.179-213, 1981. ,
Competitive algorithms for on-line problems, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC '88, pp.322-333, 1988. ,
, Das botenproblem. Ergebnisse eines mathematischen kolloquiums, vol.2, pp.11-12, 1932.
An optimal greedy heuristic to color interval graphs, Information Processing Letters, vol.37, issue.1, pp.21-25, 1991. ,
A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM review, vol.33, issue.1, pp.60-100, 1991. ,
The euclidean travelling salesman problem is npcomplete, Theoretical Computer Science, vol.4, issue.3, pp.237-244, 1977. ,
A survey on pickup and delivery models part ii: Transportation between pickup and delivery locations, Journal für Betriebswirtschaft, vol.58, issue.2, pp.81-117, 2008. ,
A survey on pickup and delivery problems, Journal für Betriebswirtschaft, vol.58, issue.1, pp.21-51, 2008. ,
Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles, European Journal of Operational Research, vol.257, issue.2, pp.601-613, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01708139
Stochastic and dynamic networks and routing. Handbooks in operations research and management science, vol.8, pp.141-295, 1995. ,
The geography of transport systems, 2016. ,
Retour d'expérience après plus de 1000 km en navette sans conducteur guidée par vision ,
Outdoor autonomous navigation using monocular vision, IEEE/RSJ International Conference on, pp.1253-1258, 2005. ,
URL : https://hal.archives-ouvertes.fr/hal-00118546
On-line file caching, Proc. 9th ACM-SIAM SODA, pp.82-86, 1988. ,
An introduction to network flows over time, Research trends in combinatorial optimization, pp.451-482, 2009. ,
Amortized efficiency of list update and paging rules, Communications of the ACM, vol.28, issue.2, pp.202-208, 1985. ,
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. ,
Heuristic methods for vehicle routing problem with time windows, Artificial Intelligence in Engineering, vol.15, issue.3, pp.281-295, 2001. ,
Heuristic algorithms for the handicapped persons transportation problem, Transportation Science, vol.31, issue.1, pp.60-71, 1997. ,
Decisions under uncertainty II. ISIMA, 2016. ,
de paepe, jan karel lenstra, jiri sgall, rené a. sitters, leen stougie, computer-aided complexity classification of dial-a-ride problems, INFORMS Journal on Computing, vol.16, issue.2, pp.120-132, 2004. ,
Public health benefits of strategies to reduce greenhouse-gas emissions: urban land transport, The Lancet, vol.374, issue.9705, pp.1930-1943, 2009. ,
Simulator for vipafleet management, 2016. ,
On the online dial-a-ride problem with time-windows, Algorithmic Applications in Management: First International Conference, AAIM 2005, vol.3521, pp.85-94, 2005. ,
A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems, Expert Syst. Appl, vol.37, issue.4, pp.3427-3433, 2010. ,