According to the principle of the weak economy, mathematical model of emergency logistics routing optimization has been established in this paper, and the model is solved by the uniform mutation ant colony algorithm, simulation shows that the optimal results of uniform mutation ant colony algorithm are better than ant colony algorithm. At the same time, compared with the mathematical model of t...

In this paper we present an approximation algorithm for the p-median problem that uses the principles of ant colony optimization technique. We introduce a search tree that keeps the partial solutions during the solution process of the p-median problem. An adaptation is proposed that allows ant colony optimization algorithm to perform on this tree and obtain good results in short time.

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

In optimization problem, Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO) have been known as good alternative techniques. GA is designed by adopting the natural evolution process, while ACO is inspired by the foraging behaviour of ant species. This paper presents a hybrid GA-ACO for Travelling Salesman Problem (TSP), called Genetic Ant Colony Optimization (GACO). In this metho...

In this study, we propose an optimization method by the cooperative mechanism of ant and aphid as a new Ant Colony Optimization (ACO). This algorithm is named Ant Colony Optimization with Cooperative Aphid (ACOCA). In ACOCA algorithm, the aphid searches neighborhood solutions. This solution information is treated as a honey obtained from the aphid and the honey affects the search of ACO. Moreov...

Research efforts in metaheuristics have shown that an intelligent incorporation of more classical optimization techniques in metaheuristics can be very beneficial. In this paper, we combine the metaheuristic ant colony optimization with dynamic programming for the application to the NP-hard k-cardinality tree problem. Given an undirected graph G with node and/or edge weights, the problem consis...

This survey focuses on the problem of parameters selection in image edge detection by ant colony optimization (ACO) algorithm. By introducing particle swarm optimization (PSO) algorithm to optimize parameters in ACO algorithm, the fitness function based on connectivity of image edge is proposed to evaluate the quality of parameters in ACO algorithm. And the ACO-PSO algorithm is applied to image...

proposed to improve the performance of the ACO algorithm. In this paper an ant colony optimization with memory is proposed, which is applied to the classical traveling salesman problem (TSP). In the proposed algorithm, each ant searches the solution not only according to the pheromone and heuristic information but also based on the memory which is from the solution of the last iteration. A larg...

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

Recent days, research in wireless network becomes major area for the past few decades. In wireless routing many routing methods such as table driven, source driven; many characteristics such as reactive routing, proactive routing; many routing algorithms such as dijikstra’s shortest path, distributed bell-man ford algorithm are proposed in the literature. For effective wireless routing, the rec...