Using of Clustering and Ant-Colony Algorithms CWSP-PAM-ANT in Network Planning

Network planning is a key importance to obtain a good functionality, price and quality of services of a network. The CWSP-PAM-ANT (clustering with shortest path-PAM and ant-colony algorithms) system starts by dividing the city map into clusters. For each cluster, the location of switch node is determined and finally connect each subscriber to this corresponding switch node. The system also determines the minimum cost network that satisfies the demand and constraints. The cluster partitioning around medoids (PAM) original algorithm has been modified and a new algorithm (CWSP-PAM algorithm) has been proposed by the author. In the present paper, the CWSP-PAM algorithm is modified by introducing the ant-colony-based algorithm in the second step of the network planning process to find the optimal path between any node and the corresponding switch node. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of network planning