CN111415028A - Optimization algorithm for warehouse-in and warehouse-out program of storage crane - Google Patents

Abstract

The invention discloses an optimization algorithm for warehouse entry and exit of a warehouse crane, which comprises a warehouse entry algorithm and a warehouse exit algorithm, wherein the algorithm is mainly used for a system which is finished by the warehouse crane and used for carrying out boxing and stacking on different types of articles, each box can only store one type of article, namely, the different types of articles cannot be loaded into one box, each article is fixedly placed in a certain area of a storage yard, and the algorithm is finished through a WinCC process monitoring system and an SQ L Server database.

Description

Optimization algorithm for warehouse-in and warehouse-out program of storage crane

Technical Field

The invention relates to the technical field of storage crane control, in particular to an optimization algorithm for a storage crane in-out warehouse program.

Background

With the continuous development and popularization of computer and internet of things information management technologies, the automation level of an intelligent storage crane management system is continuously improved, however, a set of complete warehouse entry and exit management system is required for the intelligent and efficient operation of the intelligent and efficient storage crane management system to achieve the full-automatic operation of the storage crane, so that a storage crane entry and exit program optimization algorithm is developed to provide technical support for the intelligent and efficient storage crane management system, and the operation efficiency is improved.

Disclosure of Invention

In order to improve the automation level of the storage crane and improve the operation efficiency of the storage crane in and out, the invention provides an optimization algorithm of a storage crane in and out program, which is realized by the following technical scheme:

the algorithm is completed through a WinCC process monitoring system and a SQ L Server database, wherein an article information table, a box position information table, a warehousing information table and a ex-warehouse information table are established in the database, the article information table comprises article bar codes, names, models, manufacturers, duty ratios and quantity, the box position information table comprises article bar codes, box codes, X coordinates, Y coordinates, Z coordinates, a plurality of layers and duty ratios, the warehousing information table comprises article bar codes, quantity, warehousing time and operators, and the ex-warehouse information table comprises article bar codes, quantity, ex-warehouse time and operators.

The warehousing algorithm comprises the following steps:

step 1: when the articles are put in storage, the articles are identified by using the RFID technology, whether the same kind of articles exist in the database is inquired according to the article types, whether the boxes in which the same kind of articles exist are full is judged, if the same kind of articles do not exist or the boxes in which the same kind of articles exist are full, the empty boxes are removed from the empty box positions to hang empty boxes, and if not, the target boxes, namely the boxes in which the same kind of articles exist, are hung.

Step 2: before the crane hangs the box, firstly judging whether the crane is idle, if not, waiting until the crane is idle, then moving to a target box position to hang the box, hanging the box to an outlet, and then loading the articles into the box.

And step 3: the box is placed back and the database is updated. If the hanging box is not empty, the box is put back to the original position, and meanwhile, the article information, the box information and the warehousing information are updated.

The ex-warehouse algorithm comprises the following steps:

step 1: when the articles are delivered from the warehouse, the positions of the articles are inquired according to the types of the articles delivered from the warehouse, whether the articles exist above the boxes or not is judged, if the articles exist, the boxes need to be stacked, the boxes above the boxes are sequentially lifted to the nearest vacant positions from top to bottom until the boxes are positioned at the top, and then the target box is lifted.

Step 2: and (4) hanging the target box to an outlet, taking out the object, judging whether the box is empty at the moment, hanging the box back to an empty box position if the box is empty, and otherwise hanging the box back to the original position. Updating article information, box information and delivery information.

Compared with the prior art, the invention has the following obvious advantages: the algorithm has strong applicability and high efficiency, and simultaneously provides technical support for realizing the full-automatic operation of the storage crane, and can improve the operation efficiency.

Drawings

Fig. 1 is a schematic diagram of the warehousing process of the present invention.

FIG. 2 is a schematic diagram of the ex-warehouse process according to the present invention.

Detailed Description

The following further illustrates the practice of the present invention:

the warehouse crane warehouse-in and warehouse-out program optimization algorithm mainly aims at a system which is finished by the warehouse crane and used for boxing and stacking different types of articles, wherein the types of the articles are more than one, the number of boxes above each box position is more than one, only one type of article can be stored in each box, and each article is fixedly placed in a certain area of a storage yard.

The storage algorithm comprises the following steps:

