.TH v.net.timetable 1grass "" "GRASS 6.4.2" "Grass User's Manual"
.SH NAME
\fI\fBv.net.timetable\fR\fR  - Finds shortest path using timetables.
.SH KEYWORDS
vector, network, shortest path
.SH SYNOPSIS
\fBv.net.timetable\fR
.br
\fBv.net.timetable help\fR
.br
\fBv.net.timetable input\fR=\fIname\fR  [\fBlayer\fR=\fIinteger\fR]  \fBoutput\fR=\fIname\fR  [\fBwalk_layer\fR=\fIinteger\fR]   [\fBpath_layer\fR=\fIinteger\fR]  \fBroute_id\fR=\fIname\fR \fBstop_time\fR=\fIname\fR \fBto_stop\fR=\fIname\fR \fBwalk_length\fR=\fIname\fR  [--\fBoverwrite\fR]  [--\fBverbose\fR]  [--\fBquiet\fR] 
.SS Flags:
.IP "\fB--overwrite\fR" 4m
.br
Allow output files to overwrite existing files
.IP "\fB--verbose\fR" 4m
.br
Verbose module output
.IP "\fB--quiet\fR" 4m
.br
Quiet module output
.PP
.SS Parameters:
.IP "\fBinput\fR=\fIname\fR" 4m
.br
Name of input vector map
.IP "\fBlayer\fR=\fIinteger\fR" 4m
.br
Layer number
.br
A single vector map can be connected to multiple database tables. This number determines which table to use.
.br
Default: \fI1\fR
.IP "\fBoutput\fR=\fIname\fR" 4m
.br
Name for output vector map
.IP "\fBwalk_layer\fR=\fIinteger\fR" 4m
.br
Layer number or name with walking connections or -1
.br
A single vector map can be connected to multiple database tables. This number determines which table to use.
.br
Default: \fI-1\fR
.IP "\fBpath_layer\fR=\fIinteger\fR" 4m
.br
Layer number or name with route paths or -1
.br
A single vector map can be connected to multiple database tables. This number determines which table to use.
.br
Default: \fI-1\fR
.IP "\fBroute_id\fR=\fIname\fR" 4m
.br
Name of column name with route ids
.br
Default: \fIroute_id\fR
.IP "\fBstop_time\fR=\fIname\fR" 4m
.br
Name of column name with stop timestamps
.br
Default: \fIstop_time\fR
.IP "\fBto_stop\fR=\fIname\fR" 4m
.br
Name of column name with stop ids
.br
Default: \fIto_stop\fR
.IP "\fBwalk_length\fR=\fIname\fR" 4m
.br
Name of column name with walk lengths
.br
Default: \fIlength\fR
.PP
.SH DESCRIPTION
\fIv.net.timetable\fR finds the shortest path between two points using timetables. Module reads input, one query per line, from the standard input and writes output to the standard output as well as to the \fBoutput\fR map and to tables linked to layers 1 and 2. Each line of input must follow one of the following formats:
\fC
.DS
.br
PATH_ID FROM_X FROM_Y TO_X TO_Y START_TIME MIN_CHANGE MAX_CHANGES WALK_CHANGE
.br
PATH_ID FROM_STOP TO_STOP START_TIME MIN_CHANGE MAX_CHANGES WALK_CHANGE
.br
.DE
\fR
where PATH_ID is the identificator of a query that is used in the output map to differentiate between queries. Search begins at START_TIME. MIN_CHANGE gives the minimum number of time (inclusively) for a change from one route to another. MAX_CHANGES denotes the maximum number of changes allowed or -1 if infinity. WALK_CHANGE is 1 or 0 depending whether walking from a stop to another stop is considered a change or not. Finally, the path is found from FROM_STOP to TO_STOP in latter case and from the stop closest to (FROM_X, FROM_Y) coordinates to the stop closest to (TO_X, TO_Y) coordinates in former case.
.br
For each input query, module outputs a description of the shortest path to the standard output. For example, using the tables given below, for the following input:
\fC
.DS
.br
47 130 300 0 1 5 0
.br
.DE
\fR
the following output is produced:
\fC
.DS
.br
Route 15, from 130 leaving at 15 arriving to 250 at 22
.br
Walk from 250 leaving at 22 arriving to 300 at 24
.br
.DE
\fR
Moreover, the module writes the path to the \fBoutput\fR map and stores all the information necesasary to reconstruct the path to the tables. Table corresponding to stops/points is linked to layer 1 and looks, after the query, as follows:
\fC
.DS
.br
cat|path_id|stop_id|index|arr_time|dep_time
.br
1|47|130|1|0|15
.br
2|47|250|2|22|22
.br
3|47|300|3|24|24
.br
.DE
\fR  
where CAT is the category of a point in the map, PATH_ID is the path identificator, STOP_ID is the identificator of the stop as used in the intput map, INDEX is the index of the stop on the path (i.e, index=1 is the first stop visited, ...) and ARR_TIME and DEP_TIME denote the arrival time and departure time respectively. Arrival time for the first stop on the path is always equal to START_TIME and departure time for the last stop is always equal to the arrival time.
.br
Table linked to the second layer corresponds to subroutes taken between stops. The following table is obtainedd for the above query:
\fC
.DS
.br
cat|path_id|from_id|to_id|route_id|index|from_time|to_time
.br
1|47|130|250|15|1|15|22
.br
2|47|250|300|-1|2|22|24
.br
.DE
\fR
where CAT is the category of lines of subroute between stops FROM_ID to TO_ID, ROUTE_ID is the identificator of the route taken or -1 if walking, INDEX and PATH_ID are as above and FROM_TIME and TO_TIME denote the times between which the route is taken.
.br
The \fBoutput\fR map contains the points on the positions of used stops. If a subroute is taken between two stops then a line segment is added between two corresponding points. Finally, instead of straight line segment, the actual paths of routes can be given in \fBpaths\fR layer. If this parameter is used then each line in the input map must contain identificators as category numbers of all routes passing through the line. The module then finds the path between two stops and writes this path instead. In case of walking from one stop to another, straight line between the stops is used.    
.SH NOTES
Timetables are stored in a table linked to the given \fBlayer\fR of the \fBinput\fR map. Timetable consists of routes and each route is just a sequence of stops with specified arrival times. If two sequences of stops differ only in times then they still correspond to two routes. For example, if there is a bus line that leaves every 20 minutes and follow exactly the same path every time then there still needs to be a separate route for every time. For each stop (given by the category number of the point) the table storing information about the routes must contain the list of all routes stopping at the stop(given by route identificators) together with arrival times. That is, the table must contain three columns: stop - which is the key of the table, \fBroute_id\fR and \fBstop_time\fR where each triple corresponds to a route arriving to a stop and a certain time. For example, a valid table might look as follows:           
\fC
.DS
.br
cat|route_id|stop_time
.br
100|5|0
.br
130|5|10
.br
150|5|20
.br
250|5|30
.br
300|5|40
.br
260|15|5
.br
130|15|15
.br
250|15|22
.br
150|35|17
.br
250|35|27
.br
300|35|37
.br
100|35|50
.br
.DE
\fR
Note that \fBstop_time\fR is an integer and so you can use any units and offest to specify arrival times.
.br
Also, walking connections between stops can be given by a table linked to \fBwalking\fR layer of the \fBinput\fR map. If this parameter is -1 then walking between stops is not allowed. The table must contain three columns: stop - which is the key of the table, \fBto_stop\fR and \fBlength\fR. A record in the table says that it takes \fBlenght\fR units of time to walk from stop to \fBto_stop\fR. The following is a valid table:
\fC
.DS
.br
cat|length|to_stop
.br
250|2|300
.br
.DE
\fR
Beware that this only means that it is possible to walk from stop 250 to stop 300 but the other way round.
.SH EXAMPLES
To find a path from stop with identificator 130 to stop with category 300, starting at time 0, with one time unit for change, maximum of 5 changes and with walking not considered a change of route, we use the following command:
\fC
.DS
.br
echo "47 130 300 0 1 5 0" | v.net.timetable input=buses output=path layer=5 walking=6 path=7
.br
.DE
\fR
If on the other, hand we know the coordinates of the places then the following command might be used   
\fC
.DS
.br
echo "47 10.31 54.31 90.21 28.21 0 1 5 0" | v.net.timetable input=buses output=path layer=5 walking=6 path=7
.br
.DE
\fR
.SH SEE ALSO
\fI
v.net.path,
v.net.distance
\fR
.SH AUTHORS
Daniel Bundala, Google Summer of Code 2009, Student
.br
Wolf Bergenheim, Mentor
.PP
\fILast changed: $Date: 2011-11-08 10:42:51 +0100 (Tue, 08 Nov 2011) $\fR
.PP
Full index
.PP
© 2003-2011 GRASS Development Team