A direct search approach to determine optimal reservoir operating is proposed with ant colony optimization for continuous domains (ACOR). The model is applied to a system of single reservoir to determine the optimum releases during 42 years of monthly steps. A disadvantage of ant colony based methods and the ACOR in particular, refers to great amount of computer run time consumption. In this st...

Weapon Target Assignment is not only an important issue to use firepower, but also an important operational decision-making problem. As new intelligent algorithms, Genetic algorithm and ant colony algorithm are applied to solve Weapons-Target Assignment Problem. This paper introduces the Weapon-Target Assignment (WTA) and the mathematical model, and proposes ACGA algorithm which is the integrat...

Travelling Salesman Problem (TSP) is a classical combinatorial optimization problem. This problem is NP-hard in nature. Meta-heuristic approaches have proved to be quite useful for approximate solution of difficult combinatorial optimization problems. Ant colony optimization is one of the popular Meta-heuristics and is unique on the basis of its distributed computation and indirect communicatio...

This paper proposes an approximate optimization algorithm combining P systems with ant colony optimization, called ACOPS, to solve traveling salesman problems, which are well-known and extensively studied NP-complete combinatorial optimization problems. ACOPS uses the pheromone model and pheromone update rules defined by ant colony optimization algorithms, and the hierarchical membrane structur...

A component-based approach to model Ant Colony System (ACS) for the Traveling Salesman Problem (TSP) is shown in this paper. The used components to solve the TSP with ACS technique and the collaboration rules between components are also described. The internal reasoning about the ant colony component-based system for the TSP gives a better perception of solving this problem using ant-based tech...

As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...

Motivation Modelling the activity of an ant community based on the individual behaviour of a single ant is a very modern approach, but until now the modelling was often restricted to single phenomena, e.g. foraging or recruiting. But these activities can not be seen independently from other necessary abilities, like e.g. defending a territory from enemies. In this paper we want to present a mod...

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

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

Form the view of the biological viewpoint; each ant of social insects is regarded as neuron. They compose a neural network by stochastic and loose connections with each other; Similar to the artificial neural network simulating the ant colony, the Ant colony algorithm of binary network is presented. As the binary coding is adapted, lower aptitude behave of single ant is requested, less storage ...