Otimização incremental de percurso de transporte público

Abstract

In recent years, many researchers have investigated the problems of route optimization in public transportation. The main goals in their approaches were: construct routes with short time travelling; reduce the wait time; minimize the travel demands not met; reduce the size of the fleets; among others. Though, despite the large amount of contributions, these approaches do not consider the travel patterns already known by the users when constructing new routes. However, constructing them without considering such patterns makes their adoption and implementation difficult in a real urban environment. Therefore, the present study developed an algorithm capable of reducing the users’ and operators’ costs with few changes in the existent routes, with the objective of keeping the travel patterns. Two benchmark was used to evaluate this algorithm. One is widely referenced in previous studies and the other was proposed recently. Besides those, the algorithm was also applied in the city of Maceió/AL. The experiment consists in three steps. The first aims to evaluate the new method’s efficiency. The second compares the results of the new algorithm to the ones in the literature. The last step analyzes the number of changes required to generate the new routes. Lastly, the results of the experiments indicate that this approach is capable of generating effective routes applying few changes.