نتایج جستجو برای: ant q algorithm

تعداد نتایج: 875236  

Journal: :JORS 2010
Matthieu Plumettaz David Schindl Nicolas Zufferey

In this paper, we propose a new kind of ant algorithm called Ant Local Search. In most ant algorithms, the role of each ant is to build a solution in a constructive way. In contrast, we propose to consider each ant as a local search, where at each step and in concordance with all ant algorithms, each ant modifies the current solution by the use of the greedy force and the trail systems. We also...

2009
Leonor Albuquerque Melo Francisco Baptista Pereira Ernesto Costa

In this paper we propose an ant colony optimization variant where several independent colonies try to simultaneously solve the same problem. The approach includes a migration mechanism that ensures the exchange of information between colonies and a mutation operator that aims to adjust the parameter settings during the optimization. The proposed method was applied to several benchmark instances...

2012
Jiuyong Zhang Chuanqing Xu Xiaojing Wang Dehui Yuan

Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integrat...

Journal: :Jordanian Journal of Computers and Information Technology 2017

Journal: :American Journal of Software Engineering and Applications 2014

2013
ZEYU SUN ZHENPING LI

Ant colony algorithm of the traditional combinative optimization consumes a large amount of time in the process of solving the optimization, which has a tendency to partial optimization and slow convergence along with many redundant useless iterative codes and low operation efficiency. A generic optimized ant colony algorithm is thus proposed. This algorithm has the ability to fast global searc...

2013
Alpa Reshamwala Deepika P Vinchurkar

Path planning problem, is a challenging topic in robotics. Indeed, a significant amount of research has been devoted to this problem in recent years. The ant colony optimization algorithm is another approach to solve this problem. Each ant drops a quantity of artificial pheromone on every point that the ant passes through. This pheromone simply changes the probability that the next ant becomes ...

2014
Jingfeng Yan

Middle spatial resolution multi-spectral remote sensing image is a kind of color image with low contrast, fuzzy boundaries and informative features. In view of these features, the fuzzy C-means clustering algorithm is an ideal choice for image segmentation. However, fuzzy C-means clustering algorithm requires a pre-specified number of clusters and costs large computation time, which is easy to ...

2007
ALIREZA ABBASY

The optimal reactive power dispatch (ORPD) problem is formulated as a combinatorial optimization problem involving nonlinear objective function with multiple local minima. In this paper, as a new approach, different ant colony optimization (ACO) algorithms are applied to the reactive power dispatch problem. Ant system (AS), the firstly introduced ant colony optimization algorithm, and its direc...

2012
Jianning Ding Yi Lei Guanggui Cheng Zhiyong Ling Zhongqiang Zhang Li Zhang

For wireless sensor networks, the core issue is to design an energy-efficient network protocol as far as possible. Ant colony algorithm has proved to be effective in prolonging the network’s lifecycle and ensuring the reliability of data transmission. In conditions of network topology’s dynamic changes, we optimized the basic ant colony algorithm and introduced the pheromone broadcasting mechan...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید