Now showing items 1-10 of 20
QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms.
In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval ...
Metaheuristics for dynamic combinatorial optimization problems.
(The Institute of Mathematics and its Applications., 2012)
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints ...
Empirical study on the effect of population size on MAX-MIN ant system in dynamic environments
(IEEE Press, 2016-07)
In this paper, the effect of the population size on the performance of the MAX -MIN ant system for dynamic optimization problems (DOPs) is investigated. DOPs are generated with the dynamic benchmark generator for ...
Ant colony optimization with self-adaptive evaporation rate in dynamic environments
(IEEE Press, 2014-12)
The performance of ant colony optimization (ACO) algorithms in tackling optimization problems strongly depends on different parameters. One of the most important parameters in ACO algorithms when addressing dynamic ...
Greedy random adaptive memory programming search for the capacitated clustering problem
Ant algorithms with immigrants schemes for the dynamic vehicle routing problem
Many real-world optimization problems are subject to dynamic environments that require an optimization algorithm to track the optimum during changes. Ant colony optimization (ACO) algorithms have proved to be powerful ...
Training neural networks with ant colony optimization algorithms for pattern classification
Feed-forward neural networks are commonly used for pattern classification. The classification accuracy of feed-forward neural networks depends on the configuration selected and the training process. Once the architecture ...
A memetic ant colony optimization algorithm for the dynamic travelling salesman problem.
Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP ...
Multi-colony ant algorithms for the dynamic travelling salesman problem
(IEEE Press, 2014-12)
A multi-colony ant colony optimization (ACO) algorithm consists of several colonies of ants. Each colony uses a separate pheromone table in an attempt to maximize the search area explored. Over the years, multi-colony ACO ...
Ant colony optimization with local search for dynamic travelling salesman problems
For a dynamic travelling salesman problem, the weights (or travelling times) between two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms have proved to be powerful methods to tackle ...