• Corpus ID: 7810856

Representation of Evolutionary Algorithms in FPGA Cluster for Project of Large-Scale Networks

@article{Perina2014RepresentationOE,
  title={Representation of Evolutionary Algorithms in FPGA Cluster for Project of Large-Scale Networks},
  author={Andr{\'e} Bannwart Perina and Marcilyanne Moreira Gois and Paulo Matias and Jo{\~a}o MP Cardoso and Alexandre Cl{\'a}udio Botazzo Delbem and Vanderlei Bonato},
  journal={ArXiv},
  year={2014},
  volume={abs/1412.5384}
}
Many problems are related to network projects, such as electric distribution, telecommunication and others. Most of them can be represented by graphs, which manipulate thousands or millions of nodes, becoming almost an impossible task to obtain real-time solutions. Many efficient solutions use Evolutionary Algorithms (EA), where researches show that performance of EAs can be substantially raised by using an appropriate representation, such as the Node-Depth Encoding (NDE). The objective of this… 

Figures and Tables from this paper

References

SHOWING 1-6 OF 6 REFERENCES

A Parallel Hardware Architecture based on Node-Depth Encoding to Solve Network Design Problems

This paper proposes a parallelization of the node-depth encoding (NDE), a data structure especially designed for NDPs, and develops a parallel algorithm and a hardware architecture implemented on FPGA, denominated Hardware Parallelized NDE (HP-NDE).

Node-depth encoding and multiobjective evolutionary algorithm applied to large-scale distribution system reconfiguration

The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks, with results showing the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s.

Efficient Forest Data Structure for Evolutionary Algorithms Applied to Network Design

This work proposes a new data structure, called node-depth-degree representation (NDDR), and it is demonstrated that using this encoding, generating a new spanning forest requires average time O(√n), and experiments with an EA based on NDDR have shown that the implementation adds small constants and lower order terms to the theoretical bound.

A new evolutionary approach to the degree-constrained minimum spanning tree problem

This paper introduces a novel tree construction algorithm called the randomized primal method (RPM) which builds degree-constrained trees of low cost from solution vectors taken as input, and provides strong evidence that the genetic algorithm employing RPM finds significantly lower-cost solutions to random graph d-MST problems than rival methods.

The node-depth encoding: analysis and application to the bounded-diameter minimum spanning tree problem

The node-depth encoding has elements from direct and indirect encoding for trees which encodes trees by storing the depth of nodes in a list and an investigation into the bias of the initialization process and the mutation operators of the node- depth encoding shows that it has a bias to solutions with small depths and diameters.

Evolutionary computation: a unified approach

  • C. Reeves
  • Biology
    Genetic Programming and Evolvable Machines
  • 2007
Ken De Jong carefully builds up a picture of the influences of selection, mutation and recombination on the behaviour of EAs, and takes a unified approach to EC theory.