Vehicle routing problem is a NP-hard problem, with the expansion of problem solving more difficult. This paper proposes a hybrid behavior based on ant colony algorithm to solve the problem, ant to different objectives in the first place as the path selection according to the analysis of the impact on the algorithm, then define the ant behavior and design four concrete ant behavior by selecting ...

Ant Algorithm is a newly developed random bionics algorithm in recent years. The paper firstly introduces Ant Algorithm into the structural optimization. Three numerical examples have been presented. They are solved by Ant Algorithms, Genetic Algorithm and Simulated Annealing Algorithm and so on .The comparisons between them have been obtained in terms of efficiency and effectiveness. It must b...

The objective of optimal feeder reconfiguration of radial distribution system problem is to obtain the best set of branches to be opened, one each from each loop, such that the resulting radial distribution system has the desired performance. This paper presents a feeder reconfiguration problem in the presence of distributed generators to minimize the system power loss while satisfying operatin...

Recently, researchers in various fields have shown interest in the behavior of creatures from the viewpoint of adaptiveness and flexibility. Ants, known as social insects, exhibit collective behavior in performing tasks that can not be carried out by an individual ant. In ant colonies, chemical substances, called pheromones, are used as a way to communicate important information on global behav...

this article presents the application of two algorithms: heuristic big bang-big crunch (hbb-bc) and a heuristic particle swarm ant colony optimization (hpsaco) to discrete optimization of reinforced concrete planar frames subject to combinations of gravity and lateral loads based on aci 318-08 code. the objective function is the total cost of the frame which includes the cost of concrete, formw...

Ant colony optimization (ACO) algorithms have been applied successfully to combinatorial optimization problems. More recently, Parpinelli et al have applied ACO to data mining classification problems, where they introduced a classification algorithm called Ant Miner. In this paper, we present a system that combines both the proposed Improved Quickreduct algorithm for data preprocessing and ant ...

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

clustering technique is one of the most important techniques of data mining and is the branch of multivariate statistical analysis and a method for grouping similar data in to same clusters. with the databases getting bigger, the researchers try to find efficient and effective clustering methods so that they can make fast and real decisions. thus, in this paper, we proposed an improved ant syst...

This paper presents an ant-based algorithm for the graph coloring problem. An important difference that distinguishes this algorithm from previous ant algorithms is the manner in which ants are used in the algorithm. Unlike previous ant algorithms where each ant colors the entire graph, each ant in this algorithm colors a small portion of the graph using only local information. These individual...