Showing 1-25 of 3,710 resultsfor "Index Terms":ant colony optimization (ACO)
"Index Terms":ant colony optimization (ACO)
- Sort
Get notified when new research is published matching your search criteria.
Sort By
Results
Study on the Optimization Model of Utilization Scheme of Railway Passenger Station Tracks Based on an Improved ACO Algorithm
2009 Second International Conference on Intelligent Computation Technology and Automation
Year: 2009 | Conference Paper |
Cited by: Papers (1)
The optimization model of utilization scheme of railway passenger station arrival and departure tracks is set up by analysis the basic principle of the utilization of arrival and departure tracks in this paper. It is proved that this problem is NP-hard, so an improved ant colony optimization algorithm is given to solve this model. In this algorithm, an improved state transition rules and a mutatio...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...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
Research on Logistics Distribution Routes Optimization Based on ACO
2020 5th International Conference on Information Science, Computer Technology and Transportation (ISCTT)
Year: 2020 | Conference Paper |
Cited by: Papers (2)
Aiming at the problem of route optimization, a multi-objective optimized route distribution model is constructed with the goal of the smallest total transportation cost and the shortest total delivery route. In order to overcome the shortcomings of ant colony optimization, such as too long search time and easy to fall into local optimum, the ant colony pheromone volatilization coefficient is impro...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 c...Show More
ACO algorithms with multi-core implementation
2013 7th International Conference on Application of Information and Communication Technologies
Year: 2013 | Conference Paper |
Cited by: Papers (6)
Ant colony optimization is a successful swarm intelligence method for solving various combinatorial optimization problems. It uses a population-based meta-heuristic that is based on the foraging behavior of real ant colonies, and these ants use pheromones to communicate indirectly with others. While the scale of problem increases, ACO necessitates much more time and resource to solve the opt...Show More
An Adaptive Parameter Control Strategy for ACO
2006 International Conference on Machine Learning and Cybernetics
Year: 2006 | Conference Paper |
Cited by: Papers (23)
Ant colony optimization (ACO) has been proved to be one of the best performing algorithms for NP-hard problems as TSP. Many strategies for ACO have been studied, but fewer tuning methodologies have been done on ACO's parameters which influence the algorithm directly. The setting of ACO's parameters is considered as a combinational optimization problem in this paper. The par...Show More
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
Comparison and analysis of solving travelling salesman problem using GA, ACO and hybrid of ACO with GA and CS
2015 IEEE Workshop on Computational Intelligence: Theories, Applications and Future Directions (WCI)
Year: 2015 | Conference Paper |
Cited by: Papers (10)
The Travelling Salesman Problem (TSP) is a very popular combinatorial optimization problem of real world. The objective is to find out a shortest possible path travelled by a salesman while visited every city once and returned to the origin city. TSP is one of the NP hard problems and several attempts have been done to solve it by traditional methods. Computational methods give better solution for...Show More
Application of Ant Colony Optimization (ACO) Algorithm to Optimize Trans Banyumas Bus Routes
2022 IEEE International Conference on Cybernetics and Computational Intelligence (CyberneticsCom)
Year: 2022 | Conference Paper |
Cited by: Papers (5)
The ever-increasing population and high mobility impact the massive number of vehicles that affect the development of public transportation and the determination of effective routes. These factors make it very important to optimize the route because it will impact operational costs and the punctuality of picking up passengers. Determining the optimal route can be categorized as a Traveling Salesma...Show More
Study on QoS Multicast Routing Based on ACO-PSO Algorithm
2010 International Conference on Intelligent Computation Technology and Automation
Year: 2010 | Conference Paper |
Cited by: Papers (5)
QoS multicast routing problem is a nonlinear combination optimization problem, which has been proved to be a NP complete problem. a hybrid algorithm with ant colony optimization algorithm(ACO) and particle a warm optimization algorithm(PSO) is presented. The ACO-GA algorithm absorbs the merits of ACO and GA respectively. In hybrid algorithm, the position update of PSO is used to ...Show More
Improved Ant Colony Algorithms for Eliminating Stagnation and Local Optimum Problem — A Survey
2017 International Conference on Technical Advancements in Computers and Communications (ICTACC)
Year: 2017 | Conference Paper |
Cited by: Papers (8)
ACO (Ant Colony Optimization) is popular swarm intelligence with stochastic nature meta-heuristic algorithm applied to solve many combinatorial optimization problems. The characteristics of ACO includes robust, positive feedback, distributed computing and easy fusing with other algorithms makes ACO simpler and efficient in searching optimal solutions. But the ACO algorithm ...Show More
Ant Colony Optimization (ACO) Based Technique for Voltage Control and Loss Minimization Using Transformer Tap Setting
Mohd Fatihi Mustafar;Ismail Musirin;Mohd. Rozely Kalil;Mohamad Khayat Idris
2007 5th Student Conference on Research and Development
Year: 2007 | Conference Paper |
Cited by: Papers (10)
Continuous demand in power transmission network caused by reactive power has been highlighted as the main factor in voltage depreciation and also increase of total transmission loss. Various studies involving reactive power planning (RPP); such as optimal reactive power dispatch (ORPD), optimal capacitor placement, static VAR compensator and installation of flexible AC transmission system (FACTs) ...Show More
A hybrid PSO/ACO algorithm for land cover classification
The 2nd International Conference on Information Science and Engineering
Year: 2010 | Conference Paper |
Cited by: Papers (4)
For several decades the remote sensing image classification methods for depicting land cover have gained a great achievements, but with the more multi-source and multidimensional data, the conventional remote sensing image classification methods based on statistical theory have exposed some limitation. So in recent years, artificial intelligence techniques have being applied to remote sensing imag...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
Cloud Computing Analysis and Optimization Based on Map-Reduce and Improved Ant Colony Optimization Algorithm
2018 IEEE 9th International Conference on Software Engineering and Service Science (ICSESS)
Year: 2018 | Conference Paper |
Cited by: Papers (2)
In order to realize rapid processing and accurate interpretation of big data, and to achieve reasonable scheduling and application of cloud computing resources, this paper proposes an integrated artificial intelligence processing and analysis model, combining Map-Reduce and the improved ant colony algorithm based on PSO. Firstly, it uses Map-Reduce to divide cloud computing tasks into several subt...Show More
An application of parallel ACO algorithm in power network node code multi-scheme optimization
2010 2nd International Conference on Computer Engineering and Technology
Year: 2010 | Conference Paper |
Cited by: Papers (2)
In order to increase solution speed for nodal admittance matrix of mathematical model of modern power network, a node code scheme with minimal new-adding nonzero injection elements is needed. To this point, a new algorithm for node code optimization based on the parallel ant colony optimization (ACO) algorithm is designed in this paper. Compared with traditional node code optimization method...Show More
Novel Method for Construction Enterprise Management Based on Improved ACO
2009 Second International Symposium on Computational Intelligence and Design
Year: 2009 | Conference Paper |
To solve the problem of resource allocation among the sub-enterprises in the management of construction enterprise, an improved Ant Colony Optimization (ACO) algorithm based on entropy was introduced. After analyzing the feasibility of the usage of the algorithm, the allocation model was set up. Engineering practice shows that the method can realize the resource allocation efficiently with l...Show More
Research on Continuous Function Optimization Algorithm Based on Swarm-Intelligence
2009 Fifth International Conference on Natural Computation
Year: 2009 | Conference Paper |
Cited by: Papers (5)
On the basis of the analyses of ant colony optimization (ACO) and particle swarm optimization (PSO), continuous ant-particle swarm optimization (CA-PSO) applied in continuous function optimization is proposed. After the space partition is properly employed, ACO is applied to search the sensitive areas through the whole solution space. And then PSO is initialized according to ACO ...Show More
FPGA implementation of improved ant colony optimization algorithm for path planning
Chen-Chien Hsu;Wei-Yen Wang;Yi-Hsing Chien;Ru-Yu Hou;Chin-Wang Tao
2016 IEEE Congress on Evolutionary Computation (CEC)
Year: 2016 | Conference Paper |
Cited by: Papers (6)
An improved ant colony optimization (ACO) algorithm is proposed in this paper for improving the accuracy of path planning. The main idea of this paper is to avoid local minima by continuously tuning a setting parameter and the establishment of novel mechanisms for updating partial pheromone and opposite pheromone. As a result, the global search of the proposed ACO algorithm can be sign...Show More
Ant colony optimization based control allocation for fighter with multiple effectors
Proceedings of the 33rd Chinese Control Conference
Year: 2014 | Conference Paper |
Cited by: Papers (3)
Aiming at the optimum allocation problem of redundancy for fighter with multiple effectors and considering the advantage of ant colony optimization (ACO) in optimization, a new control allocation (CA) strategy based on ACO is proposed. According to the mathematical model for CA problem, optimization goals and constraints are provided for continuous space optimization. By extending A...Show More
Feature Selection Based F-Score and ACO Algorithm in Support Vector Machine
2009 Second International Symposium on Knowledge Acquisition and Modeling
Year: 2009 | Conference Paper |
Cited by: Papers (36)
This study proposes a new strategy combining with the SVM(support vector machine) classifier for features selection that retains sufficient information for classification purpose. Our proposed approach uses F-score models to optimize feature space by removing both irrelevant and redundant features. To improve classification accuracy, the parameters optimization of the penalty constant C and the ba...Show More
Differential Evolution Ant Colony Optimization (DEACO) technique in solving Economic Load Dispatch problem
2012 IEEE International Power Engineering and Optimization Conference Melaka, Malaysia
Year: 2012 | Conference Paper |
Cited by: Papers (13)
Electric utilities are the companies responsible for ensuring energy supply meets their customers' requirement. While ensuring the energy is generated in the right amount, they have to guarantee that the energy is generated within feasible cost. Economic Load Dispatch (ELD) problem involves the scheduling of generating unit outputs that can satisfy load demand at minimum operating cost. Several ap...Show More
Comparison between PSO and ACO techniques for analog circuit performance optimization
M. Kotti;B. Benhala;M. Fakhfakh;A. Ahaitouf;B. Benlahbib;M. Loulou;A. Mecheqrane
This paper presents a comparison between swarm intelligence (SI) techniques; namely Particle Swarm Optimization and Ant Colony Optimization, to solve analog circuit sizing problems. Performances in terms of optimum quality and computing time of both algorithms are checked via two applications that consist of optimizing performances of a CMOS second generation current conveyor (CCII), and an operat...Show More
A Comparative Study between ACO and DE Techniques by Numerical Functions Optimization
2019 5th International Conference on Optimization and Applications (ICOA)
Year: 2019 | Conference Paper |
Cited by: Papers (3)
Recently, the attraction of meta-heuristic techniques has increased due to their capability for solving complex optimization problems in various areas. This paper present a comparative study between two meta-heuristics techniques namely Ant Colony Optimization (ACO) and Differential Evolution (DE). In order to determine the best way to combine these two techniques in view of a successful hyb...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.