[GRASSweb-list]markus: web/grass51/tutorial network.html,1.9,1.10

[grass at intevation.de]

Author: markus

Update of /grassrepository/web/grass51/tutorial
In directory doto:/tmp/cvs-serv6252

Modified Files:
	network.html 
Log Message:
draft example on traveling salesman added (v.net.salesman)

Index: network.html
===================================================================
RCS file: /grassrepository/web/grass51/tutorial/network.html,v
retrieving revision 1.9
retrieving revision 1.10
diff -u -d -r1.9 -r1.10
--- network.html	13 Aug 2003 16:22:01 -0000	1.9
+++ network.html	13 Aug 2003 16:58:23 -0000	1.10
@@ -471,9 +471,10 @@
 d.vect broadband_map col=red
 </pre></div>
 
+<P>
 City of Osnabr&uuml;ck - optimal broadband connection of hospitals for
 telemedicine applications (click to enlarge): <br>
-<a href=images/v.net.steiner.hospitals.png><DEFANGED_IMG src=images/v.net.steiner.hospitals_small.png alt="City of Osnabr&uuml;ck - optimal broadband connection of hospitals"></a>
+<a href=images/v.net.steiner.hospitals.png><DEFANGED_IMG src=images/v.net.steiner.hospitals_small.jpg alt="City of Osnabr&uuml;ck - optimal broadband connection of hospitals"></a>
 
 
 <p><table width="100%" cellpadding="3" border="0">
@@ -485,7 +486,24 @@
 
 Creates a network cycle by connecting given nodes (Traveling salesman problem).
 <P>
-TODO
+Think that you should introduce medical equipment to all hospitals in the
+town. You want to minimize the travel route. This is the traveling salesman
+problem, which can be addressed in GRASS.
+<P>
+TODO (in fact identical preparation up to v.net.steiner from above)
+<P>
+
+Now we calculate the shortest route to visit all hospitals:
+
+<div class="code"><pre>
+v.net.salesman in=h_network_clean output=salesman nfield=1 ccats=40-300
+</pre></div>
+
+<P>
+City of Osnabr&uuml;ck - traveling salesman (click to enlarge): <br>
+<a href=images/v.net.salesman.hospitals.png><DEFANGED_IMG src=images/v.net.salesman.hospitals_small.jpg alt="City of Osnabr&uuml;ck - traveling salesman"></a>
+
+
 
 <hr>
 <P>