Results 11 to 20 of about 13,344 (202)
Mathematics, 2022 Various studies have shown that the ant colony optimization (ACO) algorithm has a good performance in approximating complex combinatorial optimization problems such as traveling salesman problem (TSP) for real-world applications. However, disadvantages such as long running time and easy stagnation still restrict its further wide application in many ...
Shugang Li, Yanfang Wei, Xin Liu
exaly +3 more sources
Data mining with an ant colony optimization algorithm [PDF]
IEEE Transactions on Evolutionary Computation, 2002 The paper proposes an algorithm for data mining called Ant-Miner (ant-colony-based data miner). The goal of Ant-Miner is to extract classification rules from data. The algorithm is inspired by both research on the behavior of real ant colonies and some data mining concepts as well as principles.
Rafael Stubs Parpinelli +2 more
exaly +2 more sources
All-Optical Implementation of the Ant Colony Optimization Algorithm. [PDF]
Sci Rep, 2016 AbstractWe report all-optical implementation of the optimization algorithm for the famous “ant colony” problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit.
Hu W +4 more
europepmc +6 more sources
Dynamic impact for ant colony optimization algorithm [PDF]
Swarm and Evolutionary Computation, 2022 14 pages, 5 tables, 3 ...
Jonas Skackauskas +3 more
openaire +3 more sources
A novel quantum algorithm for ant colony optimisation [PDF]
IET Quantum Communication, 2021 Abstract Ant colony optimisation (ACO) is a commonly used meta‐heuristic to solve complex combinatorial optimisation problems like the travelling salesman problem (TSP), vehicle routing problem (VRP) etc. However, classical ACO algorithms provide better optimal solutions but do not reduce computation time overhead to a significant ...
Mrityunjay Ghosh +3 more
openaire +3 more sources
A memetic ant colony optimization algorithm for the dynamic travelling salesman problem [PDF]
, 2010 Copyright @ Springer-Verlag 2010.Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments.
Yang, S +5 more
core +3 more sources
An improved ant colony optimization algorithm for wire optimization
Bulletin of Electrical Engineering and Informatics, 2020 Wire optimization has become one of the greatest challenges in today’s circuit design. This paper presents a method for wire optimization in circuit routing using an improved ant colony optimization with Steiner nodes (ACOSN) algorithm. Circuit delay and power dissipation are primarily affected by the length of the routed wire.
Ho Joon Jim, Fazida Hanim Hashim
openaire +3 more sources
Ant Colony Optimization Algorithm for Workforce Planning [PDF]
Annals of Computer Science and Information Systems, 2017 The workforce planning helps organizations to optimize the production process with aim to minimize the assigning costs. A workforce planning problem is very complex and needs special algorithms to be solved. The problem is to select set of employers from a set of available workers and to assign this staff to the jobs to be performed.
Stefka Fidanova +4 more
openaire +1 more source
Orthogonal methods based ant colony search for solving continuous optimization problems [PDF]
, 2008 Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation.
Jun Zhang +5 more
core +1 more source
Runtime Analysis of a Simple Ant Colony Optimization Algorithm [PDF]
Algorithmica, 2006 Reihe CI;200 ...
Frank Neumann 0001, Carsten Witt
openaire +9 more sources