loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Eugénia Moreira Bernardino 1 ; Anabela Moreira Bernardino 1 ; Juan Manuel Sánchez-Pérez 2 ; Juan Antonio Gomez Pulido 2 and Miguel Ángel Vega-Rodríguez 2

Affiliations: 1 Polytechnic Institute of Leiria, Portugal ; 2 University of Extremadura, Spain

Keyword(s): Communication networks, Optimization algorithms, Ant colony optimization algorithm, Terminal assignment problem.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Computational Intelligence ; Evolutionary Computing ; Genetic Algorithms ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Soft Computing ; Swarm Intelligence

Abstract: The past two decades have witnessed tremendous research activities in optimization methods for communication networks. One important problem in communication networks is the Terminal Assignment Problem. This problem involves determining minimum cost links to form a network by connecting a collection of terminals to a collection of concentrators. In this paper, we propose a Hybrid Ant Colony Optimization Algorithm to solve the Terminal Assignment Problem. We compare our results with the results obtained by the standard Genetic Algorithm, the Tabu Search Algorithm and the Hybrid Differential Evolution Algorithm, used in literature.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.133.157.133

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Moreira Bernardino, E.; Moreira Bernardino, A.; Manuel Sánchez-Pérez, J.; Antonio Gomez Pulido, J. and Ángel Vega-Rodríguez, M. (2009). A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM. In Proceedings of the International Joint Conference on Computational Intelligence (IJCCI 2009) - ICEC; ISBN 978-989-674-014-6; ISSN 2184-3236, SciTePress, pages 144-151. DOI: 10.5220/0002322001440151

@conference{icec09,
author={Eugénia {Moreira Bernardino}. and Anabela {Moreira Bernardino}. and Juan {Manuel Sánchez{-}Pérez}. and Juan {Antonio Gomez Pulido}. and Miguel {Ángel Vega{-}Rodríguez}.},
title={A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM},
booktitle={Proceedings of the International Joint Conference on Computational Intelligence (IJCCI 2009) - ICEC},
year={2009},
pages={144-151},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002322001440151},
isbn={978-989-674-014-6},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the International Joint Conference on Computational Intelligence (IJCCI 2009) - ICEC
TI - A HYBRID ANT COLONY OPTIMIZATION ALGORITHM FOR SOLVING THE TERMINAL ASSIGNMENT PROBLEM
SN - 978-989-674-014-6
IS - 2184-3236
AU - Moreira Bernardino, E.
AU - Moreira Bernardino, A.
AU - Manuel Sánchez-Pérez, J.
AU - Antonio Gomez Pulido, J.
AU - Ángel Vega-Rodríguez, M.
PY - 2009
SP - 144
EP - 151
DO - 10.5220/0002322001440151
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic