Insights on Car Relocation Operations in One-Way Carsharing Systems
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2018, Vol 9, Issue 7
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
- EP ID EP358604
- DOI 10.14569/IJACSA.2018.090739
- Views 88
- Downloads 0
Depth Limitation and Splitting Criteria Optimization on Random Forest for Efficient Human Activity Classification
Random Forest (RF) is known as one of the best classifiers in many fields. They are parallelizable, fast to train and to predict, robust to outlier, handle unbalanced data, have low bias, and moderate variance. Apart fro...
Design and Simulation of a Low-Voltage Low-Offset Operational Amplifier
In many applications, offset of the OP-AMPs should be canceled to high accuracy be accomplished. In this work, an asymmetrical differential input circuit with active DC offset rejection circuit was implemented to minimiz...
Performance Comparison between Merge and Quick Sort Algorithms in Data Structure
In computer science field, one of the basic operation is sorting. Many sorting operations use intermediate steps. Sorting is the procedure of ordering list of elements in ascending or descending with the help of key valu...
Studies and a Method to Minimize and Control the Jitter in Optical Based Communication System
In the years, optical communication systems have been using significantly for attractive solutions to the increasing high data rate in telecommunication systems and various other applications. In the present days mostly,...
Scheduling of Distributed Algorithms for Low Power Embedded Systems
Recently, the advent of embedded multicore processors has created interesting technologies for power management. Systems consisting of low-power and high-efficient cores create new possibilities for the optimization of p...