Evaluating the performance of a genetic algorithm to solve the line planning problem for a bus service

Abstract

Planning a bus service requires to explore several feasible solutions attempting to optimize travel time, costs or both. The line planning problem (lpp) solves the combinatorial problem to define the routes for bus lines in a bus service under a set of constraints, input parameters and an objective function. The input parameters such as the demand, infrastructure, travel times, etc., describe the current situation, and provide both input data and the constraints that should be considered during the design. An algorithm that obtains feasible and high-quality solutions for lpp is essential in search of better urban services. In this study, a genetic algorithm is designed and coded to solve the lpp. Finally, an evaluation of the results is carried out from different perspectives, attempting to ensure the solutions obtained by the algorithm are consistent and therefore useful in practice.

Keywords

• algoritmo genético
• problema de planificación de línea
• servicios de autobús