Optimizing Accessibility and Maximum Travel Times in Transit Networks: A Hub Covering Location Problem
This work introduces an optimization model to support decision-making in the design of integrated transit systems, aiming to improve urban mobility. We assume that daily user trips consist of two types of segments: short segments where users apply their own transport between their homes or workplaces and the public transit access points, and a longer segment on the transportation network.
Users' accessibility is ensured by imposing an upper limit on the travel times of the short segments. We assume that only users within a given coverage radius will employ the system. On the other hand, system effectiveness is ensured by restricting the travel time on the longer segment to a maximum value.
Two mixed-integer linear programming formulations are proposed, and their efficiency is evaluated through computational experiments. The results allow us to study the structure of the solutions obtained and analyze the effects of the parameters considered.
Palabras clave: Hub covering Hub location Mixed-integer linear programming