Showing 1-25 of 16,429 resultsfor "Index Terms":Ant Colony Optimization algorithm
"Index Terms":Ant Colony Optimization algorithm
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
Backtracking Ant Colony Algorithm for the 0ߝ1 Knapsack Problem
The 2nd International Conference on Information Science and Engineering
Year: 2010 | Conference Paper |
The 0ߝ1 Knapsack Problem is of a class of typical combinational optimization problems and is NP-hard. It has important practical significance to study it. Based on the characteristics of the 0ߝ1 Knapsack Problem, we design a binary coding directed graph which makes the Ant Colony algorithm suitable for the Knapsack Problem. In addition, we also adopt the concept of backtracking from the Nested Par...Show More
Solving TSP by an ACO-and-BOA-based hybrid algorithm
2010 International Conference on Computer Application and System Modeling (ICCASM 2010)
Year: 2010 | Conference Paper |
Cited by: Papers (4)
Combined with the idea of the Bean Optimization algorithm (BOA), the ant colony optimization (ACO) algorithm is presented to solve the well known traveling salesman problem (TSP). The core of this algorithm is using BOA to optimize the control parameters of ACO which consist of heuristic factor, pheromone evaporation factor and random selection threshold, and applying ant colony system to solve tw...Show More
SamACO: Variable Sampling Ant Colony Optimization Algorithm for Continuous Optimization
An ant colony optimization (ACO) algorithm offers algorithmic techniques for optimization by simulating the foraging behavior of a group of ants to perform incremental solution constructions and to realize a pheromone laying-and-following mechanism. Although ACO is first designed for solving discrete (combinatorial) optimization problems, the ACO procedure is also applicable to continuous optimiza...Show More
Load balancing algorithms in heterogeneous web cluster
2018 International Interdisciplinary PhD Workshop (IIPhDW)
Year: 2018 | Conference Paper |
Cited by: Papers (3)
The load balancing is dedicated for distributed and parallel systems to manage the web cluster. It distributes the load among web servers using several scheduling algorithms. This paper investigates a detailed comparison of some HAProxy algorithms in heterogeneous web cluster as well as the meta-heuristic methods that inspired by the insects' colonies behavior such as Ant Colony Optimization algor...Show More
Optimization of Two-dimensional Path Optimization Algorithm Based on Dijkstra Ant Colony Optimization Algorithm
2024 2nd International Conference on Signal Processing and Intelligent Computing (SPIC)
Year: 2024 | Conference Paper |
Cited by: Papers (1)
To address the limitations of the traditional Dijkstra algorithm in two-dimensional path optimization problems, this article uses ant colony algorithm to optimize the Dijkstra algorithm, solving the limitations of the Dijkstra algorithm that requires path optimization in finite node graphs and is difficult to traverse the best path that matches actual situations. Generate initial path through Dijk...Show More
Swarm Intelligence Optimization Algorithm Based on Orthogonal Optimization
2010 Second International Conference on Computer Modeling and Simulation
Year: 2010 | Conference Paper |
Cited by: Papers (6)
The shortcomings of existing intelligent optimization algorithms are easy to produce premature convergence, easy to fall into local optimal equilibrium states, and poor efficiency at evolutionary late stage. In order to overcome the above shortcomings, a variety of new strategies and approaches were put forward by researchers in various countries. Although the orthogonal design has been applied to...Show More
New continuous Ant Colony Algorithm
2008 7th World Congress on Intelligent Control and Automation
Year: 2008 | Conference Paper |
Cited by: Papers (1)
Ant Colony Algorithm is a very good combination optimization method from mimic the swarm intelligence of ant colony behaviours. To extend the traditional Ant Colony Algorithm to continuous optimization problems, from the connections of continuous optimization and searching process of Ant Colony Algorithm, here one new Continuous Ant Colony Algorithm is proposed. To verify the new algorithm, the ty...Show More
An Ant Colony Algorithm for Text Clustering
2010 International Conference on Computing, Control and Industrial Engineering
Year: 2010 | Conference Paper |
Cited by: Papers (1)
In this article, a new PMACO algorithm is proposed for capacitated P-Median Problem (CPMP). It devised a set of performing strategies of Ant Colony Algorithm (ACO) in view of the characteristic of CPMP. These strategies include the selecting strategy of initial medians, the pheromone learning strategy of object-assignment means and pheromone-smoothness strategy. They insure the PMACO algorithm can...Show More
Hybrid Ant Colony Optimization Method for the Traveling Salesman Problem
2024 9th International Conference on Business and Industrial Research (ICBIR)
Year: 2024 | Conference Paper |
The traveling salesman problem (TSP) is a classic problem in computer science and operations research which involves finding the shortest possible route that visits a given set of cities. In this paper, we propose a hybrid algorithm for solving such problem. The algorithm combines the ant colony optimization (ACO) method with the 2-opt heuristic to improve the efficiency for solving the TSP. Insta...Show More
Application of the hybrid algorithm combining ant colony optimization algorithm with microgenetic algorithm to the optimization of multilayered radar absorbing coating
2008 International Conference on Microwave and Millimeter Wave Technology
Year: 2008 | Conference Paper |
Cited by: Papers (3)
A new optimization technique based on the hybrid algorithm combining ant colony optimization algorithm with microgenetic algorithm is presented for the design of multilayered radar absorbing materials. During the optimization procedure the optimization constrained conditions are different in order to meet the practical requirements in the different frequency bands between 2 GHz and 18 GHz, and the...Show More
Performance enhancement in image edge detection technique
2016 International Conference on Signal and Information Processing (IConSIP)
Year: 2016 | Conference Paper |
Cited by: Papers (2)
Edges are instant change in intensity value of pixels in the digital image. Image edge detection converts original image in to binary image. This binary image contains information about edges of digital image. Recently Ant Colony Optimization Meta-heuristic algorithm is used for the image edge detection. Ant colony optimization algorithm is inspired from the behaviour of real ants. From this ACO b...Show More
A modified Pareto strength ant colony optimization algorithm for the multi-objective optimization problems
2016 IEEE International Conference on Information and Automation for Sustainability (ICIAfS)
Year: 2016 | Conference Paper |
Cited by: Papers (3)
Ant colony optimization is a meta-heuristic that has been widely used for solving combinatorial optimization problems, and most real-world applications are concerned with multi-objective optimization problems. The Pareto strength ant colony optimization (PSACO) algorithm, which uses the concepts of Pareto optimality and also the domination concept, has been shown to be very effective in optimizing...Show More
Non-Dominated Sorting Multi-Objective Ant Colony Optimization Algorithm for Route Planning of UUV Target Search
2024 43rd Chinese Control Conference (CCC)
Year: 2024 | Conference Paper |
To solve the route planning problem for underwater target search by an underwater unmanned vehicle (UUV), the time of UUV movement under the influence of water currents and the target search gain associated with the moment when the UUV arrives at a certain mission point are considered as two competing and non-commensurable optimization objectives, which is defined as a multi-objective traveling sa...Show More
As a combinatorial optimization problem, vehicle routing problem (VRP) is a typical NP-hard problem; an assumption that the demand of customers can not be split is given to the traditional VRP formulation. However, the transportation cost can be reduced by means of splitting the demand of customers in practical logistics operation. This paper solved the split delivery vehicle routing problem (SDVR...Show More
Cooperative multi-ant colony pseudo-parallel optimization algorithm
The 2010 IEEE International Conference on Information and Automation
Year: 2010 | Conference Paper |
Cited by: Papers (3)
On account of the premature and stagnation of traditional ant colony algorithm, this paper proposes a cooperative multi-ant colony pseudo-parallel optimization algorithm, drawing lessons from the idea of the exclusion model and fitness sharing model of genetic algorithm. The algorithm makes multiple sub-ant colonies run different instance models of ant algorithm independently and concurrently, and...Show More
Comparative study on nature inspired algorithms for optimization problem
Ishani Luthra;Shubham Krishna Chaturvedi;Divya Upadhyay;Richa Gupta
2017 International conference of Electronics, Communication and Aerospace Technology (ICECA)
Year: 2017 | Conference Paper |
Cited by: Papers (10)
Nature inspired algorithms are gaining popularity for optimizing complex problems. These algorithms have been classified into 2 general categories, namely Evolutionary and Swarm Intelligence, which have further been divided into a couple of algorithms. This paper presents a comparative study between Bat Algorithm, Genetic algorithm, Artificial Bee Colony Algorithm and Ant Colony Optimization Algor...Show More
The beer recipe optimization is a effective way for reducing the brewing enterprises. Because the recipe optimization belongs to NP-hard problem, It is difficult to obtain the global optimal solution for the traditional optimization algorithm. Though ant colony optimization (ACO) is suitable for solving the combinatorial optimization problems, it still has weakness in solving continuous optimizati...Show More
Ant colony algorithm(ACA) is a novel simulated evolutionary algorithm, which is based on the process of ants in the nature searching for food. ACA has many good features in optimization, but it has the limitations of stagnation and poor convergence, and is easy to fall in local optimization. Pointing at these disadvantages, Artificial fish-swarm algorithm(AFSA) is presented to conquer the disadvan...Show More
A New Hybrid Ant Colony Algorithm for Clustering Problem
2008 International Workshop on Education Technology and Training & 2008 International Workshop on Geoscience and Remote Sensing
Year: 2008 | Conference Paper |
Cited by: Papers (1)
The known mathematical model for clustering problems is given in this paper. With the K-Means algorithm, the simulated annealing algorithm and a novel hybrid ant colony algorithm is integrated with the K-means algorithm to solve clustering problems. The advantages and shortages of K-Means algorithm, simulated annealing algorithm and the hybrid ant colony algorithm are then analyzed, so that effect...Show More
Fault Diagnosis and Recovery of Transmission Networks Using Improved Ant Colony Optimization Algorithm (ACO)
2024 International Conference on Power, Electrical Engineering, Electronics and Control (PEEEC)
Year: 2024 | Conference Paper |
In response to the problems of low diagnostic accuracy and low recovery efficiency in current research on fault diagnosis and recovery in transmission networks, this paper used an improved ant colony optimization algorithm to study it and improve the accuracy of fault diagnosis and recovery efficiency. It updated the pheromones of traditional ant algorithms and calculated the transition probabilit...Show More
FPGA-based path planning using improved Ant Colony Optimization Algorithm
2015 IEEE 5th International Conference on Consumer Electronics - Berlin (ICCE-Berlin)
Year: 2015 | Conference Paper |
Cited by: Papers (1)
This paper develops a novel path planning algorithm using improved ant colony optimization (ACO) and its FPGA implementation. The proposed approach can effectively increase the accuracy to generate an optimal path. The main idea of this paper is to avoid local minimum by continuous tuning of a setting parameter and the establishment of new mechanisms for opposite pheromone updating and partial phe...Show More
Research on AGV path planning based on PSO-IACO algorithm
2021 IEEE International Conference on Electrical Engineering and Mechatronics Technology (ICEEMT)
Year: 2021 | Conference Paper |
Cited by: Papers (3)
This paper proposes an improved ant colony optimization (IACO) algorithm to improve the optimization ability in AGV path planning. Firstly, aiming at the problem of initial parameter selecting relying on historical experience in the ant colony optimization (ACO) algorithm, the particle swarm optimization (PSO) algorithm is investigated to optimize the initial parameters in the ant colony algorithm...Show More
Research on AGV Path Planning Based on Gray wolf Improved Ant Colony Optimization
2022 5th International Conference on Robotics, Control and Automation Engineering (RCAE)
Year: 2022 | Conference Paper |
Cited by: Papers (3)
To promote the performance of AGV to optimize the path in the obstacle environment, the paper proposes an improved ant colony algorithm combined with gray wolf optimization. First, Pre-search the path by the grey wolf algorithm, then the obtained optimal solution based on the grey wolf algorithm is introduced into the pheromone model of the ant colony algorithm to solve the invalid search caused b...Show More
Research on Application of Artificial Intelligence Algorithm in Directed Graph
2017 International Conference on Computing Intelligence and Information System (CIIS)
Year: 2017 | Conference Paper |
Cited by: Papers (4)
With the development of artificial intelligence algorithm, the combination of intelligent algorithm and directed graph has become an important tool of current path planning. The application of the intelligent algorithm affects the optimal path planning in the directed graph, including the length of the optimal path and the time of the operation of the algorithm. The following studies are carried o...Show More
Hybrid Genetic Algorithm and Ant Colony Algorithm for Solving Travelling Salesman Problem
Jirawat Thongpiem;Narong Punkong;Chiabwoot Ratanavilisagul;Somkiat Kosolsombat
2024 IEEE 9th International Conference on Computational Intelligence and Applications (ICCIA)
Year: 2024 | Conference Paper |
The traveling salesman problem (TSP) is a combinatorial optimization problem and a NP-complete problem. It is a well-known problem for comparison of algorithm performance. Many researchers try to solve the TSP by the meta-heuristic algorithms. Ant Colony Optimization (ACO) algorithm is a popular method to solve the TSP. To enhance performance of ACO for solving TSP, the recently proposed improving...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.