Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Ant colony genetic hybrid algorithm for solving stacker path planning based on gene bank

A hybrid algorithm and path planning technology, applied in the field of ant colony genetic hybrid algorithm, which can solve the problems of slow convergence speed and falling into the optimal solution.

Pending Publication Date: 2021-12-03
ANHUI UNIVERSITY OF TECHNOLOGY AND SCIENCE
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] The purpose of the present invention is to solve the shortcomings of the existing genetic algorithm that the convergence speed is slow and it is easy to fall into the optimal solution, and to provide an ant colony genetic hybrid algorithm based on the gene pool to solve the path planning problem

Method used

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
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Ant colony genetic hybrid algorithm for solving stacker path planning based on gene bank
  • Ant colony genetic hybrid algorithm for solving stacker path planning based on gene bank
  • Ant colony genetic hybrid algorithm for solving stacker path planning based on gene bank

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] The technical solution adopted by the present invention to solve its technical problems is:

[0050] An ant colony genetic hybrid algorithm for solving stacker path planning based on a gene bank, comprising the following steps:

[0051] 1) Assuming that the initial problem model is that there are m inbound tasks I and n outbound tasks O, assuming that the capacity of the stacker is 1, then the sequence model L of the solution to the total task is:

[0052] (1)

[0053] In the above formula, I i (i=1,2,3 … m) For storage tasks, O j (j=1,2,3 … n) For outbound tasks, regardless of the relationship between m and n, L can always be regarded as consisting of two parts of tasks, one part is a compound task sequence (denoted as R), and the other is a single task sequence (denoted as D), then when m > n , formula (1) can be written as:

[0054] (2)

[0055] in r i，j It is a compound task unit. From formula 2, we can see that the factors affecting the time ...

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

PUM

No PUM Login to View More

Abstract

The invention relates to an ant colony genetic hybrid algorithm for solving stacker path planning based on a gene bank. The algorithm comprises the following steps: firstly, creating a gene pool for storing gene segments of individuals, and selecting excellent gene segments from the gene pool through an ant colony algorithm to try to construct relatively excellent individuals when the individuals are generated. Through the above strategy, the algorithm can effectively avoid the influence of bad gene segments on the genetic algorithm so as to accelerate the convergence of the genetic algorithm; and meanwhile, because the ant colony algorithm also has a certain selection probability for unknown gene segments, the algorithm also has a certain effect on overcoming the falling into a local optimal solution. A large number of simulation results show that the ant colony-genetic hybrid algorithm adopting the novel strategy has an obvious effect of solving the path planning of the stacker, and compared with a traditional genetic algorithm, the ant colony-genetic hybrid algorithm not only has a higher convergence speed, but also has better stability for obtaining an optimal solution.

Description

technical field [0001] The invention relates to the technical field of stacker path planning, in particular to an ant colony genetic hybrid algorithm for solving stacker path planning based on a gene bank. Background technique [0002] Today, with the rapid economic development, the efficiency of logistics is becoming more and more important. The traditional human management mode no longer meets the needs of the industry. Therefore, the Automated Storage and Retrieval System (AS / RS) was born. As a new type of storage technology, but also as the core part of the modern logistics system, AS / RS is being used more and more in various industries. Considering that the efficiency of warehouse entry and exit directly affects the efficiency of the entire logistics system, a key direction to improve the efficiency of the entire logistics system is to optimize the path of entry and exit. Stacker, as the main equipment for transporting and storing goods in AS / RS, usually takes about 50...

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

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06N3/12G06Q10/04
CPCG06N3/126G06Q10/047
Inventor 李东东王雷耿赛黄胜洲王风涛马康康谢芳琳刘明豪顾瀚王飞
Owner ANHUI UNIVERSITY OF TECHNOLOGY AND SCIENCE
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com