ABSTRACT

Alamsyah, Computing a Minimum Spanning Tree using the Ant Algorithm  (supervised by Rhiza S. Sadjad and Armin Lawi).

This is a design project to develop a computer program to athe Ant Algorithm to find a Minimum Spanning Tree of the telephone cable lay-out planning problem for a real-estate area.

The real-estate is located at Perumahan Citra Landin MAKASSAR, Indonesia. It is a roughly …..... square-meters of suburban housing region planned to be served by a Main Distribution Point (Rumah Kabel, RK) and 41 Distribution Points (DP) of the conventional public telephone network. The optimum length of the telephone cable connecting the Main Distribution Points and the 41 Distribution Points is computed heuristically using the Ant Algorithm as the Minimum Spanning Tree.

The number of ants (m) and the maximum number of cycles (NCmax) are  the most influential among other Ant Algorithm parameters such as a, b, r, z Q in providing a convergent solution consistently. In the case of Perumahan Citra Land MAKASSAR, the number of ants m= 700 and the maximum number of cycles NCmax= 400 has provided an optimum solution of …............. meters  of the telephone cable to connect the 41 Distribution Points to the Main Distribution Point. The computaion time to get the result is 73,8 ms in 53 optimum cycles with 25% of the other results agree with the main result.

Keyword:  Minimum Spanning Tree, Optimum Cycles, Ant Algorithm, heuristic, Ant Algorithm.