Share mobility is starting to gain popularity since recent years. It represents a transportation mode which contributes to reducing city traffic, congestion, and pollution problems. The new emerging transportation mode, shared autonomous vehicles, would help to overcome the limitations of the current vehicle sharing systems since it combines features of on-demand and short-term rentals with self-driving capabilities.
The thesis proposed an optimization model for reservation based car sharing (RACS) system by applying the concept of autonomous vehicle sharing chain (AVS Chain). Firstly, the RACS system and its routing optimization procedure based on the AVS Chain concept were defined. Then, the RACS system was formulated in terms of a mixed integer programming (MIP) problem. Since the problem denotes as a combinatorial optimization which is NP hardness, in order to obtain feasible solutions, meta-heuristic method of Tabu search and in combination with K-Means or K-Medoids clustering algorithms were applied. After that, the proposed model was validated by testing in different networks with small to large scale of real life travel demands. Furthermore, the performance and feasibility of the algorithms were evaluated.
The proposed AVS Chain model aims to minimize the AV travel time/cost and customer waiting time, taking both transportation systems efficiency and passengers’ concern into account. It can be applied to transport networks of cities with small to large travel demands.
«
Share mobility is starting to gain popularity since recent years. It represents a transportation mode which contributes to reducing city traffic, congestion, and pollution problems. The new emerging transportation mode, shared autonomous vehicles, would help to overcome the limitations of the current vehicle sharing systems since it combines features of on-demand and short-term rentals with self-driving capabilities.
The thesis proposed an optimization model for reservation based car sharing (R...
»
Login
BibTeX