Route based equilibrium assignment in congested transit networks

Simple item page
dc.article.number103125
dc.catalogadorpva
dc.contributor.authorLarraín Izquierdo, Homero
dc.contributor.authorSuman Hemant, Kumar
dc.contributor.authorMuñoz Abogabir, Juan Carlos
dc.contributor.otherCEDEUS (Chile)
dc.date.accessioned2024-09-26T14:07:01Z
dc.date.available2024-09-26T14:07:01Z
dc.date.issued2021
dc.description.abstractThis work introduces a new route-based equilibrium assignment formulation and algorithm for congested transit networks. It is an extension of De Cea and Fern´andez (1993), which implements congestion effects in the boarding process and introduced the concept of effective frequencies. That seminal work provides a solution algorithm for the equilibrium problem that takes advantage of two main simplifications. First, it limits the number of route sections under consideration (i.e., it considers a reduced set of attractive services for users to choose from on each leg of their trip). Second, it assumes that the flow split between attractive services can be estimated using the nominal frequencies of the services instead of the effective ones. In this paper, we develop an equilibrium model and solution algorithm that extend the original formulation without relying on the two assumptions mentioned above, while still addressing three key challenges. First, user cost functions are asymmetric in nature, and therefore, an equivalent optimization problem cannot be formulated. Second, cost functions on this approach can only be expressed implicitly, which makes the implementation of a diagonalization algorithm a challenging problem. Lastly, dealing with the whole set of route sections implies working with all feasible sets of attractive services, which can make the underlying auxiliary network grow exponentially in size. We solve the equilibrium problem by using a diagonalization algorithm, obtaining approximate diagonalized functions by solving a fixed-point problem. Our methodology also includes an efficient algorithm to generate potential candidate sets of services in the network. We test our algorithm on three networks of increasing size, where we show that the approach effectively converges to a user equilibrium solution in a matter of seconds. We also show that the benchmark original algorithm converges to solutions that violate user equilibrium conditions, exhibiting unutilized routes with lower than equilibrium costs, confirming that our algorithm is the first one to find an exact solution to the route-based public transport user equilibrium problem.
dc.description.funderBus Rapid Transit Centre of Excellence (BRT+) - Volvo Research and Educational Foundations (VREF, Sweden)
dc.description.funderCenter for Sustainable Urban Development (CEDEUS)
dc.description.funderFONDECYT
dc.description.funderSchool of Engineering at the Pontificia Universidad Catolica de Chile
dc.fuente.origenWOS
dc.identifier.doi10.1016/j.trc.2021.103125
dc.identifier.eissn1879-2359
dc.identifier.issn0968-090X
dc.identifier.urihttps://doi.org/10.1016/j.trc.2021.103125
dc.identifier.urihttps://repositorio.uc.cl/handle/11534/87969
dc.identifier.wosidWOS:000656963600008
dc.information.autorucEscuela de Ingeniería; Larraín Izquierdo, Homero; 0000-0002-2220-0236; 17946
dc.information.autorucEscuela de Ingeniería; Suman Hemant, Kumar; S/I; 1083879
dc.information.autorucEscuela de Ingeniería; Muñoz Abogabir, Juan Carlos; 0000-0003-1775-985X; 75822
dc.language.isoen
dc.nota.accesocontenido parcial
dc.pagina.final20
dc.pagina.inicio1
dc.publisherElsevier Ltd.
dc.revistaTransportation Research Part C: Emerging Technologies
dc.rightsacceso restringido
dc.subjectCongested transit networks
dc.subjectUser equilibrium
dc.subjectFrequency based
dc.subjectRoute based
dc.subjectFully-congested models
dc.subject.ddc620
dc.subject.deweyIngenieríaes_ES
dc.subject.ods11 Sustainable cities and communities
dc.subject.odspa11 Ciudades y comunidades sostenibles
dc.titleRoute based equilibrium assignment in congested transit networks
dc.typeartículo
dc.volumen127
sipa.codpersvinculados17946
sipa.codpersvinculados1083879
sipa.codpersvinculados75822
sipa.trazabilidadWOS;18-03-2022
Files
Collections
Artículos de revistas
CEDEUS