[vc_empty_space][vc_empty_space]
A new heuristic method improvement for ring topology optimization: Proposal algorithm
Qamar S.a, Haryadi S.a, Syambas N.R.a
a School of Electrical Engineering and Informatics, Institut Teknologi Bandung (ITB), Bandung, 40132, Indonesia
[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2018 Journal of Communications.The issue of optimization is very important in designing computer network. Designing a ring topology is about connecting a set of point-shaped nodes which are each connected to two other points, thus forming a circular path forming a ring. This idea tries to formulate an algorithm to optimize the ring topology by using an approach that is on the Traveling Salesman Problem (TSP). There are two variables considered in TSP. Both are the strategy to find the node configuration which has minimum cost as well as the most minimum time consumption for its execution. To measure the extent to which the proposed algorithm can perform optimization, then made a comparison with some existing algorithms such as Brute force, Ant colony, and Bambang. Brute Force has the ability to find the absolute minimum node configuration cost but in terms of time to complete it increases exponentially. While it does not provide the minimum cost, the Ant Colony Optimization algorithm (ACO) has the minimal advantage needed to find the minimum node configuration. This paper proposes a heuristic algorithm to find the sub-minimum node configuration. The proposed algorithm has the shortest time of fewer than 50 seconds to 50 nodes, compared to other algorithms while the cost of node configuration is not always lower than Ant Colony.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Ant colony,Brute force,Heuristic,Network design,Ring toplogy,Routing algorithm,TSP[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text]Manuscript received April 16, 2018; revised September 12, 2018. This work was supported by LPDP (Lembaga Pengelola Dana Pendidikan), Menistry of Finance, Republic of Indonesia Corresponding author email: syamsul27@students.itb.ac.id doi:10.12720/jcm.13.10.607-611[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.12720/jcm.13.10.607-611[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]