An iterative algorithm for the management of an electric car-rental service

15Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The management of a car-rental service becomes more complex as long as one-way bookings between different depots are accepted. These bookings can increase the operational costs due to the necessity of moving vehicles from one depot to another by the company staff in order to attend previously accepted bookings. We present an iterative model based on flows on networks for the acceptance of bookings by a car-rental service that permits one-way reservations. Our model lets us also recover the movement of the fleet of vehicles between the depots over the time. In addition, it also permits including restrictions on the amount of cars managed at every single depot. These results can be of interest for an electric car-rental service that operates at different depots within a city or region. © 2014 J. Alberto Conejero et al.

Cite

CITATION STYLE

APA

Conejero, J. A., Jordán, C., & Sanabria-Codesal, E. (2014). An iterative algorithm for the management of an electric car-rental service. Journal of Applied Mathematics, 2014. https://doi.org/10.1155/2014/483734

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free