{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T12:40:13Z","timestamp":1780663213291,"version":"3.54.1"},"reference-count":18,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T00:00:00Z","timestamp":1563926400000},"content-version":"vor","delay-in-days":23,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,5,30]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>The VIPAFLEET project consists in developing models and algorithms for managing a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distributed at specified stations in an industrial area to supply internal transportation, where the cars can be used in different modes of circulation (tram mode, elevator mode, taxi mode). One goal is to develop and implement suitable algorithms for each mode in order to satisfy all the requests under an economic point of view by minimizing the total tour length. The innovative idea and challenge of the project is to develop and install a dynamic fleet management system that allows the operator to switch between the different modes within the different periods of the day according to the dynamic transportation demands of the users. We model the underlying online transportation system and propose a corresponding fleet management framework, to handle modes, demands and commands. We consider two modes of circulation, tram and elevator mode, propose for each mode appropriate online algorithms and evaluate their performance, both in terms of competitive analysis and practical behavior.<\/jats:p>","DOI":"10.1051\/ro\/2018042","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T08:23:13Z","timestamp":1527754993000},"page":"1007-1031","source":"Crossref","is-referenced-by-count":4,"title":["Fleet management for autonomous vehicles: Online PDP under special constraints"],"prefix":"10.1051","volume":"53","author":[{"given":"Sahar","family":"Bsaybes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alain","family":"Quilliot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Annegret K.","family":"Wagler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"250","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"key":"R1","unstructured":"Ahuja R.K., Magnanti T.L. and Orlin J.B., 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\u2013602."},{"key":"R2","unstructured":"Ascheuer N., Krumke S.O. and Rambau J., Online dial-a-ride problems: minimizing the completion time. In: STACS 2000. Springer (2000) 639\u2013650."},{"key":"R3","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"Berbeglia","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"R4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1287\/ijoc.13.2.138.10517","volume":"13","author":"Blom","year":"2001","journal-title":"INFORMS J. Comput."},{"key":"R5","unstructured":"Borodin A. and El-Yaniv R., Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (2005)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"Cordeau","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"R7","first-page":"185","volume":"2013","author":"Deleplanque","year":"2013","journal-title":"Multi. Int. Scheduling Conf. Theory Appl. (MISTA)"},{"key":"R8","unstructured":"Easymile, available at: http:\/\/www.easymile.com (2015)."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Fabri A. and Recht P., Online dial-a-ride problem with time windows: an exact algorithm using status vectors. In: Operations Research Proceedings 2006. Springer (2007), 445\u2013450.","DOI":"10.1007\/978-3-540-69995-8_71"},{"key":"R10","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1051\/ro:2008021","volume":"42","author":"Labadi","year":"2008","journal-title":"RAIRO: OR"},{"key":"R11","unstructured":"Ligier group, available at: http:\/\/www.ligier.fr (2015)."},{"key":"R12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"Olariu","year":"1991","journal-title":"Info. Process. Lett."},{"key":"R13","unstructured":"Royer E., Bom J., Dhome M., Thuilot B., Lhuillier M. and Marmoiton F., Outdoor autonomous navigation using monocular vision, In: 2005 IEEE\/RSJ International Conference on Intelligent Robots and Systems, 2005 (IROS 2005). IEEE (2005) 1253\u20131258."},{"key":"R14","unstructured":"Royer E., Marmoiton F., Alizon S., Ramadasan D., Slade M., Nizard A., Dhome M., Thuilot B. and Bonjean F., Retour d\u2019exp\u00e9rience apr\u00e9s plus de 1000\u00a0km en navette sans conducteur guid\u00e9e par vision. RFIA2016 (2016)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1051\/ro\/2016048","volume":"50","author":"Solano-Charris","year":"2016","journal-title":"RAIRO: OR"},{"key":"R16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:1999101","volume":"33","author":"Taillard","year":"1999","journal-title":"RAIRO: OR"},{"key":"R17","unstructured":"Viam\u00e9ca, available at: http:\/\/www.viameca.fr (2015)."},{"key":"R18","unstructured":"Yan Z., Simulator for vipafleet management, Master thesis, ISIMA Institut Sup\u00e9rieur d\u2019Informatique de Mod\u00e9lisation et de leurs Applications, Clermont Ferrand, France (2016)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018042\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:33:39Z","timestamp":1584689619000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":18,"journal-issue":{"issue":"3"},"alternative-id":["ro170176"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018042","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}