This paper investigates the optimization of Reservation-based Autonomous Car Sharing (RACS) systems, aiming at minimizing the total vehicle travel time and customer waiting time. Thus, the RACS system and its routing are formulated with a consideration for system efficiency and passengers’ concerns. A meta-heuristic Tabu search method is investigated as a solution approach, in combination with K–Means (KMN–Tabu) or K–Medoids (KMD–Tabu) clustering algorithms. The proposed solution algorithms are tested in two different networks of varying complexity, and the performance of the algorithms is evaluated. The evaluation results show that the TS method is more suitable for small-scale problems, while KMD–Tabu is suitable for large-scale problems. However, KMN-Tabu has the least computation time, although the solution quality is lower.
Clustered tabu search optimization for reservation-based shared autonomous vehicles
Transportation Letters ; 14 , 2 ; 124-128
2022-02-07
5 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Unbekannt
A congestion-aware Tabu search heuristic to solve the shared autonomous vehicle routing problem
Taylor & Francis Verlag | 2021
|Structural Weight Optimization with Tabu Search
British Library Conference Proceedings | 2006
|Structural Weight Optimization with Tabu Search
British Library Conference Proceedings | 2006
|Shared Autonomous Vehicles Ontology
Springer Verlag | 2022
|