A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks

Local access networks (LAN) are commonly used as communication infrastructures which meet the demand of a set of users in the local environment. Usually these networks consist of several LAN segments connected by bridges. The topological LAN design bi-level problem consists on assigning users to cl...

Descripción completa

Detalles Bibliográficos
Autores principales: Waldorp, Lourens J., Camacho Vallejo, José Fernando, Mar Ortiz, Julio, López Ramos, Francisco, Pedraza Rodríguez, Ricardo
Formato: Artículo
Lenguaje:inglés
Publicado: Public Library of Science 2015
Acceso en línea:http://eprints.uanl.mx/14955/1/126.pdf
_version_ 1824414203631370240
author Waldorp, Lourens J.
Camacho Vallejo, José Fernando
Mar Ortiz, Julio
López Ramos, Francisco
Pedraza Rodríguez, Ricardo
author_facet Waldorp, Lourens J.
Camacho Vallejo, José Fernando
Mar Ortiz, Julio
López Ramos, Francisco
Pedraza Rodríguez, Ricardo
author_sort Waldorp, Lourens J.
collection Repositorio Institucional
description Local access networks (LAN) are commonly used as communication infrastructures which meet the demand of a set of users in the local environment. Usually these networks consist of several LAN segments connected by bridges. The topological LAN design bi-level problem consists on assigning users to clusters and the union of clusters by bridges in order to obtain a minimum response time network with minimum connection cost. Therefore, the decision of optimally assigning users to clusters will be made by the leader and the follower will make the decision of connecting all the clusters while forming a spanning tree. In this paper, we propose a genetic algorithm for solving the bi-level topological design of a Local Access Network. Our solution method considers the Stackelberg equilibrium to solve the bilevel problem. The Stackelberg-Genetic algorithm procedure deals with the fact that the follower’s problem cannot be optimally solved in a straightforward manner. The computational results obtained from two different sets of instances show that the performance of the developed algorithm is efficient and that it is more suitable for solving the bi-level problem than a previous Nash-Genetic approach.
format Article
id eprints-14955
institution UANL
language English
publishDate 2015
publisher Public Library of Science
record_format eprints
spelling eprints-149552024-03-07T16:55:20Z http://eprints.uanl.mx/14955/ A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks Waldorp, Lourens J. Camacho Vallejo, José Fernando Mar Ortiz, Julio López Ramos, Francisco Pedraza Rodríguez, Ricardo Local access networks (LAN) are commonly used as communication infrastructures which meet the demand of a set of users in the local environment. Usually these networks consist of several LAN segments connected by bridges. The topological LAN design bi-level problem consists on assigning users to clusters and the union of clusters by bridges in order to obtain a minimum response time network with minimum connection cost. Therefore, the decision of optimally assigning users to clusters will be made by the leader and the follower will make the decision of connecting all the clusters while forming a spanning tree. In this paper, we propose a genetic algorithm for solving the bi-level topological design of a Local Access Network. Our solution method considers the Stackelberg equilibrium to solve the bilevel problem. The Stackelberg-Genetic algorithm procedure deals with the fact that the follower’s problem cannot be optimally solved in a straightforward manner. The computational results obtained from two different sets of instances show that the performance of the developed algorithm is efficient and that it is more suitable for solving the bi-level problem than a previous Nash-Genetic approach. Public Library of Science 2015 Article PeerReviewed text en cc_by_nc_nd http://eprints.uanl.mx/14955/1/126.pdf http://eprints.uanl.mx/14955/1.haspreviewThumbnailVersion/126.pdf Waldorp, Lourens J. y Camacho Vallejo, José Fernando y Mar Ortiz, Julio y López Ramos, Francisco y Pedraza Rodríguez, Ricardo (2015) A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks. PloS one, 10 (6). e0128067. ISSN 1932-6203 doi:10.1371/journal.pone.0128067
spellingShingle Waldorp, Lourens J.
Camacho Vallejo, José Fernando
Mar Ortiz, Julio
López Ramos, Francisco
Pedraza Rodríguez, Ricardo
A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks
thumbnail https://rediab.uanl.mx/themes/sandal5/images/online.png
title A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks
title_full A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks
title_fullStr A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks
title_full_unstemmed A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks
title_short A Genetic Algorithm for the Bi-Level Topological Design of Local Area Networks
title_sort genetic algorithm for the bi level topological design of local area networks
url http://eprints.uanl.mx/14955/1/126.pdf
work_keys_str_mv AT waldorplourensj ageneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT camachovallejojosefernando ageneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT marortizjulio ageneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT lopezramosfrancisco ageneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT pedrazarodriguezricardo ageneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT waldorplourensj geneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT camachovallejojosefernando geneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT marortizjulio geneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT lopezramosfrancisco geneticalgorithmforthebileveltopologicaldesignoflocalareanetworks
AT pedrazarodriguezricardo geneticalgorithmforthebileveltopologicaldesignoflocalareanetworks