Results 151 to 160 of about 10,292 (207)

An Ant Colony Verification Algorithm

Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007), 2007
Buchi automata are widely used as a modeling formalism in formal verification. The emptiness check procedure is used to carry on the model checking of a model M. of a system, against an LTL formula Phi, that expresses the desidered properties the system should satisfy.
Rachid Rebiha, Giovanni Luca Ciampaglia
openaire   +1 more source

An improved ant colony algorithm with soldier ants

2015 11th International Conference on Natural Computation (ICNC), 2015
In the traveling Salesman Problem (TSP) research, the global search capability, convergence speed and robustness have become the hot issues. The ant colony algorithm is often used to solve TSP. The paper presents an improved algorithm based on the basic ant colony algorithm.
Shuhua Gu, Xia Zhang
openaire   +1 more source

Ant Colony Algorithm

2020
Ant colony optimization (ACO) algorithm, models the real-life behavior of ants to solve optimization problems. Information provided in this chapter include: path navigation of ants, foraging pattern of ants by depositing pheromones during exploration and ACO model development.
Modestus O. Okwu, Lagouge K. Tartibu
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

An Improved Ant Colony Algorithm for VRPTW

2008 International Conference on Computer Science and Software Engineering, 2008
The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem. The primary objective of VRPTW is defined as the minimization of the number of routes or vehicles. Minimization of the total travel cost is secondary objective.
Chengming Qi, Yunchuan Sun
openaire   +1 more source

Ant colony algorithms in MANETs: A review

Journal of Network and Computer Applications, 2012
Mobile ad-hoc networks (MANETs) consist of special kind of wireless mobile nodes which form a temporary network without using any infrastructure or centralized administration. MANETs can be used in wide range of future applications as they have the capability to establish networks at anytime, anywhere without aid of any established infrastructure.
Gurpreet Singh Bhamra   +2 more
openaire   +1 more source

A Convergence Proof for Ant Colony Algorithm

2009 International Joint Conference on Computational Sciences and Optimization, 2009
In this paper, a general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. Based on the two different conditions, some convergence properties for Ant Colony System (ACS) are presented. The global searching and convergence ability are improved by adaptively changing the lower pheromone bound.
Jifu Nong, Long Jin
openaire   +1 more source

Home - About - Disclaimer - Privacy