Traditional method of test paper generation is time-consuming, low efficient and low success. In order to improve the success rate of test paper, the paper puts forward an ant colony algorithm of automatic sets method. First, a mathematical model of constraint is built according to the requires of papers, and by using the ant colony algorithm, the optimal solution of grouping is obtained. Simul...

Existing ant colony optimization (ACO) for software testing cases generation is a very popular domain in software testing engineering. However, the traditional ACO has flaws, as early search pheromone is relatively scarce, search efficiency is low, search model is too simple, positive feedback mechanism is easy to produce the phenomenon of stagnation and precocity. This paper introduces improve...

This paper presents an ant colony optimization methodology for optimally clustering N objects into K clusters. The algorithm employs distributed agents which. AbstractAnt-based clustering is a biologically inspired data. Multi-ant colonies approach for clustering data that consists of some parallel.based on ant colony to solve the unsupervised clustering. Index TermsAnt colony optimization, Clu...

One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...

In this paper, thinking over characteristics of ant colony optimization Algorithm, taking into account the characteristics of cloud computing, combined with clonal selection algorithm (CSA) global optimum advantage of the convergence of the clonal selection algorithm (CSA) into every ACO iteration, speeding up the convergence rate, and the introduction of reverse mutation strategy, ant colony o...

Aimed at the problems that classical ant colony algorithm is easy to fall into local optimal, this thesis puts forward a new AODV routing protocol based on improved geneticant colony algorithms (IGAACA-AODV) by introducing genetic algorithm (GA) to improve ant colony algorithm, and combining with the characteristics of AODV routing protocols in Ad Hoc network. First of all, the proposed algorit...

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 ...

Ant algorithm is a novel meta-heuristic optimization algorithm, but at the same time there are some disadvantages. This paper proposed an ant colony algorithm with route evaluation based on the basic ant colony algorithm. After all ant complete the route search once, the current search situation can be evaluated according to an improved formula of standard deviation, then to decide to update gl...

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...