Now showing items 1-10 of 218
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.
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 ...
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 ...
A comparative study on particle swarm optimization in dynamic environments.
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods.
(World Federation on Soft Computing (WFSC), 2011)
In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the ...
An improved constraint satisfaction adaptive neural network for job-shop scheduling.
This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems. The neural network is constructed based on the constraint conditions of a job-shop scheduling problem. Its ...