GTFS to OSM route matching: odpt-HitachiAutomobileTransportation-Chiyoda_ALLLINES

日立自動車交通株式会社 — Japan_Kanto_Tokyo
91 trips, 0 matched (0.0%).

All feeds

bus 秋葉原ルート (000002): 0 of 21 trips matched

StopsFromToTrips OSM candidaterefcountdistancedirection pointsnamesmean
26千代田区役所千代田区役所10 秋葉原ルート (9466322)1.000.810.93–0.230.24– map
25千代田区役所千代田区役所7 秋葉原ルート (9466322)1.000.840.93–0.240.25– map
15千代田区役所秋葉原駅中央口2 秋葉原ルート (9466322)1.000.710.58–0.240.25– map
15岩本町ほほえみプラザ千代田区役所1 秋葉原ルート (9466322)1.000.710.66–0.140.29– map
16岩本町ほほえみプラザ千代田区役所1 秋葉原ルート (9466322)1.000.760.66–0.140.31– map

bus 麹町ルート (000001): 0 of 21 trips matched

StopsFromToTrips OSM candidaterefcountdistancedirection pointsnamesmean
27千代田区役所千代田区役所17 秋葉原ルート (9466322)0.000.780.86–0.110.20– map
13千代田区役所四谷駅2 都03 (14021789)0.000.850.810.620.310.34– map
15四谷駅千代田区役所2 都03 (14021790)0.000.800.840.620.200.28– map

bus 内神田ルート (000003): 0 of 20 trips matched

StopsFromToTrips OSM candidaterefcountdistancedirection pointsnamesmean
26千代田区役所千代田区役所9 内神田ルート (6110295)1.000.620.84–0.260.21– map
25千代田区役所千代田区役所7 内神田ルート (6110295)1.000.590.84–0.260.16– map
15かんだ連雀千代田区役所2 内神田ルート (6110295)1.000.360.73–0.170.20– map
11千代田区役所かんだ連雀1 内神田ルート (6110295)1.000.260.46–0.100.18– map
12千代田区役所かんだ連雀1 内神田ルート (6110295)1.000.290.46–0.100.19– map

bus 富士見・神保町ルート (000004): 0 of 20 trips matched

StopsFromToTrips OSM candidaterefcountdistancedirection pointsnamesmean
24千代田区役所千代田区役所9 秋葉原ルート (9466322)0.000.880.85–0.250.26– map
23千代田区役所千代田区役所7 秋葉原ルート (9466322)0.000.910.85–0.260.23– map
9千代田区役所いきいきプラザ一番町2 岩03 (12340315)0.000.640.820.610.000.10– map
15いきいきプラザ一番町千代田区役所1 秋葉原ルート (9466322)0.000.710.72–0.190.24– map
16いきいきプラザ一番町千代田区役所1 秋葉原ルート (9466322)0.000.760.72–0.190.32– map

bus 四谷ルート (000005): 0 of 5 trips matched

StopsFromToTrips OSM candidaterefcountdistancedirection pointsnamesmean
18千代田区役所千代田区役所5 秋葉原ルート (9466322)0.000.860.79–0.140.20– map

bus 神田ルート (000006): 0 of 4 trips matched

StopsFromToTrips OSM candidaterefcountdistancedirection pointsnamesmean
15千代田区役所千代田区役所4 秋葉原ルート (9466322)0.000.710.81–0.240.25– map
ℹ️ How to read this
Every GTFS trip is matched against the OSM route relations of the same type whose bounding box covers the trip's area. A candidate must pass five gates — platform count, stop-to-stop length, direction, platform positions and platform names — and the best one is accepted when the mean of its scores exceeds 0.70. If no candidate carries the trip's own ref, the best other candidate needs a mean above 0.75 and a 0.05 lead over any other line. Trips of one stop pattern (the same stop sequence) are decided together, so each row below is one stop pattern, matched ones (green candidate cell) included so a route's matched and unmatched patterns can be compared; the candidate shown is the one that decided the result or, when nothing passed, the one that got furthest. The pink cell says why: a signal — the first gate the candidate failed; the ref — no relation of the trip's own line passed the gates (or none is a candidate at all, when the ref score is 0), so this is another line; the mean — the candidate passed every gate but the mean is not above the threshold, or, when a "lost its margin to" row follows, it leads that other line by less than 0.05. Hover a pink cell for the full wording. "map" opens the pattern over OpenStreetMap: GTFS stops in red, the candidate's platforms in green, the runner-up's in orange, and the platform–stop pairs the points signal assigned as dashed lines.