This paper deals with an anology of scheduling jobs on prarallel processors using Ant Colony Optimization where job values are given as a power function of the job execution times. We consider a scheduling problem in a machine of parallel processors with the objective of minimization of the total loss of job values is considered as criterion which reflects the minimization of waiting time of th...

Ant Colony Optimization is a population-based meta-heuristic that exploits a form of past performance memory that is inspired by the foraging behavior of real ants. The behavior of the Ant Colony Optimization algorithm is highly dependent on the values defined for its parameters. Adaptation and parameter control are recurring themes in the field of bio-inspired optimization algorithms. The pres...

In this paper, we present an improved continuous ant colony algorithm for global optimization of continuous functions. We show how to improve the quality of Ant Colony Optimization, ACO, to solve continuous optimization problems. We present the general idea, implementation, the analysis of its convergence and results obtained. We compare the results with Adaptive Genetic Algorithm, AGA, and Con...

Reasonable welding path has a significant impact on welding efficiency, and a collision-free path should be considered first in the process of welding robot path planning. The shortest path length is considered as an optimization objective, and obstacle avoidance is considered as the constraint condition in this paper. First, a grid method is used as a modeling method after the optimization obj...

Ant colony optimization algorithm for continuous domains is a major research direction for ant colony optimization algorithm. In this paper, we propose a distribution model of ant colony foraging, through analysis of the relationship between the position distribution and food source in the process of ant colony foraging. We design a continuous domain optimization algorithm based on the model an...

one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

This paper systematically presents the Swarm Intelligence (SI) methods for optimization of multiple and many objective problems. The fundamental difference of Multiple andMany Objective Optimization problems have been studied very rigorously. The three forefront swarm intelligence methods, i.e., Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), and Artificial Bee Colony Optimiza...