Your browser doesn't support javascript. This means that the content or functionality of our website will be limited or unavailable. If you need more information about Vinnova, please contact us.

Planning algorithms for an integrated paratransit service

Reference number
Coordinator Linköpings universitet - Institutionen för teknik och naturvetenskap
Funding from Vinnova SEK 2 726 000
Project duration November 2013 - May 2017
Status Completed

Purpose and goal

This project has addressed how special transport services can be combined with a public transit system to create a more efficient transport service. In such a system, travelers can go certain parts with the demand responsive service and some with the line-based public transit system. Planning methods for such trips have been studied and an operational planning algorithm has been presented. The algorithm has also made it possible to study the effects of providing this form of trips.

Expected results and effects

In addition to good "academic results" in form of gained experiences, publications and presentations, the project´s results are expected to contribute to ease an introduction of the addressed form of combined trips. Spreading the results to practitioners and decision makers is crucial for spreading insight regarding the effects of this form of combined trips. After that, our actual results in form of the suggested algorithm can be used by system developers to create commercial planning support.

Planned approach and implementation

The project has been completed in three steps. In the first step, an optimization model has been created for the planning problem, which has increased the understanding of the problem at hand. The experience from that model has then been transformed into an appropriate planning algorithm for the static planning problem (that assumes all demand is known before planning starts), and finally this algorithm has been adapted to the dynamic case (in which demand comes in over time), which is of greater relevance to Swedish conditions based on how the service is operated today.

The project description has been provided by the project members themselves and the text has not been looked at by our editors.

Last updated 25 November 2019

Reference number 2013-02992

Page statistics