Efficient Generation of Geographically Accurate Transit Maps

10/05/2017
by   Hannah Bast, et al.
0

We present LOOM (Line-Ordering Optimized Maps), a fully automatic generator of geographically accurate transit maps. The input to LOOM is data about the lines of a given transit network, namely for each line, the sequence of stations it serves and the geographical course the vehicles of this line take. We parse this data from GTFS, the prevailing standard for public transit data. LOOM proceeds in three stages: (1) construct a so-called line graph, where edges correspond to segments of the network with the same set of lines following the same course; (2) construct an ILP that yields a line ordering for each edge which minimizes the total number of line crossings and line separations; (3) based on the line graph and the ILP solution, draw the map. As a naive ILP formulation is too demanding, we derive a new custom-tailored formulation which requires significantly fewer constraints. Furthermore, we present engineering techniques which use structural properties of the line graph to further reduce the ILP size. For the subway network of New York, we can reduce the number of constraints from 229,000 in the naive ILP formulation to about 4,500 with our techniques, enabling solution times of less than a second. Since our maps respect the geography of the transit network, they can be used for tiles and overlays in typical map services. Previous research work either did not take the geographical course of the lines into account, or was concerned with schematic maps without optimizing line crossings or line separations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/28/2020

A Polynomial Kernel for Line Graph Deletion

The line graph of a graph G is the graph L(G) whose vertex set is the ed...
research
07/11/2019

Stick Graphs with Length Constraints

Stick graphs are intersection graphs of horizontal and vertical line seg...
research
01/13/2020

On the basic properties of GC_n sets

A planar node set X, with # X=n+22, is called GC_n set if each node poss...
research
03/21/2023

Lidar Line Selection with Spatially-Aware Shapley Value for Cost-Efficient Depth Completion

Lidar is a vital sensor for estimating the depth of a scene. Typical spi...
research
08/27/2023

LDL: Line Distance Functions for Panoramic Localization

We introduce LDL, a fast and robust algorithm that localizes a panorama ...
research
02/02/2023

Multi-Tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection

This letter concerns optimal power transmission line inspection formulat...
research
08/11/2018

Stochastic on-time arrival problem in transit networks

This article considers the stochastic on-time arrival problem in transit...

Please sign up or login with your details

Forgot password? Click here to reset