step 1: when the articles are put in storage, the articles are identified by using the RFID technology, whether the same kind of articles exist in the database is inquired according to the article types, and whether a box in which the same kind of articles are located is full is judged, for example: and if the type of the article is found to be the motor through identification, searching whether the motor exists in the database. And if no same kind of articles exist or the boxes in which the same kind of articles exist are filled with articles, the empty boxes are hoisted to the empty box positions, otherwise, the target boxes, namely the boxes in which the same kind of articles exist, are hoisted.

Step 2: before the crane hangs the box, firstly judging whether the crane is idle, if not, waiting until the crane is idle, then moving to a target box position to hang the box, hanging the box to an outlet, and then loading the articles into the box.

And step 3: the box is placed back and the database is updated. If the hung article is not an empty box, the box is put back to the original position, meanwhile, the article information, the box information and the warehousing information are updated, if the hung article is an empty box, the region where the article is located is inquired, and vacant positions are searched layer by layer, for example: and if the article is a motor, searching the vacant positions in the rows 1, 2 and 3 layer by layer, placing the box on the vacant positions, and updating article information, box information and warehousing information.

The ex-warehouse algorithm comprises the following steps:

step 1: when the articles are delivered from the warehouse, the positions of the articles are inquired according to the types of the articles delivered from the warehouse, whether the articles exist above the boxes or not is judged, if the articles exist, the boxes need to be stacked, the boxes above the boxes are sequentially lifted to the nearest vacant positions from top to bottom until the boxes are positioned at the top, and then the target box is lifted.

Step 2: and (4) hanging the target box to an outlet, taking out the object, judging whether the box is empty at the moment, hanging the box back to an empty box position if the box is empty, and otherwise hanging the box back to the original position. Updating article information, box information and delivery information.

In the design of the optimization algorithm of the warehouse entry and exit program of the storage crane, the used database is an SQ L Server database, and a script program is written by using Vbs in WinCC configuration software, wherein WinCC can communicate with the SQ L Server and P L C in a control system of the storage crane, so that the algorithm is high in applicability and high in efficiency.

The technical means disclosed in the invention scheme are not limited to the technical means disclosed in the above embodiments, but also include the technical scheme formed by any combination of the above technical features. It should be noted that those skilled in the art can make various improvements and modifications without departing from the principle of the present invention, and such improvements and modifications are also considered to be within the scope of the present invention.

Claims (3)

1. The algorithm is completed through a WinCC process monitoring system and a SQ L Server database, wherein an article information table, a box position information table, a warehousing information table and a ex-warehouse information table are established in the database, the article information table comprises article bar codes, names, models, manufacturers, duty ratios and numbers, the box position information table comprises article bar codes, box codes, X coordinates, Y coordinates, Z coordinates, a plurality of layers and duty ratios, the warehousing information table comprises article bar codes, numbers, warehousing time and operators, and the ex-warehouse information table comprises article bar codes, numbers, ex-warehouse time and operators.

2. The optimization algorithm for the warehousing procedure of claim 1, wherein: the warehousing algorithm comprises the following steps:

step 1: when the articles are put in storage, the articles are identified by using the RFID technology, whether the same kind of articles exist in the database is inquired according to the article types, whether the boxes in which the same kind of articles exist are full is judged, if the same kind of articles do not exist or the boxes in which the same kind of articles exist are full, the empty boxes are removed from the empty box positions to hang empty boxes, and if not, the target boxes, namely the boxes in which the same kind of articles exist, are hung.

Step 2: before the crane hangs the box, firstly judging whether the crane is idle, if not, waiting until the crane is idle, then moving to a target box position to hang the box, hanging the box to an outlet, and then loading the articles into the box.

And step 3: the box is placed back and the database is updated. If the hanging box is not empty, the box is put back to the original position, and meanwhile, the article information, the box information and the warehousing information are updated.

3. The optimization algorithm for the warehousing procedure of claim 1, wherein: the ex-warehouse algorithm comprises the following steps:

step 1: when the articles are delivered from the warehouse, the positions of the articles are inquired according to the types of the articles delivered from the warehouse, whether the articles exist above the boxes or not is judged, if the articles exist, the boxes need to be stacked, the boxes above the boxes are sequentially lifted to the nearest vacant positions from top to bottom until the boxes are positioned at the top, and then the target box is lifted.

Step 2: and (4) hanging the target box to an outlet, taking out the object, judging whether the box is empty at the moment, hanging the box back to an empty box position if the box is empty, and otherwise hanging the box back to the original position. Updating article information, box information and delivery information.

Images