Application of parallel tabu search in solving Ride-sharing problem with HOV Lanes

Y. L. Hanifa, Y. Satria, H. Burhan

Research output: Contribution to journalConference articlepeer-review


Ride-sharing can be defined as a system where travelers can share their vehicles and travel cost with others who have a similar destination and time schedule. Ride-sharing problem with High Occupancy Vehicle (HOV) Lanes is a problem of finding an optimal route to serve costumer demand where each demand and vehicle consists of origin and destination point, and some of the route are restricted-use freeways lanes reserved for vehicles with more than a predetermined number of occupants, which called HOV lanes. With the use of ride-sharing and HOV Lanes, it is expected to reduce the number of the vehicles thus will mitigate the congestion. The optimal solution is the one with minimum number of total distance, passenger's ride time, and cost. This study discusses the application of insertion heuristic and parallel tabu search to optimize the use of Ride-sharing with HOV Lanes. Insertion heuristic is applied to obtain an initial solution and parallel tabu search algorithm is applied to improve the initial solution and obtain a better solution. For the case of eight vehicles and eight requests, from insertion heuristic we obtained an initial solution with an objective function value of 425 and with the used of parallel tabu search method we obtained a better solution with an objective function value of 420.

Original languageEnglish
Article number012009
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 31 May 2019
Event3rd International Conference on Mathematics; Pure, Applied and Computation, ICoMPAC 2018 - Surabaya, Indonesia
Duration: 20 Oct 2018 → …


Dive into the research topics of 'Application of parallel tabu search in solving Ride-sharing problem with HOV Lanes'. Together they form a unique fingerprint.

Cite this