Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem. Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms. Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve differenttypes of NP-hard problems.However, ant colony s...

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

This paper investigates a comparative study which addresses the P/prec/Cmax scheduling problem, a notable NP-hard benchmark. MLP_SACS, a modified ant colony algorithm, is used to solve it. Its application provides us a better job allocation to machines. In front of each machine, the jobs are performed with three priority rules, the longest path (LP), a modified longest path (MLP) and a maximum ...

Abstract To improve the accuracy of wind power forecasting, improved ACA (Ant Colony Algorithm) is used to optimize GRU (Gated Recurrent Unit) model. First, original generation data normalized; Second, neural network model established, and ant colony algorithm it; Finally, optimized non-optimized are predict short-term output, prediction results compared verify that ACA-GRU has higher for output.

The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed by the consideration of minimization of total flowtime of jobs. Two ant-colony optimization algorithms are proposed and analyzed for solving the permutation flowshop scheduling problem. The first algorithm extends the ideas of the ant-colony algorithm by Stuetzle [Proceedings...

With the development of aerospace engineering, the space on-orbit servicing has been brought more attention to many scholars. Obstacle avoidance planning of space manipulator end-effector also attracts increasing attention. This problem is complex due to the existence of obstacles. Therefore, it is essential to avoid obstacles in order to improve planning of space manipulator end-effector. In t...

-In this article two different optimization algorithms are presented to solve the deficiency of ant colony algorithm such as slow convergence rate and easy to fall into local optimum. This method based on Max-Min Ant System, established an adaptive model for pheromone evaporation coefficient adjusted adaptively and avoided the ants falling into local optimum. At the same time, this optimization...

Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the stigmergic communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization was proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communicat...

In this paper we introduce a biobjective ant colony algorithm for constructing low cost overlay routing networks. The ant colony algorithm is distributed and adaptive in finding shortest paths from source to destination nodes while also constructing a low cost overlay routing network. Additionally, we define a cost model for overlay network construction that includes network traffic demands. Th...