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 con-nections. The computational study demonstrates that, even in such a large-scale, highly complex scenario, appropriate speed-up techniques yield an acceptable query response time.
In the Dial-a-Ride Problem (DARP) the aim is to design vehicle routes for a set of users who must be...
Mobility is an important aspect of modern society. Consequently, there is a growing demand for servi...
Nowadays, the use of computer-based route planners is popular among private and public transportatio...
We report on a multi-criteria search system, in which the German long- and short-distance trains, lo...
Millions of people use public transportation and consult electronic timetable information systems. A...
Abstract. We study the problem of finding multimodal journeys in transportation networks, including ...
We study multi-modal route planning allowing arbitrary (meaningful) combinations of public transport...
Common methods of optimal route search are described in the thesis. Also, existing procedures used i...
This work proposes multi-modal variants of the well-known Vehicle Routing Problem. It will be empiri...
Finding cheap train connections for long-distance traffic is algorithmically a hard task due to very...
We study the journey planning problem for fully multimodal networks consisting of public transit and...
A key enabler to the success of public transportation system is a dependable and responsive journey ...
Existing wayfinding and navigation services are primarily designed to support driving and riding mod...
Travelers expect integrated and multimodal itinerary planning while addressing their individual expe...
Speeding up multi-criteria search in real timetable information systems remains a challenge in spite...
In the Dial-a-Ride Problem (DARP) the aim is to design vehicle routes for a set of users who must be...
Mobility is an important aspect of modern society. Consequently, there is a growing demand for servi...
Nowadays, the use of computer-based route planners is popular among private and public transportatio...
We report on a multi-criteria search system, in which the German long- and short-distance trains, lo...
Millions of people use public transportation and consult electronic timetable information systems. A...
Abstract. We study the problem of finding multimodal journeys in transportation networks, including ...
We study multi-modal route planning allowing arbitrary (meaningful) combinations of public transport...
Common methods of optimal route search are described in the thesis. Also, existing procedures used i...
This work proposes multi-modal variants of the well-known Vehicle Routing Problem. It will be empiri...
Finding cheap train connections for long-distance traffic is algorithmically a hard task due to very...
We study the journey planning problem for fully multimodal networks consisting of public transit and...
A key enabler to the success of public transportation system is a dependable and responsive journey ...
Existing wayfinding and navigation services are primarily designed to support driving and riding mod...
Travelers expect integrated and multimodal itinerary planning while addressing their individual expe...
Speeding up multi-criteria search in real timetable information systems remains a challenge in spite...
In the Dial-a-Ride Problem (DARP) the aim is to design vehicle routes for a set of users who must be...
Mobility is an important aspect of modern society. Consequently, there is a growing demand for servi...
Nowadays, the use of computer-based route planners is popular among private and public transportatio...