CN112839088A - Carriage distribution method, carriage distribution system and readable storage medium - Google Patents
Carriage distribution method, carriage distribution system and readable storage medium Download PDFInfo
- Publication number
- CN112839088A CN112839088A CN202110015877.8A CN202110015877A CN112839088A CN 112839088 A CN112839088 A CN 112839088A CN 202110015877 A CN202110015877 A CN 202110015877A CN 112839088 A CN112839088 A CN 112839088A
- Authority
- CN
- China
- Prior art keywords
- loaded
- articles
- article
- information
- carriage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B65—CONVEYING; PACKING; STORING; HANDLING THIN OR FILAMENTARY MATERIAL
- B65G—TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS
- B65G67/00—Loading or unloading vehicles
- B65G67/02—Loading or unloading land vehicles
- B65G67/04—Loading land vehicles
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- H04L67/125—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks involving control of end-device applications over a network
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Aviation & Aerospace Engineering (AREA)
- Mechanical Engineering (AREA)
Abstract
The invention discloses a carriage distribution method, a carriage distribution system and a readable storage medium, wherein the method comprises the following steps: receiving an assembly instruction; acquiring information of a plurality of objects to be loaded and carriage information with different sizes according to the assembling instruction; and generating an allocation scheme according to the information of each article to be loaded and the information of the carriage. The invention can automatically generate the distribution scheme according to the unassembled article information and the carriage information without manual work, and has higher efficiency.
Description
Technical Field
The invention relates to the technical field of logistics transportation, in particular to a cargo loading method, a cargo loading system and a readable storage medium.
Background
In the logistics operation process, link such as collection goods, storage, circulation processing, letter sorting, distribution of goods, loading, transportation are usually included, current goods loading adopts the manual work to carry out arranging and the assembly of goods, often the workman need constantly adjust the goods and arrange, because the goods is not of uniform size, the manpower is not only wasted to the mode of manual work arranging, and efficiency is low excessively moreover.
Disclosure of Invention
The invention provides a vehicle control method, a vehicle and a readable storage medium, and aims to solve the problems that manpower is wasted and efficiency is too low due to a manual arrangement mode.
In order to achieve the above object, the present invention provides a car allocation method, comprising the steps of:
receiving an assembly instruction;
acquiring information of a plurality of objects to be loaded and carriage information with different sizes according to the assembling instruction;
and generating an allocation scheme according to the information of each article to be loaded and the information of the carriage.
Preferably, the car information includes a car placement area and a car area, and the step of obtaining information of a plurality of pieces of goods to be loaded of different sizes and the car information according to the assembly instruction includes:
setting one of a plurality of articles to be loaded as a loaded article, deleting the article to be loaded from information of the article to be loaded, and calculating to obtain a gap area after the loaded article is placed in a carriage according to the bottom area, the carriage area and the carriage placement area of the article to be loaded;
judging whether the information of the articles to be loaded exists in the articles to be loaded which can be contained in the gap area or not;
if the article to be loaded which can be contained in the gap area exists, the article to be loaded is set as an article to be selected, one of the articles to be selected is set as a new loaded article, the new loaded article is deleted from the information of the article to be loaded, the gap area is updated according to the bottom area, the carriage area and the carriage placement area of the new loaded article, and the following steps are executed: judging whether the information of the articles to be loaded has the articles to be loaded which can be contained in the gap area;
if not, judging whether the information of the articles to be loaded contains the articles to be loaded which can be contained in the carriage placement area;
if not, an allocation plan is generated according to each loaded article.
Preferably, after the step of determining whether or not there is an article to be loaded that can be stored in a carriage placement area in the information on the article to be loaded, the method further includes:
if yes, the articles to be loaded which can be contained in the carriage placing area are set to be loaded, and the following steps are executed: and deleting the articles to be loaded from the information of the articles to be loaded, and calculating to obtain a gap area after the loaded articles are placed in the carriage according to the bottom area, the carriage area and the carriage placing area of the articles to be loaded.
Preferably, the step of determining whether or not there is an article to be loaded that can be stored in a carriage placement area in the article to be loaded information:
judging whether the information of the articles to be loaded has the articles to be loaded with the length and the width which are not more than the length and the width of the gap area;
if yes, determining that the to-be-loaded articles which can be contained in the gap area exist in the to-be-loaded article information;
if not, determining that the to-be-loaded articles which can be contained in the gap area do not exist in the to-be-loaded article information.
Preferably, before the step of setting one of the plurality of items to be loaded as a loaded item, the method further comprises:
acquiring the bottom area of the articles to be loaded and a preset safety interval;
and obtaining the bottom area of the articles to be loaded according to the bottom area of the articles to be loaded and the preset safety interval.
Preferably, the step of setting one of the plurality of items to be loaded as a loaded item comprises:
judging whether the assembly instruction has a corresponding priority level;
if not, setting one of the multiple articles to be loaded as the loaded article according to the priority level;
if yes, any one of the plurality of articles to be loaded is set as the loaded article.
Preferably, the car information includes car height, and the step of generating an allocation plan according to each loaded item includes:
calculating the carriage placing height according to the carriage height and a preset threshold value;
determining the stacking layer number of the loaded articles according to the carriage placing height and the height of the loaded articles in the distribution scheme;
and generating a distribution scheme according to the stacking layers of the loaded articles and the stacking layers of the loaded articles.
Preferably, after the step of generating an allocation plan according to the information of the items to be loaded and the information of the carriages, the method further includes:
and sending a loading control command to the loading equipment so as to control the loading equipment to load according to the distribution scheme.
To achieve the above object, the present invention further provides a car allocation system, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the car allocation method as described above.
To achieve the above object, the present invention also provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the car allocation method as described above.
The invention receives an assembly instruction; acquiring information of a plurality of objects to be loaded and carriage information with different sizes according to the assembling instruction; and generating an allocation scheme according to the information of each article to be loaded and the information of the carriage. The invention can automatically generate the distribution scheme according to the unassembled article information and the carriage information without manual work, and has higher efficiency.
Drawings
FIG. 1 is a schematic diagram of a hardware operating environment according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of a car allocation method according to a first embodiment of the present invention.
Detailed Description
It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
Referring to fig. 1, fig. 1 is a schematic diagram of a hardware structure of a car distribution system according to various embodiments of the present invention. The car distribution system comprises a communication module 01, a memory 02, a processor 03 and the like. Those skilled in the art will appreciate that the car distribution system shown in fig. 1 may also include more or fewer components than shown, or combine certain components, or a different arrangement of components. The processor 03 is connected to the memory 02 and the communication module 01, respectively, and the memory 02 stores a computer program, which is executed by the processor 03 at the same time.
The communication module 01 may be connected to an external device through a network. The communication module 01 may receive data sent by an external device, and may also send data, instructions, and information to the external device, where the external device may be an electronic device such as a mobile phone, a tablet computer, a notebook computer, and a desktop computer.
The memory 02 may be used to store software programs and various data. The memory 02 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data or information created from the use of the car allocation system, or the like. Further, the memory 02 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device.
The processor 03, which is a control center of the car distribution system, connects various parts of the entire car distribution system using various interfaces and lines, and performs various functions of the car distribution system and processes data by operating or executing software programs and/or modules stored in the memory 02 and calling data stored in the memory 02, thereby performing overall monitoring of the car distribution system. Processor 03 may include one or more processing units; preferably, the processor 03 may integrate an application processor, which mainly handles operating systems, user interfaces, application programs, etc., and a modem processor, which mainly handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 03.
Although not shown in fig. 1, the car distribution system may further include a circuit control module, where the circuit control module is configured to be connected to a commercial power supply to implement power control and ensure normal operation of other components.
Those skilled in the art will appreciate that the configuration of the device shown in fig. 1 is not intended to be limiting of the device and may include more or fewer components than those shown, or some components may be combined, or a different arrangement of components.
Various embodiments of the method of the present invention are presented in terms of the above-described hardware architecture.
Referring to fig. 2, in a first embodiment of the car allocation method of the present invention, the car allocation method includes the steps of:
step S10, receiving an assembly instruction;
step S20, obtaining information of a plurality of objects to be loaded and compartment information with different sizes according to the assembly instruction;
step S30, generating an allocation plan according to each of the information of the items to be loaded and the information of the carriage.
Whether an assembly instruction is received or not is detected, the assembly instruction is received, a plurality of pieces of to-be-loaded article information with different sizes and carriage information are obtained according to the assembly instruction, wherein the to-be-loaded article information is a plurality of pieces of article information with different sizes, which are not loaded, pre-input by a user, the to-be-loaded article information comprises information of bottom area, length, width, height and the like of the to-be-loaded article, and the carriage information comprises information of carriage area, carriage placement area, length, height, width and the like. And further generating a distribution scheme according to the information of each to-be-loaded article and the information of the carriage. The invention can automatically generate the distribution scheme according to the unassembled article information and the carriage information without manual work, and has higher efficiency.
Further, based on the second embodiment of the car allocation method of the present invention which is proposed as the first embodiment of the car allocation method of the present invention, in the present embodiment, the step S20 includes:
step S21, setting one of a plurality of articles to be loaded as a loaded article, deleting the article to be loaded from the information of the article to be loaded, and calculating to obtain a gap area after the loaded article is placed in the carriage according to the bottom area, the carriage area and the carriage placement area of the article to be loaded;
in this embodiment, one article to be loaded is selected from a plurality of articles to be loaded, one article to be loaded can be selected optionally or selected according to the priority condition associated with the article to be loaded, the selected article to be loaded is set as an article to be loaded, the article to be loaded is deleted from the information of the article to be loaded, the article to be loaded is numbered, a gap region where the article to be loaded is placed behind a carriage is obtained by calculation according to the bottom area of the article to be loaded, the carriage area, and the carriage placing area, the gap region is obtained by subtracting the bottom area of the article to be loaded from the carriage area, the carriage area is equal to the carriage placing area in the initial stage, and the carriage placing area is gradually reduced along with the increase of the article to be loaded.
Step S22, judging whether the information of the articles to be loaded has the articles to be loaded which can be contained in the gap area;
step S23, if yes, setting the articles to be loaded which can be contained in the gap area as articles to be selected, setting one of the articles to be selected as a new loaded article, deleting the new loaded article in the information of the articles to be loaded, updating the gap area according to the bottom area, the carriage area and the carriage placement area of the new loaded article, and executing step S22;
in this embodiment, it is determined whether there is an article to be loaded that can be accommodated in the gap area in the information of the article to be loaded, if there is an article to be loaded that can be accommodated in the gap area, the article to be loaded that can be accommodated in the gap area is further set as an article to be selected, one of the plurality of articles to be selected is set as a new article to be loaded, the new article to be loaded is deleted from the information of the article to be loaded, the new article to be loaded is numbered, the gap area is updated according to a bottom area, a car area, and a car placement area of the new article to be loaded, and it is determined whether there is an article to be loaded that can be accommodated in the gap area in the information of the article to be loaded.
Step S24, if not, judging whether the information of the articles to be loaded has articles to be loaded which can be stored in the carriage placement area;
if not, in step S25, an allocation plan is generated from each loaded item.
In this embodiment, if there is no to-be-loaded article that can be stored in the void area, it is further determined whether there is a to-be-loaded article that can be stored in the carriage placement area in the to-be-loaded article information, and if there is no to-be-loaded article that can be stored in the carriage placement area in the to-be-loaded article information, there is no to-be-loaded article that matches at this time, a distribution scheme is generated according to each loaded article and the article number according to a preset sequence, and the article number is an identification number generated by setting the loaded article each time, so that the loaded articles can be arranged according to the preset sequence; in another embodiment, the allocation plan may also be generated according to the loaded items and the coordinate numbers of the loaded items, and the seat numbers are identification numbers generated for setting whether the loaded items are stored in the void space or the carriage arrangement area each time, so that the loaded items may be arranged in a preset order. For example, if the coordinates of the loaded article set in step S21 are (1,1), the coordinates of the loaded article stored in the gap area in step S23 are (1,2), and then the coordinates of the loaded article set in step S23 are (1,3), until the gap area cannot store the article to be loaded; the loaded item coordinate set in step S21 is newly executed after step S24 as (2.1), and so on.
Further, after step S24, the method further includes:
in step S26, if yes, the method performs: the articles to be loaded which can be accommodated in the carriage arrangement area are set as loaded articles, and step S21 is performed.
Judging whether to have in waiting to load in the thing information of this embodiment and can accomodate in the carriage and place the area, if there is the article of waiting to load that can accomodate in the carriage and place the area in waiting to load the thing information, will accomodate waiting to load the thing of area and set up to loaded the thing to the loaded thing, delete this article of waiting to load in waiting to load thing information, recalculate the space region, specifically, calculate according to the bottom area of this article of waiting to load, carriage area, carriage and place the area and obtain this loaded article and place the space region behind the carriage.
If the to-be-loaded items that can be stored in the carriage placement area are equal to the carriage placement area and have no void region, and at this time, both the carriage placement area and the void region are zero, the distribution plan is generated from each loaded item. If the to-be-loaded articles which can be stored in the carriage placement area are smaller than the carriage placement area and new gap areas are generated, the to-be-loaded articles which can be stored in the carriage placement area are set to be loaded articles, the to-be-loaded articles are deleted from the to-be-loaded article information, and the gap areas are recalculated. The invention can automatically generate the distribution scheme according to the unassembled article information and the carriage information without manual work, and has higher efficiency.
Further, a third embodiment of the car distribution method of the present application is proposed based on the second embodiment of the car distribution method of the present application, and in this embodiment, the step S22 includes:
step S220, judging whether the information of the articles to be loaded has the articles to be loaded, wherein the length and the width of the articles to be loaded are not greater than the length and the width of the gap area;
step S221, if yes, determining that the to-be-loaded articles which can be accommodated in the gap area exist in the to-be-loaded article information;
step S222, if not, determining that there is no article to be loaded which can be accommodated in the gap area in the article to be loaded information.
In this embodiment, whether the information of the to-be-loaded articles can be stored in the gap area is determined according to the length and the width of the to-be-loaded articles, specifically, whether the information of the to-be-loaded articles is the to-be-loaded articles of which the length and the width are not greater than the length and the width of the gap area is determined, and if the information of the to-be-loaded articles is the to-be-loaded articles of which the length and the width are not greater than the length and the width of the gap area, it is indicated that the to-be-loaded articles can be stored in the gap area, and it is determined that the to; if the to-be-loaded articles with the lengths and the widths larger than those of the gap area exist in the to-be-loaded article information, the to-be-loaded articles are over-large in size and cannot be placed in the gap area, and it is determined that the to-be-loaded articles which can be contained in the gap area do not exist in the to-be-loaded article information. The invention can automatically calculate the gap area without manual calculation, thereby improving the efficiency and saving the time.
Further, a fourth embodiment of the car distribution method of the present application is proposed based on the third embodiment of the car distribution method of the present application, and in this embodiment, before step S21, the method further includes:
step S40, acquiring the bottom area of the articles to be loaded and a preset safety interval;
and step S41, obtaining the bottom area of the articles to be loaded according to the bottom area of the articles to be loaded and the preset safety interval.
The bottom surface area of article to be loaded is obtained in this embodiment, and actual dimensions includes actual bottom surface area, in order to make fork truck normally work, need reserve certain operating space, sets up preset safety interval, and preset safety interval can be according to actual conditions self-setting, obtains the bottom surface area of article to be loaded according to the actual bottom surface area of article to be loaded and preset safety interval, can ensure that fork truck normally works.
Further, a fifth embodiment of the car distribution method of the present application is proposed based on the second embodiment of the car distribution method of the present application, and in this embodiment, before step S21, the method further includes:
step S50, judging whether the assembly instruction has a corresponding priority level;
step S51, if not, one of the multiple articles to be loaded is set as the loaded article according to the priority level;
in step S52, if yes, any one of the plurality of items to be loaded is set as a loaded item.
In this embodiment, after the assembly instruction is received, whether the assembly instruction has the corresponding priority level is determined, and if it is determined that the assembly instruction has the corresponding priority level, one article to be loaded is selected from the plurality of articles to be loaded according to the priority level, and is set as the loaded article. The priority level comprises a first priority, a second priority, a third priority and the like, and can be set by a user according to actual conditions. The first priority can select the articles to be loaded according to the time information, specifically, each batch of goods has the corresponding time information, and the articles to be loaded can be selected according to time. The second priority may select the items to be loaded according to the size information, and specifically, may preferentially select the items to be loaded with a large size. The third priority can select the articles to be loaded according to the containing information, and particularly can preferentially select the articles to be loaded with a large containing quantity. If the loading instruction does not have the corresponding priority level, one article to be loaded can be selected from a plurality of articles to be loaded at will and set as the loaded article. In actual use, whether priority levels are set or not can be selected according to actual needs, and different assembly requirements are met.
Further, a sixth embodiment of the car distribution method of the present application is proposed based on the second embodiment of the car distribution method of the present application, and in this embodiment, the step of generating a distribution plan according to each loaded item in step S25 includes:
step S60, calculating the carriage placing height according to the carriage height and a preset threshold value;
step S61, determining the stacking layer number of the loaded articles according to the carriage placing height and the height of the loaded articles in the distribution scheme;
step S62, a distribution plan is generated based on the number of stacked layers of each loaded article and each loaded article.
In this embodiment, in order to reserve a certain operating space for the forklift, a threshold may be preset, and the carriage placing height is obtained by subtracting the preset threshold from the carriage height, where the preset threshold may be set according to an actual situation, for example, the preset threshold may be set to 10cm, and if the carriage height is 240cm, the carriage placing height is 240cm-10cm, that is, 230 cm. The number of stacked layers per loaded item is further determined, and specifically, the number of stacked layers per loaded item is obtained by dividing the height of the loaded item by the car-placing height, for example, the height of a certain loaded item is 100cm, the car-placing height is 230cm, the number of stacked layers is 2.3, and is about 2, and the number of stacked layers per loaded item is 2. After the number of stacked layers of each loaded article is determined, a distribution plan is generated according to the number of stacked layers and each loaded article. Can ensure the normal work of the forklift.
Further, a seventh embodiment of the car distribution method of the present application is proposed based on the first embodiment of the car distribution method of the present application, and in this embodiment, after step S30, the method further includes:
and step S300, sending a loading control instruction to a loading device so as to control the loading device to load according to the distribution scheme.
In this embodiment, an assembly instruction is sent to a loading device, where the loading device includes a forklift, the loading device analyzes the control instruction after receiving the control instruction to obtain a distribution scheme, and the loading device loads according to the distribution scheme, and can load vehicles in sequence according to numbers corresponding to loaded articles. The invention can automatically generate a distribution scheme according to the information of the unassembled articles and the information of the carriages, and can automatically load the articles without manpower, thereby having higher efficiency.
The invention also proposes a computer-readable storage medium on which a computer program is stored. The computer-readable storage medium may be the Memory 02 in the car allocation system of fig. 1, and may also be at least one of a ROM (Read-Only Memory)/RAM (Random Access Memory), a magnetic disk, and an optical disk, and the computer-readable storage medium includes several pieces of information for causing the car allocation method to perform the method according to the embodiments of the present invention.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A car allocation method, characterized in that the method comprises the steps of:
receiving an assembly instruction;
acquiring information of a plurality of objects to be loaded and carriage information with different sizes according to the assembling instruction;
and generating an allocation scheme according to the information of each article to be loaded and the information of the carriage.
2. The car distribution method according to claim 1, wherein the car information includes a car placement area and a car area, and the step of acquiring the plurality of pieces of different-sized to-be-loaded item information and the car information according to the assembly instruction includes:
setting one of a plurality of articles to be loaded as a loaded article, deleting the article to be loaded from information of the article to be loaded, and calculating to obtain a gap area after the loaded article is placed in a carriage according to the bottom area, the carriage area and the carriage placement area of the article to be loaded;
judging whether the information of the articles to be loaded exists in the articles to be loaded which can be contained in the gap area or not;
if the article to be loaded which can be contained in the gap area exists, the article to be loaded is set as an article to be selected, one of the articles to be selected is set as a new loaded article, the new loaded article is deleted from the information of the article to be loaded, the gap area is updated according to the bottom area, the carriage area and the carriage placement area of the new loaded article, and the following steps are executed: judging whether the information of the articles to be loaded has the articles to be loaded which can be contained in the gap area;
if not, judging whether the information of the articles to be loaded contains the articles to be loaded which can be contained in the carriage placement area;
if not, an allocation plan is generated according to each loaded article.
3. The car body allocation method according to claim 2, wherein, after the step of determining whether or not there is an article to be loaded that can be stored in a car body placement area in the article information to be loaded, the method further comprises:
if yes, the articles to be loaded which can be contained in the carriage placing area are set to be loaded, and the following steps are executed: and deleting the articles to be loaded from the information of the articles to be loaded, and calculating to obtain a gap area after the loaded articles are placed in the carriage according to the bottom area, the carriage area and the carriage placing area of the articles to be loaded.
4. The carriage distribution method according to claim 2, wherein the step of determining whether or not there is an article to be loaded storable in a carriage placement area in the article to be loaded information:
judging whether the information of the articles to be loaded has the articles to be loaded with the length and the width which are not more than the length and the width of the gap area;
if yes, determining that the to-be-loaded articles which can be contained in the gap area exist in the to-be-loaded article information;
if not, determining that the to-be-loaded articles which can be contained in the gap area do not exist in the to-be-loaded article information.
5. The car allocation method according to claim 2, wherein said step of setting one of the plurality of items to be loaded as a loaded item further comprises:
acquiring the bottom area of the articles to be loaded and a preset safety interval;
and obtaining the bottom area of the articles to be loaded according to the bottom area of the articles to be loaded and the preset safety interval.
6. The car allocation method according to claim 2, wherein the step of setting one of the plurality of items to be loaded as a loaded item includes:
judging whether the assembly instruction has a corresponding priority level;
if not, setting one of the multiple articles to be loaded as the loaded article according to the priority level;
if yes, any one of the plurality of articles to be loaded is set as the loaded article.
7. A car distribution method as claimed in claim 2, wherein said car information includes car height, and said step of generating a distribution plan based on each loaded item includes:
calculating the carriage placing height according to the carriage height and a preset threshold value;
determining the stacking layer number of the loaded articles according to the carriage placing height and the height of the loaded articles in the distribution scheme;
and generating a distribution scheme according to the stacking layers of the loaded articles and the stacking layers of the loaded articles.
8. The car distribution method according to claim 1, wherein the step of generating a distribution plan based on the information on the items to be loaded and the car information further comprises:
and sending a loading control command to the loading equipment so as to control the loading equipment to load according to the distribution scheme.
9. A car allocation system, characterized in that it comprises a memory, a processor and a computer program stored on said memory and executable on said processor, said computer program, when executed by said processor, implementing the steps of the car allocation method according to any one of claims 1 to 8.
10. A computer-readable storage medium, characterized in that a computer program is stored thereon, which computer program, when being executed by a processor, carries out the steps of the car allocation method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110015877.8A CN112839088A (en) | 2021-01-06 | 2021-01-06 | Carriage distribution method, carriage distribution system and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110015877.8A CN112839088A (en) | 2021-01-06 | 2021-01-06 | Carriage distribution method, carriage distribution system and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112839088A true CN112839088A (en) | 2021-05-25 |
Family
ID=75926430
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110015877.8A Pending CN112839088A (en) | 2021-01-06 | 2021-01-06 | Carriage distribution method, carriage distribution system and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112839088A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030110102A1 (en) * | 2001-05-29 | 2003-06-12 | Chen-Fu Chien | Method for goods arrangement and its system |
| CN110175405A (en) * | 2019-05-27 | 2019-08-27 | 上海维祥信息技术有限公司 | Vehicle loading optimization method and system |
-
2021
- 2021-01-06 CN CN202110015877.8A patent/CN112839088A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030110102A1 (en) * | 2001-05-29 | 2003-06-12 | Chen-Fu Chien | Method for goods arrangement and its system |
| CN110175405A (en) * | 2019-05-27 | 2019-08-27 | 上海维祥信息技术有限公司 | Vehicle loading optimization method and system |
Non-Patent Citations (1)
| Title |
|---|
| 魏丽军: "求解装箱问题的启发式算法研究", 《中国优秀硕士论文全文数据库 信息科技辑》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108398924B (en) | Scheduling method and scheduling device for robot transport vehicle | |
| CN111047100B (en) | Method and system for packing logistics containers | |
| CN108698760B (en) | Transportation system, transportation method, and management system | |
| CN112801565B (en) | Goods allocation dispatching method, system and storage medium for intelligent storage | |
| CN110675102A (en) | Order binding method and device, computer equipment and storage medium | |
| CN110222862A (en) | Palletizing method and device | |
| CN115649722B (en) | Dispatching method and device for storage vehicles | |
| CN116402445B (en) | Goods delivery scheduling method, device and computer equipment | |
| CN117114556A (en) | Management method, system and device for improving capacity scheduling efficiency | |
| CN113722921B (en) | Carriage loading system and method | |
| CN112839088A (en) | Carriage distribution method, carriage distribution system and readable storage medium | |
| CN110738374A (en) | Method and device for assembling goods | |
| CN117114555A (en) | Method, system and device for scheduling waybill for reducing empty load rate | |
| CN115829175B (en) | Goods storage operation route selection method, device, system and medium for dense warehouse | |
| CN115796750B (en) | Goods warehouse-in method, goods warehouse-out device and computer equipment | |
| CN117114537A (en) | Logistics storage order distribution method, system and storage medium | |
| CN111461476A (en) | Outbound order distribution method, system, equipment and storage medium for hybrid warehouse | |
| KR101135464B1 (en) | Method for opimized arranging container and computer readable recording medium | |
| CN110728407A (en) | Method and device for assembling goods | |
| CN115108274A (en) | Container packing method considering cargo integrity | |
| CN111498368B (en) | Method and device for determining storage position | |
| CN112950102A (en) | Replenishment method, replenishment device, computer equipment and storage medium | |
| US20240330851A1 (en) | Method, information processing apparatus, and non-transitory computer readable medium | |
| CN113762562B (en) | Method, device and storage medium for generating load information | |
| CN111950756A (en) | Unmanned forklift routing planning method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210525 |