Now showing items 51-60 of 2010
Hyper-mutation based genetic algorithms for dynamic multicast routing problem in mobile ad hoc networks.
In this paper, the problem of dynamic multicast routing in mobile ad hoc networks is investigated. Lots of interesting works have been done on multicast routing since it is proved to be a NP-hard problem. However, most of ...
Ant colony optimization with memory-based immigrants for the dynamic vehicle routing problem.
A recent integration showed that ant colony optimization (ACO) algorithms with immigrants schemes perform well on different variations of the dynamic travelling salesman problem. In this paper, we address ACO for the dynamic ...
Ant colony optimization with immigrants schemes for the dynamic vehicle routing problem.
Ant colony optimization (ACO) algorithms have proved to be able to adapt to dynamic optimization problems (DOPs) when they are enhanced to maintain diversity and transfer knowledge. Several approaches have been integrated ...
Evolutionary computation for dynamic optimization problems.
The anisotropic nature of the human vocal fold: an ex vivo study
(European Archives of Oto-Rhino-Laryngology, 2013-02)
The purpose of this study was to measure the relationship between the shear elastic properties of vocal fold with respect to the direction of applied stress. There is extensive published material that quantifies the shear ...
A hybrid evolutionary multiobjective approach for the dynamic component selection problem.
Component selection is a crucial problem in Component Based Software Engineering (CBSE). CBSE is concerned with the assembly of pre-existing software components that leads to a software system that responds to client-specific ...
A new extension of fuzzy sets using rough sets: R-Fuzzy Sets
This paper presents a new extension of fuzzy sets: R-fuzzy sets. The membership of an element of a R-fuzzy set is represented as a rough set. This new extension facilitates the representation of an uncertain fuzzy membership ...
Use of the q-Gaussian mutation in evolutionary algorithms.
This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real ...