Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Optimal transit path finding algorithm based on geographic information system
The paper proposes a new description of the transit network within the framework of GIS. The shortest path judgment criterion of passenger route choice is presented. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, and passenger travel psychology. The algorithm takes into account the overall level of services and the passenger route choice criterion to determine the shortest path and transfer points between the random two bus stops.
Optimal transit path finding algorithm based on geographic information system
The paper proposes a new description of the transit network within the framework of GIS. The shortest path judgment criterion of passenger route choice is presented. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, and passenger travel psychology. The algorithm takes into account the overall level of services and the passenger route choice criterion to determine the shortest path and transfer points between the random two bus stops.
Optimal transit path finding algorithm based on geographic information system
ShuGuang Li, (Autor:in) / YanMing Su, (Autor:in)
01.01.2003
175862 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Optimal Transit Path Finding Algorithm Based on Geographic Information System
| British Library Conference Proceedings | 2003
| British Library Online Contents | 1996
Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems
| British Library Online Contents | 2002
Analytic Hierarchy Process and Geographic Information Systems to Identify Optimal Transit Alignments
| British Library Online Contents | 2011
Geographic Information System-Based Regional Transit Feasibility Analysis and Simulation Tool
| British Library Online Contents | 2002