<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-07-18T01:12:57Z</responseDate><request verb="GetRecord" identifier="oai:riubu.ubu.es:10259/7046" metadataPrefix="qdc">https://riubu.ubu.es/oai/request</request><GetRecord><record><header><identifier>oai:riubu.ubu.es:10259/7046</identifier><datestamp>2024-05-20T07:45:25Z</datestamp><setSpec>com_10259.4_104</setSpec><setSpec>com_10259_2604</setSpec><setSpec>col_10259_6848</setSpec></header><metadata><qdc:qualifieddc xmlns:qdc="http://dspace.org/qualifieddc/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
<dc:title>Multimodal shortest hyperpaths considering crowding in transit vehicles</dc:title>
<dc:creator>López, David</dc:creator>
<dc:creator>Lozano, Angélica</dc:creator>
<dc:subject>Tráfico</dc:subject>
<dc:subject>Transporte público</dc:subject>
<dc:subject>Logística</dc:subject>
<dc:subject>Traffic</dc:subject>
<dc:subject>Public transport</dc:subject>
<dc:subject>Logistics</dc:subject>
<dcterms:abstract>In rush hours, the onboard crowd level within transit vehicles is a problem of any large city.&#xd;
At the expense of time savings, some users will avoid riding crowded lines if they consider&#xd;
that transit vehicles do not have enough personal space. This paper presents a hypergraph&#xd;
model and an algorithm to find multimodal shortest hyperpaths considering the user&#xd;
constraints on the sequence of boarded modes and their preferences of onboard crowding&#xd;
levels. It is assumed that transit inter-arrivals are random. A penalty for riding transit&#xd;
vehicles is defined to model how the users perceive the onboard crowd levels. This penalty&#xd;
depends on the onboard crowd levels and the seating capacity of the vehicles. A stateautomaton&#xd;
is used to model the user constraints on the sequence of boarded modes. To find&#xd;
the shortest hyperpaths, the user selects their origin, destination, the maximum number of&#xd;
modal transfers, and the onboard crowd level threshold. A use case on a sample multimodal&#xd;
network is presented.</dcterms:abstract>
<dcterms:dateAccepted>2022-09-23T07:12:36Z</dcterms:dateAccepted>
<dcterms:available>2022-09-23T07:12:36Z</dcterms:available>
<dcterms:created>2022-09-23T07:12:36Z</dcterms:created>
<dcterms:issued>2021-07</dcterms:issued>
<dc:type>info:eu-repo/semantics/conferenceObject</dc:type>
<dc:identifier>978-84-18465-12-3</dc:identifier>
<dc:identifier>http://hdl.handle.net/10259/7046</dc:identifier>
<dc:identifier>10.36443/10259/7046</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>R-Evolucionando el transporte</dc:relation>
<dc:relation>http://hdl.handle.net/10259/6490</dc:relation>
<dc:relation>https://doi.org/10.36443/9788418465123</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:publisher>Universidad de Burgos. Servicio de Publicaciones e Imagen Institucional</dc:publisher>
</qdc:qualifieddc></metadata></record></GetRecord></OAI-PMH>