Insights on Car Relocation Operations in One-Way Carsharing Systems

Abstract

One-way carsharing system is a mobility service that offers short-time car rental service for its users in an urban area. This kind of service is attractive since users can pick up a car from a station and return it to any other station unlike round-trip carsharing systems where users have to return the car to the same station of departure. Nevertheless, uneven users’ demands for cars and for parking places throughout the day poses a challenge on the carsharing operator to rebalance the cars in stations to satisfy the maximum number of users’ requests. We refer to a rebalancing operation by car relocation. These operations increase the cost of operating the carsharing system. As a result, optimizing these operations is crucial in order to reduce the cost of the operator. In this paper, the problem is modeled as an Integer Linear Programming model (ILP). Then we present three different car relocation policies that we implement in a greedy search algorithm. The comparison between the three policies shows that car relocation operations that do not consider future demands do not effectively decrease rejected demands. On the contrary, they can generate more rejected demands. Results prove that solutions provided by our greedy algorithm when using a good policy, are competitive with CPLEX solutions. Furthermore, adding stochastic modification on the input data proves that the results of the two presented approaches are highly affected by the input demand even after adding threshold values constraints.

Authors and Affiliations

Rabih Zakaria, Mohammad Dib, Laurent Moalic, Alexandre Caminada

Keywords

Related Articles

A Secure Network Communication Protocol Based on Text to Barcode Encryption Algorithm

Nowadays, after the significant development in the Internet, communication and information exchange around the world has become easier and faster than before. One may send an e-mail or perform money transaction (using a...

Efficient Load Balancing Algorithm for the Arrangement-Star Network

The Arrangement-Star is a well-known network in the literature and it is one of the promising interconnection networks in the area of super computing, it is expected to be one of the attractive alternatives in the future...

Building an Artificial Idiotopic Immune Model Based on Artificial Neural Network Ideology

In the literature, there were many research efforts that utilized the artificial immune networks to model their designed applications, but they were considerably complicated, and restricted to a few areas that such as co...

Scalable Scientific Workflows Management System SWFMS

In today’s electronic world conducting scientific experiments, especially in natural sciences domain, has become more and more challenging for domain scientists since “science” today has turned out to be more complex due...

Identifying and Extracting Named Entities from Wikipedia Database Using Entity Infoboxes

An approach for named entity classification based on Wikipedia article infoboxes is described in this paper. It identifies the three fundamental named entity types, namely; Person, Location and Organization. An entity cl...

Download PDF file
  • EP ID EP358604
  • DOI 10.14569/IJACSA.2018.090739
  • Views 70
  • Downloads 0

How To Cite

Rabih Zakaria, Mohammad Dib, Laurent Moalic, Alexandre Caminada (2018). Insights on Car Relocation Operations in One-Way Carsharing Systems. International Journal of Advanced Computer Science & Applications, 9(7), 281-290. https://europub.co.uk/articles/-A-358604