Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.