Result: Metaheuristics for optimization problems in computer communications

Title:
Metaheuristics for optimization problems in computer communications
Source:
Computer communications. 30(4):656-669
Publisher Information:
Amsterdam; New York, NY; Tokyo: Elsevier Science, 2007.
Publication Year:
2007
Physical Description:
print, 83 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Automatique théorique. Systèmes, Control theory. Systems, Robotique, Robotics, Algorithme génétique, Genetic algorithm, Algoritmo genético, Algorithme parallèle, Parallel algorithm, Algoritmo paralelo, Algorithme recherche, Search algorithm, Algoritmo búsqueda, Méthode heuristique, Heuristic method, Método heurístico, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème combinatoire, Combinatorial problem, Problema combinatorio, Programmation mathématique, Mathematical programming, Programación matemática, Préhension, Gripping, Prension, Recherche tabou, Tabu search, Búsqueda tabú, Recuit simulé, Simulated annealing, Recocido simulado, Routage, Routing, Enrutamiento, Réseau communication, Communication network, Red de comunicación, Réseau télécommunication, Telecommunication network, Red telecomunicación, Système réparti, Distributed system, Sistema repartido, Technologie communication, Communication technology, Tecnología comunicacíon, Télécommunication, Telecommunication, Telecomunicación, Communications, Metaheuristics, Networks, Telecommunications: Computers
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Universidade Federal Fluminense, Department of Computer Science, Rua Passo da Pdtria 156, Niterói, RJ 24210-240, Brazil
Universidade Federal Fluminense, Pólo Universitário de Rio das Ostras, Rua Recife, Quadra 7, Rio das Ostras, RJ 28890-000, Brazil
ISSN:
0140-3664
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18529344
Database:
PASCAL Archive

Further Information

Recent years have witnessed huge advances in computer technology and communication networks, entailing hard optimization problems in areas such as network design and routing. Metaheuristics are general high-level procedures that coordinate simple heuristics and rules to find good approximate solutions to computationally difficult combinatorial optimization problems. They are among the most effective solution strategies for solving optimization problems in practice and have been applied to a very large variety of problems in telecommunications, computer communications, and network design and routing. In this paper, we review the principles associated with some of the main metaheuristics and we give templates for basic implementations of them: simulated annealing, tabu search, GRASP, VNS, genetic algorithms, and path-relinking. The main strategies underlying the development of parallel implementations of metaheuristics are also reviewed. Finally, we present an account of some successful applications of metaheuristics to optimization problems in telecommunications, computer communications, and network design and routing.