Evolutionary design of oriented-tree networks using Cayley-type encodings

Authors:
Sancho Salcedo-Sanz;Maurizio Naldi;Ángel M. Pérez-Bellido;Antonio Portilla-Figueras;Emilio G. Ortiz-García
Affiliations:
Departamento de Teoría de la Señal y Comunicaciones, Universidad de Alcalá de Henares, Campus Universitario, 28871 Alcalá de Henares, Madrid, Spain;Department of Informatics, Systems and Production, Universitá di Roma II, "Tor Vergata", Rome, Italy;Departamento de Teoría de la Señal y Comunicaciones, Universidad de Alcalá de Henares, Campus Universitario, 28871 Alcalá de Henares, Madrid, Spain;Departamento de Teoría de la Señal y Comunicaciones, Universidad de Alcalá de Henares, Campus Universitario, 28871 Alcalá de Henares, Madrid, Spain;Departamento de Teoría de la Señal y Comunicaciones, Universidad de Alcalá de Henares, Campus Universitario, 28871 Alcalá de Henares, Madrid, Spain
Venue:
Information Sciences: an International Journal
Year:
2009

Citing 11
Cited 2

Algorithms for path medi-centers of a tree

Computers and Operations Research - location science
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Local solutions for global problems in wireless networks

Journal of Discrete Algorithms
Design of capacitated minimum spanning tree with uncertain cost and demand parameters

Information Sciences: an International Journal
An efficient network-wide broadcasting based on hop-limited shortest-path trees

Computer Networks: The International Journal of Computer and Telecommunications Networking
On embedding subclasses of height-balanced trees in hypercubes

Information Sciences: an International Journal
A graph-based Lamarckian-Baldwinian hybrid for the sorting network problem

IEEE Transactions on Evolutionary Computation
From the Dandelion Code to the Rainbow code: a class of bijective spanning tree representations with linear complexity and bounded locality

IEEE Transactions on Evolutionary Computation
The edge-window-decoder representation for tree-based problems

IEEE Transactions on Evolutionary Computation
A multiobjective hybrid genetic algorithm for the capacitatedmultipoint network design problem

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A bijective code for k-trees with linear time encoding and decoding

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Path lengths in tree-child time consistent hybridization networks

Information Sciences: an International Journal
Stochastic comparisons for rooted butterfly networks and tree networks, with random environments

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper introduces the oriented-tree network design problem (OTNDP), a general problem of tree network design with several applications in different fields. We also present several adaptations needed by evolutionary algorithms with Cayley-type encodings to tackle the OTNDP. In particular, we present these adaptations in two Cayley-encodings known as Prufer and Dandelion codes. We include changes in Cayley-encodings to consider rooted trees. We also show how to use a fixed-length encoding for Cayley codes in evolutionary algorithms, and how to guarantee that the optimal solution is included in the search space. Finally, we present several adaptations of the evolutionary algorithm's operators to deal with Cayley-encodings for the OTNDP. In the experimental part of the paper, we compare the performance of an evolutionary algorithm (implementing the two Cayley-encodings considered) in several OTNDP instances: first, we test the proposed techniques in randomly generated instances, and second, we tackle a real application of the OTNDP: the optimal design of an interactive voice response system (IVR) in a call center.