Search Results - subject:"Hyperpaths"

A frequency based transit assignment model that considers online information and strict capacity constraints

Oliker, Nurit; Bekhor, Shlomo - In: EURO journal on transportation and logistics 9 (2020) 1, pp. 1-10

This paper proposes a frequency based transit assignment model that accounts for online information and strict capacity constraints. A heuristic is proposed to solve the problem, which first applies an unconstrained transit assignment procedure and then handles only the over-loaded transit line...

Persistent link: https://www.econbiz.de/10012304222

A frequency based transit assignment model that considers online information and strict capacity constraints

Oliker, Nurit; Bekhor, Shlomo - In: EURO Journal on Transportation and Logistics (EJTL) 9 (2020) 1, pp. 1-10

Persistent link: https://www.econbiz.de/10015450219

Solving stochastic frequency-based assignment to transit networks with pre-trip/en-route path choice

Di Gangi, Massimo; Cantarella, Giulio E.; Vitetta, Antonino - In: EURO journal on transportation and logistics 8 (2019) 5, pp. 661-681

Persistent link: https://www.econbiz.de/10012147232

Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths

Trozzi, Valentina; Gentile, Guido; Bell, Michael G.H.; … - In: Transportation Research Part B: Methodological 57 (2013) C, pp. 266-285

This paper presents a dynamic user equilibrium for bus networks where recurrent overcrowding results in queues at stops. The route-choice model embedded in the dynamic assignment explicitly considers common lines and strategies with alternative routes. As such, the shortest hyperpath problem is...

Persistent link: https://www.econbiz.de/10010719804

Finding hypernetworks in directed hypergraphs

Pretolani, Daniele - In: European Journal of Operational Research 230 (2013) 2, pp. 226-230

The term “hypernetwork” (more precisely, s-hypernetwork and (s, d)-hypernetwork) has been recently adopted to denote some logical structures contained in a directed hypergraph. A hypernetwork identifies the core of a hypergraph model, obtained by filtering off redundant components....

Persistent link: https://www.econbiz.de/10011052670

Stochastic transit equilibrium

Cortés, Cristián E.; Jara-Moroni, Pedro; Moreno, Eduardo - In: Transportation Research Part B: Methodological 51 (2013) C, pp. 29-44

hyperpaths. We prove existence of equilibrium in the simplified case of parallel lines (stochastic common-lines problem) and …

Persistent link: https://www.econbiz.de/10011065500

Finding the K shortest hyperpaths using reoptimization

Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim … - Ehrvervøkonomisk Institut, Institut for Økonomi - 2004

different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by … the K shortest hyperpaths in an acyclic hypergraph. This result is obtained by applying new reoptimization techniques for … shortest hyperpaths. The algorithm turns out to be quite effective in practice and has already been successfully applied in the …

Persistent link: https://www.econbiz.de/10005802236