Shortest Hyperpaths in a Multimodal Network for the Public Transportation System: Central Southern Mexico City

This work presents the implementation of an algorithm to obtain shortest hyperpaths in multimodal networks with a limited number of modal changes, for a real case in central-southern Mexico City. Five public transportations modes without fixed schedules are considered. The outcome for the user is a solution set (Pareto Optimal) with different travel times and number of modal changes, among which user can choose the most convenient for him/her. The implementation result is a set of files that can be used to provide information related to travel decision, and can be the base for creating an Advanced Traveler Information System.