Ant Colony Optimization (ACO) algorithms are basically developed for discrete optimization and hence their application to continuous optimization problems require the transformation of a continuous search space to a discrete one by discretization of the continuous decision variables. Thus, the allowable continuous range of decision variables is usually discretized into a discrete set of allowab...

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

Generic cabling is a key component for multiplex cable wiring. It is one of the basic foundations of intelligent buildings. Using operation flow in generic cabling, the index constraints affecting generic cabling have been evolved in this paper. A mathematical model is built based on the ant colony algorithm with multiple constraints, and improvements were made on the original basis to extend t...

This article puts forward the routing algorithm of wireless sensor network based on ant colony optimization. The algorithm uses the characteristics of ant colony algorithm that is easy to realize local work, integrates link quality into the pheromone formation and supports multiple routes. When choosing routing, the probability is calculated that the node is selected as the next hop according t...

Ant colony optimization algorithm is a way to be used to find the optimal solutions is enormous, the number of ants on the path, which will lead to reduced the network node on the path energy drastically. The wireless sensor network is a large number of tiny sensor nodes with communication and computing power. Using wireless sensor networks collaboration to perception, the perception of the obj...

To solve the problem of vehicle routing problem under capacity limitation, this paper puts forward a novel method of logistics distribution route optimization based on genetic algorithm and ant colony optimization algorithm (GA-ACO). On the first stage, improved genetic algorithm with a good global optimization searching ability is used to find the feasible routes quickly. On the second stage, ...

To enhance the optimization ability of ant colony optimization, this paper proposes a Bloch sphere-based quantum-inspired ant colony optimization algorithm. In the proposed approach, the positions of ants are encoded by qubits described on Bloch sphere. First, the destinations of ants are obtained by the select probability designed by the pheromone and heuristic information, and then, the movem...

An ant colony optimization is a technique which was introduced in 1990’s and which can be applied to a variety of discrete (combinatorial) optimization problem and to continuous optimization. The ACO algorithm is simulated with the foraging behavior of the real ants to find the incremental solution constructions and to realize a pheromone laying-and-following mechanism. This pheromone is the in...

the edges of an image define the image boundary. when the image is noisy, it does not become easy to identify the edges. therefore, a method requests to be developed that can identify edges clearly in a noisy image. many methods have been proposed earlier using filters, transforms and wavelets with ant colony optimization (aco) that detect edges. we here used aco for edge detection of noisy ima...