SPANNING TREE MODEL MINIMUM

The algorithm of minimum spanning tree is a model network optimization of linking all network
nodes directly and / or indirectly with the aim that the total length of the arcs or branches is minimal
(read by length arc a variable amount depending on the operational context of minimization, and
that may well represent a distance or unit of measure).

Be:

N = {1,2,3, ..., n} the set of network nodes.

Ck = set of nodes that have been linked permanently at iteration k
Ck = set of nodes that are required for binding permanently.

STEP ZERO (0): CONCEPTUALIZATION ALGORITHM

Define the sets C0 = {O} and c0 = {N}, ie before step 1 have not been linked permanently node one,
and therefore the whole representing the nodes that are required for binding permanently it is
equal to the number of nodes that exist on the network.

STEP 1:

You must select a node j of the set Ck-1 ( "k-1" is the subscript indicating that it is making the whole
of the immediately previous iteration reference) which has the arc or branch with shorter length
with one of the nodes that are in the set of nodes permanent link CK-1. Once selected is due to link
permanently representing that becomes part of the set of permanent links and no longer part of the
group that still must be connected to achieve expansion. When updating the algorithm in this step
sets should be as follows.

CK = CK-1 + {j} while K = Ck-1 - {j}

The general step that defines k at the same time represents the iterations must run every time that
the set K not empty, when this set is equal to empty the minimum spanning tree will have.

Understanding the algorithm from the algebraic point of view is perhaps the simplest, however by
graphic example see it is a very simple to elaborate algorithm.

THE PROBLEM

Cali has a new partial housing plan which will include the development of more than 7 housing
projects to be located on the outskirts of the city. Since the land on which it is built was not so far
within the urbanized areas of the city, the municipal water does not have the necessary
infrastructure to meet the needs of public services in water supply. Each housing projects started
construction of a node aqueduct mother, which has connections units of each project housing (ie
every mother node only needs to be connected with mother pipeline of municipal water to have
their supply). The municipal aqueduct to see the situation of the partial plan must work the works
related to the installation of mothers pipeline linking all nodes in the plan with the Melendez node
(node which is supplied with water and does not belong to the partial plan housing, is also the
closest to it), installation of pipelines involves excavation, labor and costs of the products
themselves, thus optimizing the overall length of the links is essential. The distances (given in
kilometers) for the feasible routes able to link the nodes of the partial plan are presented below. In
addition, the pumping capacity of the node Melendez is more than enough to meet the needs of
pressure that needs the mother network.

The municipal water contacts you for using their knowledge in network theory to build a network
expansion that minimizes the total length of pipelines and link all nodes in the partial housing plan.

STEP 0:

the initial sets C0 = {O} corresponding to the set of nodes linked permanently in the iteration
indicated in the subscript are defined and c0 = {N = 1,2,3,4,5,6,7,8} that It is the set of nodes pending
for bind permanently in the iteration indicated in the subscript.

STEP 1:

It must be defined arbitrarily the first permanent node set c0, in this case we will choose the node
1 (can be any other) that algebraically is represented by the letter i, proceed to update the initial
sets thus C1 = { i} = {1} and {c0 = N - i} = {2,3,4,5,6,7,8}, k therefore update will now be equal to 2.

STEP 2:

Now you must select the j node in the K-1 (ie the set of step 1) which present the bow with the
shortest length and that is linked to one of the nodes permalink the set Ck-1 in the which now only
node 1 is (ie to be to find a node having the smaller arc length linked to node 1).
Arcs or branches orange represent the arches that link the set K-1 (ie the set of step 1, remember
that K in this step is 2, therefore Ck-1 = C1) with nodes link permanent set Ck-1 which now only is
node 1 therefore now only need to choose the shorter, which in this case is the arc length of which
is 2 links permanently now Node 2.

When updating the sets are as follows:

C2 = {1,2} y 2 = {3, 4, 5, 6, 7,8}

Now we proceed to update k as it proceeds to the next iteration. Now a new node j set 2que this
link (branch or arc) shorter with nodes that are in the set C2 is selected.

Orange arcs represent possible links and since there is a tie between the lower lengths is chosen
arbitrarily, in this case depicted with a bow our choice of green, now permanently linking node 4.

When updating the sets are as follows:

C3 = {1,2,4} and 3 = {3,5,6,7,8}

Now we proceed to update k as it proceeds to the next iteration.
Which represent the orange and green arcs is known, now the blue line will tracing interrupted our
final expansion tree. Given the minor arc length is 3 now permanently link node 5.

When updating the sets are as follows:

C4 = {1,2,4,5} y 4 = {3,6,7,8}
Now we proceed to update k as it proceeds to the next iteration.

Now held permanently node 7.

When updating the sets are as follows:

C5 = {1,2,4,5,7} y 5 = {3,6,8}

Now we proceed to update k as it proceeds to the next iteration.

Now held permanently node 6.

When updating the sets are as follows:

C6 = {1,2,4,5,7,6} y 6 = {3,8}
Now we proceed to update k as it proceeds to the next iteration.

ties are broken arbitrarily, now held permanently node 3.

When updating the sets are as follows:

C7 = {1,2,4,5,7,6,3} y 7 = {8}
Now we proceed to update k as it proceeds to the last iteration.
Now held permanently node 8.

When updating the sets are as follows:

C8 = {1,2,4,5,7,6,3,8} = {N} y 8 = {}
Therefore it has reached the minimum spanning tree

Tree has a total length of 21 kilometers minimized pipeline.

http://www.ingenieriaindustrialonline.com/herramientas-para-el-ingeniero-
industrial/investigaci%C3%B3n-de-operaciones/teor%C3%ADa-de-redes/