RT info:eu-repo/semantics/conferenceObject T1 Multimodal shortest hyperpaths considering crowding in transit vehicles A1 López, David A1 Lozano, Angélica K1 Tráfico K1 Traffic K1 Transporte público K1 Public transport K1 Logística K1 Logistics K1 Ingeniería civil K1 Civil engineering K1 Transporte K1 Transportation AB In rush hours, the onboard crowd level within transit vehicles is a problem of any large city.At the expense of time savings, some users will avoid riding crowded lines if they considerthat transit vehicles do not have enough personal space. This paper presents a hypergraphmodel and an algorithm to find multimodal shortest hyperpaths considering the userconstraints on the sequence of boarded modes and their preferences of onboard crowdinglevels. It is assumed that transit inter-arrivals are random. A penalty for riding transitvehicles is defined to model how the users perceive the onboard crowd levels. This penaltydepends on the onboard crowd levels and the seating capacity of the vehicles. A stateautomatonis used to model the user constraints on the sequence of boarded modes. To findthe shortest hyperpaths, the user selects their origin, destination, the maximum number ofmodal transfers, and the onboard crowd level threshold. A use case on a sample multimodalnetwork is presented. PB Universidad de Burgos. Servicio de Publicaciones e Imagen Institucional SN 978-84-18465-12-3 YR 2021 FD 2021-07 LK http://hdl.handle.net/10259/7046 UL http://hdl.handle.net/10259/7046 LA eng NO Trabajo presentado en: R-Evolucionando el transporte, XIV Congreso de Ingeniería del Transporte (CIT 2021), realizado en modalidad online los días 6, 7 y 8 de julio de 2021, organizado por la Universidad de Burgos DS Repositorio Institucional de la Universidad de Burgos RD 29-mar-2024