Presentation and options Dialog box of the application
Syntax

Presentation and options

This program determines the optimal routes between a set of origin locations and a set of possible destination locations. The optimal route between a pair of origin-destination locations will be the one that minimizes the displacement to go from the origin to the destination, either in time, distance or by a numeric field defined by the user that represents any other variable that weighs the cost of the displacement. The program has several options:

The origin locations and the possible destination locations must be connected to the network that defines the set of possible routes. This means that they correspond to nodes of the arco/node topology of MiraMon. The type of location is determined by the values of a field in the node database (*N.dbf) that the user must create and fill in (if this information is in a point layer, it can be transferred to the node layer using the PNT->NOD mode of the AtriTop application). The accepted values in this field are:

On the other hand, the arcs determine the direct connections between nodes and in their database (*A.dbf) there must be fields that define the costs associated with each connection (for example, if you want to apply time optimization, a field that defines the speed in each section would be necessary). Regarding the distance, the topological field of ellipsoidal length will be used whenever it exists and the user does not specify an alternative field. If it did not exist, the topological field of planimetric length would be used (both are created by default when generating line-type vectors). If, on the contrary, the user provides an own field, it will be checked that the values ??are valid, that is, numerical and greater than zero. In case of invalid values, the program will stop its execution.

The resulting file is a table in DBF format that allows establishing a relationship between each source node and a destination node that optimizes its path (as long as there is at least one sequence of arcs that connects the source node with the destination node and its cumulative cost is lower than the maximum cost specified in the command line). It must be considered that the same destination node can be the end of several optimal routes or not at all.

The costs of each optimal route found are displayed on the screen and saved in the specified DBF table. The resulting values are expressed in the same units as the fields involved (for example, when a speed field is used in km/h the accumulated distances are given in km and the accumulated times in hours. To be able to perform the calculations correctly the fields involved should have the units described in the metadata and these must be recognized by MiraMon. In case of using units not recognized by MiraMon, the user must contact the programming.


Dialog box of the application

Rutes dialog box


Syntax

Syntax:

Options:

Parameters:

Modifiers: