Open Access
| Issue |
RAIRO-Oper. Res.
Volume 53, Number 3, July-September 2019
ROADEF 2017
|
|
|---|---|---|
| Page(s) | 1007 - 1031 | |
| DOI | https://doi.org/10.1051/ro/2018042 | |
| Published online | 24 July 2019 | |
- R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network flows: theory, algorithms, and applications. In: Prentice-Hall, Englewood Cliffs, New Jersey, USA Arrow, KJ (1963). Social Choice and Individual Values, Wiley, New York. Gibbard, A.(1973). Manipulation of Voting Schemes: A general result, Econometrica. 41 (1993) 587–602. [Google Scholar]
- N. Ascheuer, S.O. Krumke and J. Rambau, Online dial-a-ride problems: minimizing the completion time. In: STACS 2000. Springer (2000) 639–650. [CrossRef] [Google Scholar]
- G. Berbeglia, J.-F. Cordeau and G. Laporte, Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202 (2010) 8–15. [Google Scholar]
- M. Blom, S.O. Krumke, W.E. de Paepe and L. Stougie, The online TSP against fair adversaries. INFORMS J. Comput. 13 (2001) 138–148. [Google Scholar]
- A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (2005). [Google Scholar]
- J.-F. Cordeau and G. Laporte, The dial-a-ride problem: models and algorithms. Ann. Oper. Res. 153 (2007) 29–46. [Google Scholar]
- S. Deleplanque and A. Quilliot, Transfers in the on-demand transportation: the DARPT Dial-a-Ride Problem with transfers allowed. Multi. Int. Scheduling Conf. Theory Appl. (MISTA) 2013 (2013) 185–205. [Google Scholar]
- Easymile, available at: http://www.easymile.com (2015). [Google Scholar]
- A. Fabri and P. Recht, Online dial-a-ride problem with time windows: an exact algorithm using status vectors. In: Operations Research Proceedings 2006. Springer (2007), 445–450. [Google Scholar]
- N. Labadi, C. Prins and M. Reghioui, A memetic algorithm for the vehicle routing problem with time windows. RAIRO: OR 42 (2008) 415–431. [CrossRef] [Google Scholar]
- Ligier group, available at: http://www.ligier.fr (2015). [Google Scholar]
- S. Olariu, An optimal greedy heuristic to color interval graphs. Info. Process. Lett. 37 (1991) 21–25. [CrossRef] [Google Scholar]
- E. Royer, J. Bom, M. Dhome, B. Thuilot, M. Lhuillier and F. Marmoiton, Outdoor autonomous navigation using monocular vision, In: 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2005 (IROS 2005). IEEE (2005) 1253–1258. [Google Scholar]
- E. Royer, F. Marmoiton, S. Alizon, D. Ramadasan, M. Slade, A. Nizard, M. Dhome, B. Thuilot and F. Bonjean, Retour d’expérience aprés plus de 1000 km en navette sans conducteur guidée par vision. RFIA2016 (2016). [Google Scholar]
- E.L. Solano-Charris, C. Prins and A. Cynthia Santos, Solving the bi-objective robust vehicle routing problem with uncertain costs and demands. RAIRO: OR 50 (2016) 689–714. [CrossRef] [Google Scholar]
- É.D. Taillard, A heuristic column generation method for the heterogeneous fleet vrp. RAIRO: OR 33 (1999) 1–14. [CrossRef] [Google Scholar]
- Viaméca, available at: http://www.viameca.fr (2015). [Google Scholar]
- Z. Yan, Simulator for vipafleet management, Master thesis, ISIMA Institut Supérieur d’Informatique de Modélisation et de leurs Applications, Clermont Ferrand, France (2016). [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.