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

Discrete optimization method based on matrix workshop AGV scheduling

An optimization method, discrete technology, applied in the direction of control/regulation system, comprehensive factory control, instruments, etc., can solve the problems of not reducing transportation cost, low number of iterations, and inability to obtain, so as to reduce transportation cost and reduce calculation time. , the effect of increasing the number of iterations

Pending Publication Date: 2021-07-02
LIAOCHENG UNIV
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, there are the following problems in AGV workshop scheduling: on the one hand, it is about determining the production machine that each vehicle is responsible for and determining the order in which each vehicle is responsible for delivering materials to its respective machine; on the other hand, the AGV scheduling problem is a typical NP-hard problem , has always attracted extensive attention of scholars, and is one of the research hotspots in the field of manufacturing systems
The current discrete weed algorithm is only aimed at searching for the optimal solution. However, there are still the following problems when solving the AGV scheduling problem: under fixed time, the number of iterations is low, and better results cannot be obtained; Shipping costs make special proposals

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
  • Discrete optimization method based on matrix workshop AGV scheduling
  • Discrete optimization method based on matrix workshop AGV scheduling
  • Discrete optimization method based on matrix workshop AGV scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] Such as Figure 1-3 As shown, the discrete optimization method based on matrix workshop AGV scheduling provided by the present invention mainly includes the following implementation process:

[0031] 1. Preset the relevant parameters of the discrete weed optimization algorithm.

[0032] Mainly include: initial population size, maximum population size, minimum seed number and maximum seed number. According to the existing AGV scheduling case of an actual factory, the existing algorithm is calibrated, and the preset value of the algorithm is calibrated by using 30 examples in the actual example to find out the parameter setting suitable for the problem. According to the results of the algorithm operation, the initial population can be set as PS 0 , set the maximum population size to PS max , set the minimum seed number to S 0 , set the maximum number of seeds to S max .

[0033] 2. Initialize the population. In the population-based optimization algorithm, the initi...

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 the technical field of workshop free guide trolley delivery scheduling, and particularly belongs to a discrete optimization method based on matrix workshop AGV scheduling. The method comprises the steps of 1, presetting related parameters of a discrete weed optimization algorithm, wherein the related parameters include an initial population number, a maximum population number, a minimum seed number and a maximum seed number; 2, initializing a population, specifically, generating a high-quality solution by using a neighborhood nearest distance heuristic algorithm, and generating other solutions by using a random generation method until the initial population number is reached; 3, optimizing the initialized population; and 4, outputting an optimal solution, specifically, judging whether a stop condition of calculating time of 5s is reached or not, and if not, returning to the step 3; and if the stop condition is reached, outputting the optimal solution in the current population. According to the invention, the scheduling scheme suitable for the actual production of the workshop can be obtained, and the scheduling management and optimization of the AGV are realized.

Description

technical field [0001] The invention relates to the technical field of workshop free-guided trolley delivery scheduling, in particular to a discrete optimization method based on matrix workshop AGV scheduling. Background technique [0002] Under the background of the country's vigorous promotion of the intelligent industrial industry, all large, medium and small enterprises in China have sprung up to transform and register under the slogan of building a comprehensive industry 4.0. Then the AGV industry has also been mentioned in the limelight. [0003] In recent years, my country's logistics technology and equipment industry has continued to grow strongly by 20-30%. Now that the logistics market and logistics equipment and technology are becoming more and more mature, the market's demand for AGV logistics handling equipment has gradually changed from "quantity" to "quality", which shows that in the future development of AGV, it should be intelligent and flexible. Improve a...

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
IPC IPC(8): G05B19/418
CPCG05B19/41895G05B2219/32252Y02P90/02Y02P90/60
Inventor 桑红燕李中凯潘全科韩玉艳郭恒伟
Owner LIAOCHENG UNIV
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