Integrating public transport into mobiTopp

Briem, Lars; Buck, H. Sebastian; Mallig, Nicolai; Vortisch, Peter; Strasser, Ben; Wagner, Dorothea; Zündorf, Tobias

doi:10.1016/j.future.2017.12.051

Cited by 5 publications

(5 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Topologically, the primal connection is sorted by departure time, and the shortest path algorithm only needs to scan all the connections of the timetable in a single array once. Currently, CSA is behind the mobiTopp, a modular agent-based Travel Demand [20] and used in open data initiatives for the public transportation route planning ecosystem [21].…”

Section: Jurnal Sistem Dan Manajemen Industrimentioning

confidence: 99%

“…CSA is slightly more efficient than RAPTOR, but it is substantially straightforward [16]. Hence, in this research, CSA was selected as the proven fastest algorithm to solve our problem in public transportation route planning than traditional route planning solutions based on variants Dijkstra's algorithm [16], [20], [22].…”

Section: Jurnal Sistem Dan Manajemen Industrimentioning

confidence: 99%

See 1 more Smart Citation

Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study

Darmawan¹,

Chen²

2020

j. sist. manaj. ind.

View full text Add to dashboard Cite

Accessibility to tourist destinations is an important component in a tourism system, especially for natural tourist destinations located in suburban areas. Good linkage of travel information and physical connections with local transportation services for intercity travel can facilitate more people to travel and promote national tourism destinations. This research takes the popular national tourism destinations and their public transportation service in Taiwan as a research object due to the unavailability of integrated public transport information service. Free Independent Travelers (FIT) demand is growing. This research aims to integrate intermodal public transportation information to support FIT by proposing a seamless way journey planner. In this scenario, the journey planner requires timetable data as input. The Connection Scan Algorithm is used to find the earliest arrival time routes at their destinations. This journey planner is built in PHP language and can complement the official tourism travel information website by Tourism Bureau, MOTC. Hence, the FIT could get the quickest routes to reach the destinations without compiling the public transportation information provided independently.

show abstract

Section: Jurnal Sistem Dan Manajemen Industrimentioning

confidence: 99%

Section: Jurnal Sistem Dan Manajemen Industrimentioning

confidence: 99%

Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study

Darmawan¹,

Chen²

2020

j. sist. manaj. ind.

View full text Add to dashboard Cite

show abstract

“…A decision model is then used to decide whether a passenger would actually use the connection based on the PAT. Because of its efficiency, this approach has already been adapted for the travel demand simulation tool mobiTopp [6].…”

Section: Related Workmentioning

confidence: 99%

“…The departure buffer time models the time that is needed to walk to the platform where the vehicle departs and enter the vehicle, which may be considerable if the stop represents a large station. Many other works, including the CSA-based assignment algorithm we want to build upon, instead consider minimum change times [2,6,10,11]. The minimum change time must only be observed when transferring between trips at the same stop, but not when entering a trip after arriving via a footpath.…”

Section: Public Transit Routingmentioning

confidence: 99%

Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA

Sauer

Wagner

Zündorf

2019

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

Self Cite

View full text Add to dashboard Cite

We study the problem of computing public transit traffic assignments in a multi-modal setting: Given a public transit timetable, an additional unrestricted transfer mode (in our case walking), and a set of origin-destination pairs, we aim to compute the utilization of every vehicle in the network. While it has been shown that considering unrestricted transfers can significantly improve journeys, computing such journeys efficiently remains algorithmically challenging. Since traffic assignments require the computation of millions of shortest paths, using a multi-modal network has previously not been feasible. A recently proposed approach (ULTRA) enables efficient algorithms with UnLimited TRAnsfers at the cost of a short preprocessing phase. In this work we combine the ULTRA approach with a state-of-the-art assignment algorithm, making multi-modal assignments practical. Careful algorithm engineering results in a new public transit traffic assignment algorithm that even outperforms the algorithm it builds upon, while enabling unlimited walking which has not been considered previously. We conclude our work with an extensive evaluation of the algorithm, showing its versatility and efficiency. On our real world instance, the algorithm computes over 15 million unique journeys in less than 17 seconds.Figure 1: Utilization of public transit vehicles between 8:30 a.m. and 9:00 a.m. in the Stuttgart area (Germany), as computed by our assignment algorithm. Vehicles used by only a few passengers are depicted using thin, green lines. As vehicles are used by more passengers, their line is gradually drawn thicker and their color changes to red. The transfer graph is depicted in gray.

show abstract

“…Pilz et al proposed a fully distributed collaborative demand-side management framework based on adaptive diffusion strategy. In this method, each customer is autonomous and does not need any global information, thus minimizing the discomfort of customers [9].…”

Section: Introductionmentioning

confidence: 99%

Application of Demand-side Technology in Power System Intelligent Regulation

Zhu

Chen

et al. 2021

DGAEJ

View full text Add to dashboard Cite

To reduce peak demand for electricity, smooth load curve shape, improve power system safety and efficiency, this paper, by using intelligent home appliance user operation comfort model is set up to quantify the acceptance, this paper proposes a maximum minimum load management algorithm based on optimization strategy to change electric power use time and power consumption mode.The results show that the proposed model and algorithm can forecast and manage the power load well, and can reduce the peak to average ratio by 14.3% and the total expenditure by 15.3% while maintaining the operating comfort of power users to the maximum.The load management problem of multiple power users can reach Nash equilibrium in a finite number of iterations, and this Nash equilibrium point is also the global optimal point.

show abstract

Integrating public transport into mobiTopp

Cited by 5 publications

References 15 publications

Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study

Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study

Efficient Computation of Multi-Modal Public Transit Traffic Assignments using ULTRA

Application of Demand-side Technology in Power System Intelligent Regulation

Contact Info

Product

Resources

About