Connection scan has been reintegrated into mobiTopp. The code will stay here, but updates will only be made to the version in mobiTopp. mobiTopp is also available on github: ifv-mobitopp/mobitopp
The connection-scan is a route search algorithm for transit networks. The algorithm itself is described in various papers (CSA, CSA Accelarated). The implementation is developed at the Institute for Transport Studies at the Karlsruhe Institute of Technology. The route search algorithm is part of our travel demand model mobiTopp.
To search routes via the connection scan, you have to initialise it with a transit network made up of stops and connections. During initialisation the algorithm will check the following prerequisites.
- All stop ids must be in the range from
0ton. This is needed for some performance improvements. - Connections are not allowed to start and end at the same stop. Those connections will be ignored.
- Connections are not allowed to arrive before they depart. Due to this, travelling back in time is not possible.
SimpleTransitExampleTest shows how the connection scan can be used. Route search requests can be made from single stops to single stops or from many to many stops. In case the request is from many to many, the access and egress paths have to be provided. Those paths will be considered during route search to find the earliest arrival at the target.