Various studies have shown that the ant colony optimization (ACO) algorithm has a good performance in approximating complex combinatorial problems such as traveling salesman problem (TSP) for real-world applications. However, disadvantages long running time and easy stagnation still restrict its further wide application many fields. In this study, saltatory evolution (SEACO) is proposed to incr...

Multi-objective Ant Colony Optimization (MOACO) algorithms have been successfully applied to several multi-objective combinatorial optimization problems (MCOP) over the past decade. Recently, we proposed a MOACO algorithm named GRACE for the multi-objective shortest path (MSP) problem, confirming the efficiency of such metaheuristic for this MCOP. In this paper, we investigate several extension...

Swarm Intelligence (SI) is a relatively new technology that takes its inspiration from the behavior of social insects and flocking animals. In this paper, we focus on two main SI algorithms: Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO). An extension of ACO algorithm and a PSO algorithm has been implemented to solve the portfolio optimization problem, which is a continuous...

Most real world combinatorial optimization problems are difficult to solve with multiple objectives which have to be optimized simultaneously. Over the last few years, researches have been proposed several ant colony optimization algorithms to solve multiple objectives. The aim of this paper is to review the recently proposed multi-objective ant colony optimization (MOACO) algorithms and compar...

The Learnable Ant Colony Optimization (LACO) is proposed to satellite ground station system scheduling problems. The LACO employs an integrated modelling idea which combines the ant colony model with the knowledge model. In order to improve the performance, LACO largely pursues the complementary advantages of ant colony model and knowledge model. Experimental results suggest that LACO is a feas...

Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.

This paper presents an ant colony optimization based algorithm to solve real parameter optimization problems. In the proposed method, an operation similar to the crossover of the genetic algorithm is introduced into the ant colony optimization. The crossover operation with Laplace distribution following a few promising descent directions (FPDD-LX) is proposed to be performed on the pheromone of...

In this paper we try to introduce the Ant Colony Optimization (ACO) and its application in Economic Dispatch ED). In the step one we present theory and performance of ant colony and its history and its application in various applications and how work the ant colony algorithm. In step two we present ant colony optimization include Basic Concept, Ant Searching Behavior, Path Retracing and Pheromo...

When facing a real world, optimization problems mainly become multiobjective i.e. they have several criteria of excellence. A multi-criteria problem submitted for multi-criteria evaluation is a complex problem, as usually there is no optimal solution, and no alternative is the best one according to all criteria. However, if a metaheuristic algorithm is combined with a Multi-Criteria Decision-Ma...