Performance assessment of the metaheuristic optimization algorithms: an exhaustive review
The simulation-driven metaheuristic algorithms have been successful in solving numerous
problems compared to their deterministic counterparts. Despite this advantage, the …
problems compared to their deterministic counterparts. Despite this advantage, the …
Ant colony optimization
Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
[HTML][HTML] Optimizing VM allocation and data placement for data-intensive applications in cloud using ACO metaheuristic algorithm
Nowadays data-intensive applications for processing big data are being hosted in the cloud.
Since the cloud environment provides virtualized resources for computation, and data …
Since the cloud environment provides virtualized resources for computation, and data …
[图书][B] Handbook of bioinspired algorithms and applications
This authoritative handbook reveals the connections between bioinspired techniques and
the development of solutions to problems that arise in diverse problem domains. It provides …
the development of solutions to problems that arise in diverse problem domains. It provides …
Fixed interval scheduling: Models, applications, computational complexity and algorithms
The defining characteristic of fixed interval scheduling problems is that each job has a finite
number of fixed processing intervals. A job can be processed only in one of its intervals on …
number of fixed processing intervals. A job can be processed only in one of its intervals on …
An ant colony optimization algorithm with improved pheromone correction strategy for the minimum weight vertex cover problem
R Jovanovic, M Tuba - Applied Soft Computing, 2011 - Elsevier
The minimum weight vertex cover problem is an interesting and applicable NP-hard problem
that has been investigated from many different aspects. The ant colony optimization …
that has been investigated from many different aspects. The ant colony optimization …
Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem
R Jovanovic, M Tuba - Computer Science and Information Systems, 2013 - doiserbia.nb.rs
In this paper an ant colony optimization (ACO) algorithm for the minimum connected
dominating set problem (MCDSP) is presented. The MCDSP become increasingly important …
dominating set problem (MCDSP) is presented. The MCDSP become increasingly important …
Ant colony optimization for the examination scheduling problem
KA Dowsland, JM Thompson - Journal of the Operational …, 2005 - Taylor & Francis
Ant colony optimization is an evolutionary search procedure based on the way that ant
colonies cooperate in locating shortest routes to food sources. Early implementations …
colonies cooperate in locating shortest routes to food sources. Early implementations …
An effective local search for the maximum clique problem
K Katayama, A Hamamoto, H Narihisa - Information Processing Letters, 2005 - Elsevier
We propose a variable depth search based algorithm, called k-opt local search (KLS), for the
maximum clique problem. KLS efficiently explores the k-opt neighborhood defined as the set …
maximum clique problem. KLS efficiently explores the k-opt neighborhood defined as the set …
Structural link prediction based on ant colony approach in social networks
As the size and number of online social networks are increasing day by day, social network
analysis has become a popular issue in many branches of science. The link prediction is …
analysis has become a popular issue in many branches of science. The link prediction is …