We report on a multi-criteria search system, in which the German long- and short-distance trains, local public transport, walking, private car, private bike, and taxi are incorporated. The system is fully realistic. Three optimization criteria are addressed: travel time, travel cost, and convenience. Our algorithmic approach computes a complete Pareto set of reasonable connections. The computational study demonstrates that, even in such a large-scale, highly complex scenario, appropriate speed-up techniques yield an acceptable query response time
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding ...
Practical algorithms for route planning in transportation networks are a showpiece of successful Alg...
A key enabler to the success of public transportation system is a dependable and responsive journey ...
We report on a multi-criteria search system, in which the German long- and short-distance trains, lo...
We report on a multi-criteria search system, in which the German long- and short-distance trains, lo...
We study multi-modal route planning allowing arbitrary (meaningful) combinations of public transport...
We study the journey planning problem for fully multimodal networks consisting of public transit and...
Millions of people use public transportation and consult electronic timetable information systems. A...
We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing a...
Abstract. We study the problem of finding multimodal journeys in transportation networks, including ...
We study a multi-modal route planning scenario consisting of a public transit network and a transfer...
We study the one-to-many journey planning problem in multi-modal transportation networks consisting ...
Mobility is an important aspect of modern society. Consequently, there is a growing demand for servi...
We study the one-to-many journey planning problem in multi-modal transportation networks consisting ...
Finding cheap train connections for long-distance traffic is algorithmically a hard task due to very...
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding ...
Practical algorithms for route planning in transportation networks are a showpiece of successful Alg...
A key enabler to the success of public transportation system is a dependable and responsive journey ...
We report on a multi-criteria search system, in which the German long- and short-distance trains, lo...
We report on a multi-criteria search system, in which the German long- and short-distance trains, lo...
We study multi-modal route planning allowing arbitrary (meaningful) combinations of public transport...
We study the journey planning problem for fully multimodal networks consisting of public transit and...
Millions of people use public transportation and consult electronic timetable information systems. A...
We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing a...
Abstract. We study the problem of finding multimodal journeys in transportation networks, including ...
We study a multi-modal route planning scenario consisting of a public transit network and a transfer...
We study the one-to-many journey planning problem in multi-modal transportation networks consisting ...
Mobility is an important aspect of modern society. Consequently, there is a growing demand for servi...
We study the one-to-many journey planning problem in multi-modal transportation networks consisting ...
Finding cheap train connections for long-distance traffic is algorithmically a hard task due to very...
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding ...
Practical algorithms for route planning in transportation networks are a showpiece of successful Alg...
A key enabler to the success of public transportation system is a dependable and responsive journey ...