1v.net.salesman(1)             Grass User's Manual            v.net.salesman(1)
2
3
4

NAME

6       v.net.salesman   -  Create  a  cycle  connecting given nodes (Traveling
7       salesman problem). Note that TSP is  NP-hard,  heuristic  algorithm  is
8       used by this module and created cycle may be sub optimal.
9

KEYWORDS

11       vector, networking
12

SYNOPSIS

14       v.net.salesman
15       v.net.salesman help
16       v.net.salesman  [-g] input=name output=name  [type=string[,string,...]]
17       [alayer=integer]    [nlayer=integer]    [acolumn=string]    ccats=range
18       [--overwrite]
19
20   Flags:
21       -g  Use geodesic calculation for longitude-latitude locations
22
23       --overwrite
24
25   Parameters:
26       input=name
27           Name of input vector map
28
29       output=name
30           Name for output vector map
31
32       type=string[,string,...]
33           Arc type Options: line,boundary Default: line,boundary
34
35       alayer=integer
36           Arc layer Default: 1
37
38       nlayer=integer
39           Node layer (used for cities) Default: 2
40
41       acolumn=string
42           Arcs' cost column (for both directions)
43
44       ccats=range
45           Category  values Categories of points ('cities') on nodes (layer is
46           specified by nlayer)
47

DESCRIPTION

49       v.net.salesman calculates the optimal route to visit nodes on a  vector
50       network.
51

EXAMPLE

53       TODO
54

SEE ALSO

56       d.path, v.net, v.net.alloc, v.net.iso, v.net.path, v.net.steiner
57

AUTHOR

59       Radim Blazek, ITC-Irst, Trento, Italy
60
61       Last changed: $Date: 2007/05/02 20:15:58 $
62
63       Full index
64
65
66
67GRASS 6.2.2                                                  v.net.salesman(1)