• Nenhum resultado encontrado

Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators

N/A
N/A
Protected

Academic year: 2016

Share "Coarse-Grained Parallel Genetic Algorithm to solve the Shortest Path Routing problem using Genetic operators "

Copied!
4
0
0

Texto

Loading

Referências

Documentos relacionados

Using the latest demographic projections and a model of capital accumulation and productivity growth, we map out GDP growth, income per capita and currency movements in the

Lee and Kim [17] developed a parallel genetic algorithm for solving the problem of scheduling jobs for general earliness and tardiness penalties with a common due date..

The main idea of the routing-enabled QoS control mechanism of QoS-RRC consists in bootstrapping a routing table with shortest QoS-aware path information, including

This paper develops a hybrid fuzzy logic based genetic algorithm model to solve the multi-objective passenger railway scheduling problem aiming to optimize

• To locate modifications and changes in the construction materials (original building materials were adobe, masonry), rebar structure whilst later modi fications included bricks

Em primeiro lugar, uma abordagem histórica pode ajudar os gestores a reconhecerem que não há leis universais e que, como tal, só incorporando a história da organização e dos

Hence, this study examined beliefs regarding individuals suffering from mental disorders, the perception that they represent a threat, and, more objectively, the

In any case, the hybrid GA with DM and local search obtained, overall, the best results: it produced the best average solution in 22 out of the 36 problem instances.. In