Task scheduling method based on greedy adaptive ant colony algorithm

An ant colony algorithm and task scheduling technology, which is applied in computing, computing models, data processing applications, etc., can solve problems such as being unsuitable for global optimization, and achieves the effect of strong versatility
CN111967643APending Publication Date: 2020-11-20BEIJING UNIV OF TECH
0 Cites 4 Cited by

Patent Information

Authority / Receiving Office
CN Β· China
Current Assignee / Owner
BEIJING UNIV OF TECH
Publication Date
2020-11-20

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses a task scheduling method based on a greedy adaptive ant colony algorithm, belongs to the field of cluster intelligent algorithms, and is mainly used for optimizing the execution efficiency and optimization capability of the ant colony algorithm. Firstly, the greedy algorithm is introduced to accelerate the initialization speed of the ant colony algorithm, so that the ant colony algorithm performs iterative optimization on the basis of the optimal solution of the greedy algorithm, and the optimal iterative efficiency of solving is improved; in the execution stage, an efficiency factor and a volatilization coefficient capable of being adaptively adjusted are also added to accelerate the optimization speed of the ant colony algorithm. The efficiency factor enables theselected node to be more reasonable, and the adaptive adjustment mechanism of the volatilization coefficient enables the algorithm to fully utilize the information of the front and back scheduling results to adjust the volatilization coefficient in a targeted manner, thereby adjusting the optimization direction. An ant colony relay is introduced into the ant colony algorithm to solve the problem that task scheduling cannot be completed by a single ant path under the constraint condition.
Need to check novelty before this filing date? Find Prior Art

Description

Technical field

[0001] The invention belongs to the field of cluster intelligent algorithms, and is mainly used for optimizing the execution efficiency and optimization ability of the ant colony algorithm. Background technique

[0002] Ant colony algorithm is a heuristic combinatorial optimization algorithm based on random search to simulate the foraging behavior of ants. The ants in the ant colony communicate through pheromone, and in the process of searching for food sources, they release pheromone and remain on the path the ant walked. The shorter the path, the more ants pass per unit time, the higher the concentration of pheromone released, and the stronger the attraction to later ants. In the end, all ants choose this path, that is, a path is determined between the nest and the food source. The shortest path. The advantage of ant colony algorithm is that it can handle very complex combinatorial optimization problems without complex mathematical models and complicated param...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More