Layered Network Oriented Approaches for Vehicle Relocation Problems

Managing a one-way vehicle sharing system means periodically moving free access vehicles from excess to deficit stations in order to avoid local shortages. While putting here the stress on routes followed by the vehicles while being exchanged between excess and deficit stations, we propose and study models and algorithmic approaches for a preemptive version of this problem which involves carrier riding cost, vehicle riding time and carrier number minimization. These approaches are based on the use of Layered Network.