Results 201 to 210 of about 44,920 (246)

An optimization algorithm based on ant colony algorithm

International Conference on Automatic Control and Artificial Intelligence (ACAI 2012), 2012
This paper proposes an optimization algorithm to resolve combinatorial optimization problem. Congestion degree in the artificial fish school algorithm is used in ant colony algorithm in this paper. During the initial process of the optimization, the congestion degree plays the main role to guide the ants to search the new path randomly, which makes the
null Kuang Xiangling, null Huang Guangqiu   +1 more
openaire   +1 more source

An ant colony optimization based layout optimization algorithm

2002 IEEE Region 10 Conference on Computers, Communications, Control and Power Engineering. TENCOM '02. Proceedings., 2004
Ant colony optimization (ACO) has been applied to several NP-hard combinatorial optimization problems with considerable success while little experience is available on continuous constrained optimization problems. In this paper ACO was adopted in the solution of a layout optimization problem with dynamic constraints. A quasi traveling salesman problem (
null Zhi-Guo Sun, null Hong-Fei Teng
openaire   +1 more source

Optimization of K-means algorithm: Ant colony optimization

2017 International Conference on Computing Methodologies and Communication (ICCMC), 2017
Significance of a versatile and simple clustering algorithm is becoming indispensable with the huge data growth in recent years. K-Means clustering is one such clustering algorithm which is simple yet elegant. But K-Means Algorithm has its disadvantages, dependence on the initial cluster centers and the algorithm tends to converge at a local minima. To
T Namratha Reddy, K. P. Supreethi
openaire   +1 more source

Image hiding optimization using ant colony optimization algorithm

2016 International Conference on Data and Software Engineering (ICoDSE), 2016
Deterioration in the quality on host media (such as image) usually occurs when the information (such as text or image) is hidden or embedded in the host. The smaller deterioration on host media after embedding the information, the system hiding is more successful because it shows there is no significant different between the original host image and the
Abba Suganda Girsang, Fauzi Pujanandi Utama   +1 more
openaire   +1 more source

Structural topology optimization using ant colony optimization algorithm

Applied Soft Computing, 2009
The ant colony optimization (ACO) algorithm, a relatively recent bio-inspired approach to solve combinatorial optimization problems mimicking the behavior of real ant colonies, is applied to problems of continuum structural topology design. An overview of the ACO algorithm is first described.
Guan-Chun Luh, Chun-Yi Lin
openaire   +1 more source

Flying Ant Colony Optimization Algorithm for Combinatorial Optimization

2018
Studia Informatica, Vol 38, No 4 (2017)
Fidanova, Stefka, Atanassov, Krassimir
openaire   +1 more source

A quickly convergent continuous ant colony optimization algorithm with Scout Ants

Applied Mathematics and Computation, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Qingbao, Yang, Zhijun, Ma, Wei
openaire   +2 more sources

Robot Planning with Ant Colony Optimization Algorithms

2006 Chinese Control Conference, 2006
Ant colony optimization algorithms are investigated in this paper for robot planning in configuration space. The robot planning problem is to find a feasible path from a beginning to a goal while avoiding obstacles in a clustered environment. Lots of attentions have been paid on such problems, but little is with the ant colony optimization algorithms ...
Zhao Dongbin, Yi Jianqiang
openaire   +1 more source

On the Faster Ant Colony Optimization Algorithm

2009 Fifth International Conference on Natural Computation, 2009
The pheromone trails in ACO are used to reflect the ants’ search experience, so the quality of the pheromone is crucial to the success of ACO. The main factors affecting the quality of the pheromone include the strategy of updating the pheromone and the quality of the constructed solutions.
Yingzhou Bi, Lixin Ding, Jianbo Lu
openaire   +1 more source

Optimal Disk Scheduling Based On Ant Colony Optimization Algorithm

2006
Disk scheduling problem has theoretical interest and practical importance since, the processor speed and memory capacity have been progressing several times faster than disk speed. More efficient disk usage methods have been needed because of the slow evolution in disk speed technology.
ÖKDEM, Selçuk, KARABOĞA, Derviş
openaire   +2 more sources