Now showing items 1-10 of 18
Greedy random adaptive memory programming search for the capacitated clustering problem
Memory-based multi-population genetic learning for dynamic shortest path problems
(IEEE Press, 2019-06)
This paper proposes a general algorithm framework for solving dynamic sequence optimization problems (DSOPs). The framework adapts a novel genetic learning (GL) algorithm to dynamic environments via a clustering-based ...
Hybrid meta-heuristic algorithms for independent job scheduling in grid computing
The term ’grid computing’ is used to describe an infrastructure that connects geographically distributed computers and heterogeneous platforms owned by multiple organizations allowing their computational power, storage ...
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 ...
A survey of swarm intelligence for dynamic optimization: Algorithms and applications
Swarm intelligence (SI) algorithms, including ant colony optimization, particle swarm optimization, bee-inspired algorithms, bacterial foraging optimization, firefly algorithms, fish swarm optimization and many more, have ...
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 ...
An Ant Colony Optimization Based Memetic Algorithm for the Dynamic Travelling Salesman Problem
(ACM Press, 2015-07)
Ant colony optimization (ACO) algorithms have proved to be able to adapt for solving dynamic optimization problems (DOPs). The integration of local search algorithms has also proved to significantly improve the output of ...
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 ...
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 ...
Pheromone modification strategy for the dynamic travelling salesman problem with weight changes
Ant colony optimization (ACO) algorithms have proved to be able to adapt in problems that change dynamically. One of the key issues for ACO when a change occurs is that the pheromone trails generated in the previous ...