CN115994635A - Belt optimal discharging transportation path detection method, system and medium - Google Patents
Belt optimal discharging transportation path detection method, system and medium Download PDFInfo
- Publication number
- CN115994635A CN115994635A CN202310291756.5A CN202310291756A CN115994635A CN 115994635 A CN115994635 A CN 115994635A CN 202310291756 A CN202310291756 A CN 202310291756A CN 115994635 A CN115994635 A CN 115994635A
- Authority
- CN
- China
- Prior art keywords
- belt
- path
- time
- paths
- transportation
- 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.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Control Of Conveyors (AREA)
Abstract
The invention discloses a method, a system and a medium for detecting an optimal unloading and transporting path of a belt, comprising the following steps: and acquiring a starting point and an ending point of transportation, setting nodes between two ends of each belt, and calling a Dijkstra algorithm to acquire all paths from the starting point to the ending point and belt node marks on the corresponding paths. Analyzing and calculating by acquiring the state and the operation parameters of the current conveyor belt, including the carrying capacity in unit time, and screening the optimal conveyor belt path by combining with Dijkstra algorithm; the problems that the transportation tasks are large, the belt paths are many and the effective utilization cannot be realized in a large factory are solved, the idle belts are fully utilized, and the transportation efficiency is improved; and the most direct and efficient transportation path of two-point transportation is calculated by combining the carrying capacity of the belts and a plurality of belts, so that the labor cost can be saved.
Description
Technical Field
The invention relates to the technical field of belt conveying equipment, in particular to a method, a system and a medium for detecting an optimal belt unloading conveying path.
Background
In the existing production industry, particularly large miners and iron and steel enterprises, the requirement on production efficiency is higher and higher, long-distance material transportation in a factory area becomes an important link for effectively improving efficiency, and unmanned management is gradually realized by a remote control management mode for management of field mechanical equipment. At present, a discharging trolley and a conveying belt are commonly used for carrying materials, a plurality of belts and the discharging trolley are required to be arranged on a factory for multi-point conveying in the presence of a plurality of storage bins and stacking points, and during conveying, if no belt is detected in an idle mode, the condition that one belt is easy to use for a plurality of times occurs, so that the service life of the belt is reduced; in addition, how to maximize the belt utilization and select the optimal transportation path when other belts are idle is a problem that needs to be solved urgently at present.
Disclosure of Invention
In order to solve the technical problems in the background technology, the invention provides a method, a system and a medium for detecting the optimal unloading and transporting path of a belt, which can fully utilize an idle belt and improve the transporting efficiency. The specific technical scheme is as follows:
in a first aspect, the present invention provides a method for detecting an optimal discharging transport path of a belt, including the steps of:
s100, acquiring a starting point and an ending point of transportation, setting nodes between two ends of each belt, and calling Dijkstra algorithm to acquire all paths from the starting point to the ending point and belt node marks on corresponding paths; after all marked points are linearly connected each time, finishing one-time material transportation path selection;
s200, acquiring the current state of each belt, and eliminating the belt paths which are in use, are about to be used and maintained to obtain a first belt path list; the to-be-used state refers to a belt path of a belt with a work task in a preset unit time;
s300, creating the carrying capacity of each belt in unit time, acquiring the current required carrying task amount and preset carrying time, and eliminating belt paths of which the planned carrying time exceeds the preset carrying time to obtain a second belt path list;
s400, selecting the belt path with the shortest path as the optimal unloading transportation path.
Further, when the current state of each belt is obtained, a Dijkstra algorithm is called to carry out second marking, service conditions are set at the belt nodes, the service conditions are the belts which are not occupied and maintained, and a first belt path list is obtained.
Further, when rejecting the belt path in use, to be used and serviced, the method further comprises the steps of:
and S210, if the number of the belt paths is 0 at this time, adjusting the screening standard, deferring the use time of the belt to N hours, and removing the belt paths which are in use, are about to be used and maintained again.
Further, after S210 is executed, the number of belt paths is still 0, and the method further includes the steps of:
s220, only the belt path being used and serviced is rejected.
Further, when the planned transportation time exceeds the belt path within the preset transportation time, the method further comprises the steps of:
and S310, if the number of the belt paths is 0, increasing the preset transportation time, and rescreening to obtain a third belt path.
In a second aspect, the invention provides a system for detecting an optimal unloading and transporting path of a belt, which comprises a marking module, a first marking module and a second marking module, wherein the marking module is used for acquiring a starting point and an ending point of transportation, setting nodes between two ends of each belt, and calling Dijkstra algorithm to acquire all paths from the starting point to the ending point and belt node marks on corresponding paths; after all marked points are linearly connected each time, finishing one-time material transportation path selection;
the state detection module is used for acquiring the current state of each belt, removing the belt paths which are in use, are about to be used and maintained, and obtaining a first belt path list; the to-be-used state refers to a belt path of a belt with a work task in a preset unit time;
the time calculation module is used for creating the carrying capacity of each belt in unit time, acquiring the current task quantity to be transported and the preset transportation time, eliminating belt paths of which the planned transportation time exceeds the preset transportation time, and obtaining a second belt path list;
and the path calculation module is used for selecting the belt path with the shortest path as the optimal unloading transportation path.
Further, the state detection module is further configured to call Dijkstra algorithm to perform second marking when the current state of each belt is obtained, set a use condition at a belt node, where the use condition is a belt that is not occupied and maintained, and obtain a first belt path list.
Further, the state detection module is further configured to, after rejecting the belt paths that are being used, are to be used and maintained, adjust the screening criteria if the number of the belt paths is 0 at this time, delay the use time of the belt to N hours, and reject the belt paths that are being used, are to be used and maintained again; when the number of belt paths is still 0 after the above steps are performed, only the belt paths being used and maintained are rejected.
Further, the time calculation module is configured to increase the preset transportation time and rescreen to obtain a third belt path if the number of the belt paths at the moment is 0 after the planned transportation time is removed and exceeds the belt paths in the preset transportation time.
In a third aspect, the present invention also provides a computer readable storage medium storing computer instructions for performing the method for detecting an optimal discharge transport path of a belt according to any one of the above.
The beneficial effects of the invention are as follows: analyzing and calculating by acquiring the state and the operation parameters of the current conveyor belt, including the carrying capacity in unit time, and screening the optimal conveyor belt path by combining with Dijkstra algorithm; the problems that the transportation tasks are large, the belt paths are many and the effective utilization cannot be realized in a large factory are solved, the idle belts are fully utilized, and the transportation efficiency is improved; and the most direct and efficient transportation path of two-point transportation is calculated by combining the carrying capacity of the belts and a plurality of belts, so that the labor cost can be saved.
Drawings
FIG. 1 is a flow chart of a method for detecting an optimal discharging and transporting path of a belt according to the present invention.
FIG. 2 is another flow chart of a method for detecting an optimal discharge transport path of a belt according to the present invention.
Fig. 3 is a schematic block diagram of a belt optimal discharge transport path detection system according to the present invention.
Description of the embodiments
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention. On the contrary, the invention is intended to cover any alternatives, modifications, equivalents, and variations as may be included within the spirit and scope of the invention as defined by the appended claims. Further, in the following detailed description of the present invention, certain specific details are set forth in order to provide a better understanding of the present invention. The present invention will be fully understood by those skilled in the art without the details described herein.
Referring to fig. 1 to 3, a method for detecting an optimal discharging transport path of a belt includes the steps of:
s100, acquiring a starting point and an ending point of transportation, setting nodes between two ends of each belt, and calling Dijkstra algorithm to acquire all paths from the starting point to the ending point and belt node marks on corresponding paths; after all marked points are linearly connected each time, finishing one-time material transportation path selection;
in the embodiment, during operation, staff needs to input a starting point and a finishing point of belt transportation on a system, and the belt is connected between each unloading point in a factory, so that when a specific road between the starting point and the finishing point of a material transportation belt is calculated, the Dijkstra algorithm is adopted in the design, and the Dijkstra algorithm is optimized in practical application;
the basic idea of the Dijkstra algorithm is to assume that each node has a pair of labels (dj, pj), where dj is the length of the shortest path from the origin point s to the point j (the shortest path from the vertex to itself is a zero-way (a way without an arc) with a length equal to zero), and pj is the point before the point j in the shortest path from s to j. The basic procedure for solving the shortest path algorithm from origin point s to point j is as follows:
1) Initializing. The origin point is set as:
ds=0, ps is null;
all other points di= infinity, pi=;
the origin point s is marked, k=s, and all other points are set to unlabeled.
2) The distances from all marked points k to their directly connected unmarked points j are checked,
and set dj = min [ dj, dk + lkj ] where lkj is the direct connection distance from point k to j.
3) The next point is selected. From all unlabeled nodes, the smallest one i in dj is selected:
di=min [ dj ], all unlabeled points j ], point i is selected as a point in the shortest path and set to labeled.
4) Finding the previous point of point i, finding the point j directly connected to point i from the marked points, and setting i=j as the previous point
5) Point i is marked. If the algorithm is fully deduced, otherwise, note k=i, go to 2) resume. Until all points have been marked.
And after all marked points are connected in a straight line each time, the path selection of one material transportation is completed.
S200, acquiring the current state of each belt, and eliminating the belt paths which are in use, are about to be used and maintained to obtain a first belt path list; the to-be-used state refers to a belt path of a belt with a work task in a preset unit time;
in the embodiment, the system is arranged on the belts through a plurality of sensors, the specific running states of equipment on each belt are obtained through the sensors, the actual use state of the equipment is estimated, and when the system receives a new transportation task, the state detection is carried out on the belts again; specifically, the to-be-used state refers to a belt path of a belt with a work task in a preset unit time; when the preset unit time refers to the operation of a worker, the use time and authority of a reserved belt can be input into the system in advance, if a certain belt is reserved in 1 hour in the future, the belt is occupied for transporting materials, and when the two transportation tasks overlap with each other in the time of occupying the cover belt, the belt path is rejected and used, and the Dijkstra algorithm does not mark the belt path.
S300, creating the carrying capacity of each belt in unit time, acquiring the current required carrying task amount and preset carrying time, and eliminating belt paths of which the planned carrying time exceeds the preset carrying time to obtain a second belt path list;
in the embodiment, when a worker transports materials, the transport amount and the preset transport time are input at first; the planned transportation time refers to the time required by the completion of the operation of the belt which is being transported or is to be transported, the preset transportation time refers to the time required by each path for transporting the task by calculating the transportation quantity of the task and the transportation capacity of the belt in unit time of each road section when the point A is transported to the point B, if the time exceeds the preset transportation time, the task is judged not to be completed in the required time period by the path, and the belt path is eliminated.
S400, selecting the belt path with the shortest path as the optimal unloading transportation path.
In this embodiment, after the unconditional route is eliminated, the belt transport route having the shortest route is selected from among them.
Preferably, when the current state of each belt is obtained, dijkstra algorithm is called to carry out second marking, service conditions are set at the belt nodes, the service conditions are the belts which are not occupied and maintained, and a first belt path list is obtained.
In this embodiment, when conditions are set at different nodes (e.g., material conveyor belts are in use, the path will not be marked), it will be forced that a new conveyor path will be formed by selecting and marking from another new path. After the n times of different node condition marks are selected, data of n times of different node condition transportation paths are formed and used as basic data of material transportation path selection during actual material belt transportation, and a plurality of transportation paths can be determined through the n times of data screening and combination of different nodes so as to facilitate actual execution of material transportation.
Preferably, when rejecting the belt path being used, about to be used and serviced, the method further comprises the steps of:
and S210, if the number of the belt paths is 0 at this time, adjusting the screening standard, deferring the use time of the belt to N hours, and removing the belt paths which are in use, are about to be used and maintained again.
In this embodiment, this step is to prevent the situation that the belt path selection is empty because all the currently occupied belt paths are deleted after the first screening, so as to ensure that the optimal path screening is always performed. Specifically, after the belt service time is delayed to N hours, the belt which has completed work at this time or the belt which is maintained can be reentered into the screening list, the system can continuously visit and collect the belt condition after N hours, and an operator can reserve the use path of the belt in advance, so that the problem of subsequent continuous visit is solved, and the working efficiency can be improved to a certain extent. The N hours may be set according to the actual situation of the operator, and are not particularly limited herein.
Preferably, after S210 is performed, the number of belt paths is still 0, and the method further includes the steps of:
s220, only the belt path being used and serviced is rejected.
In this embodiment, when the operator selects the belt path again after N hours, this step is performed to give the operator selectable alternatives by adjusting the screening strategy using the slot time just before the use of the reserved belt. For example, the operator selects a proper path after selecting 1 hour, and then the path C of the belt is reserved for use after 1 hour, when the task amount of the material to be transported currently is 20 tons, the operator can split the task amount and then transport the material in batches according to the time of the belt to be transported, so that the transportation pressure is solved to a certain extent, and the utilization efficiency of the belt is improved.
Preferably, when the planned transportation time exceeds the belt path within the preset transportation time, the method further comprises the steps of:
and S310, if the number of the belt paths is 0, increasing the preset transportation time, and rescreening to obtain a third belt path.
In this embodiment, the required time for transporting the task in each path is obtained by calculating the transport capacity of the task and the transport capacity of the belt in each section per unit time, if the time exceeds the preset transport time, it is determined that the task is not completed in the required time period in the path, after the task cannot be completed on time and the belt path is removed, the required preset time is adjusted, the standard of the completion time is reduced, screening is performed after the preset transport time is increased, and the screening standard is reduced, so that the situation that the transport task is delayed is prevented.
In a second aspect, based on the same inventive concept, the invention further provides a system for detecting an optimal discharging and transporting path of a belt, wherein the working principle of the system is the same as or similar to that of the method for detecting the optimal discharging and transporting path of the belt provided by the invention, and therefore, repeated parts are not repeated. Comprising the following steps:
the marking module 10 is used for obtaining a starting point and an ending point of transportation, setting nodes between two ends of each belt, and calling Dijkstra algorithm to obtain all paths from the starting point to the ending point and belt node marks on corresponding paths; after all marked points are linearly connected each time, finishing one-time material transportation path selection;
the state detection module 20 is configured to obtain a current state of each belt, and reject a belt path that is being used, is about to be used and is about to be maintained, to obtain a first belt path list; the to-be-used state refers to a belt path of a belt with a work task in a preset unit time;
the time calculation module 30 is configured to create a capacity of each belt in unit time, obtain a task amount to be transported currently and a preset transportation time, and reject belt paths in which a planned transportation time exceeds the preset transportation time, so as to obtain a second belt path list;
the path calculation module 40 is configured to select a belt path with the shortest path as an optimal unloading transportation path.
Preferably, the state detection module 20 is further configured to, when the current state of each belt is obtained, invoke Dijkstra algorithm to perform a second marking, set a use condition at a belt node, where the use condition is a belt that is not occupied and maintained, and obtain a first belt path list.
Preferably, the state detection module 20 is further configured to, after rejecting the belt paths that are in use, are to be used and maintained, adjust the screening criteria if the number of the belt paths is 0, delay the use time of the belt to N hours, and reject the belt paths that are in use, are to be used and maintained again; when the number of belt paths is still 0 after the above steps are performed, only the belt paths being used and maintained are rejected.
Preferably, the time calculation module 30 is configured to increase the preset transportation time and rescreen the third belt path if the number of the belt paths at the time is 0 after the planned transportation time is removed and exceeds the preset transportation time.
In a third aspect, based on the same inventive concept, the present invention also provides a computer-readable storage medium storing computer instructions for performing the belt optimal discharge transport path detection method of any one of the above.
In this embodiment, the storage medium may be a magnetic Disk, an optical Disk, a Read Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a Flash Memory (Flash Memory), a Hard Disk (HDD), a solid state Disk (Solid State Drive, SSD), or the like; the storage medium may also comprise a combination of memories of the kind described above.
The above embodiments are merely illustrative of the principles of the present invention and its effectiveness, and are not intended to limit the invention. Modifications and variations may be made to the above-described embodiments by those skilled in the art without departing from the spirit and scope of the invention. Accordingly, it is intended that all equivalent modifications and variations of the invention be covered by the claims, which are within the ordinary skill of the art, be within the spirit and scope of the present disclosure.
Claims (10)
1. The method for detecting the optimal unloading and transporting path of the belt is characterized by comprising the following steps:
s100, acquiring a starting point and an ending point of transportation, setting nodes between two ends of each belt, and calling Dijkstra algorithm to acquire all paths from the starting point to the ending point and belt node marks on corresponding paths; after all marked points are linearly connected each time, finishing one-time material transportation path selection;
s200, acquiring the current state of each belt, and eliminating the belt paths which are in use, are about to be used and maintained to obtain a first belt path list; the to-be-used state refers to a belt path of a belt with a work task in a preset unit time;
s300, creating the carrying capacity of each belt in unit time, acquiring the current required carrying task amount and preset carrying time, and eliminating belt paths of which the planned carrying time exceeds the preset carrying time to obtain a second belt path list;
s400, selecting the belt path with the shortest path as the optimal unloading transportation path.
2. The belt optimal discharging transport path detecting method according to claim 1, wherein:
and when the current state of each belt is obtained, calling a Dijkstra algorithm to carry out second marking, setting use conditions at the belt nodes, wherein the use conditions are the belts which are not occupied and maintained, and obtaining a first belt path list.
3. The method of claim 1, further comprising the step of, after rejecting the in-use, about-to-be-used and serviced belt path:
and S210, if the number of the belt paths is 0 at this time, adjusting the screening standard, deferring the use time of the belt to N hours, and removing the belt paths which are in use, are about to be used and maintained again.
4. The method for detecting an optimal discharging and transporting path for a belt according to claim 3, wherein after S210 is performed, the number of belt paths is still 0, further comprising the steps of:
s220, only the belt path being used and serviced is rejected.
5. The belt optimal discharging transport path detecting method according to claim 1, wherein: when the planned transportation time exceeds the belt path in the preset transportation time, the method further comprises the steps of:
and S310, if the number of the belt paths is 0, increasing the preset transportation time, and rescreening to obtain a third belt path.
6. An optimal belt discharge conveyor path detection system, comprising:
the marking module is used for obtaining a starting point and an ending point of transportation, setting nodes between two ends of each belt, and calling Dijkstra algorithm to obtain all paths from the starting point to the ending point and belt node marks on corresponding paths; after all marked points are linearly connected each time, finishing one-time material transportation path selection;
the state detection module is used for acquiring the current state of each belt, removing the belt paths which are in use, are about to be used and maintained, and obtaining a first belt path list; the to-be-used state refers to a belt path of a belt with a work task in a preset unit time;
the time calculation module is used for creating the carrying capacity of each belt in unit time, acquiring the current task quantity to be transported and the preset transportation time, eliminating belt paths of which the planned transportation time exceeds the preset transportation time, and obtaining a second belt path list;
and the path calculation module is used for selecting the belt path with the shortest path as the optimal unloading transportation path.
7. The system of claim 6, wherein the status detection module is further configured to invoke Dijkstra algorithm to perform a second marking when the current status of each belt is obtained, and set a usage condition at a belt node, where the usage condition is a belt that is not occupied and maintained, and obtain a first belt path list.
8. The system of claim 6, wherein the status detection module is further configured to, after removing the belt paths that are in use, about to be used and maintained, adjust the screening criteria if the number of belt paths is 0, delay the belt use time to N hours, and remove the belt paths that are in use, about to be used and maintained again; when the number of belt paths is still 0 after the above steps are performed, only the belt paths being used and maintained are rejected.
9. The system for detecting an optimal unloading and transporting path of a belt according to claim 6, wherein the time calculation module is configured to increase the preset transporting time to rescreen the third belt path if the number of the belt paths is 0 after removing the belt paths in the planned transporting time exceeding the preset transporting time.
10. A computer-readable storage medium storing computer instructions for performing the belt optimal discharge transport path detection method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310291756.5A CN115994635B (en) | 2023-03-23 | 2023-03-23 | Belt optimal discharging transportation path detection method, system and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310291756.5A CN115994635B (en) | 2023-03-23 | 2023-03-23 | Belt optimal discharging transportation path detection method, system and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115994635A true CN115994635A (en) | 2023-04-21 |
| CN115994635B CN115994635B (en) | 2023-06-16 |
Family
ID=85995397
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310291756.5A Active CN115994635B (en) | 2023-03-23 | 2023-03-23 | Belt optimal discharging transportation path detection method, system and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115994635B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117575451A (en) * | 2024-01-12 | 2024-02-20 | 深圳市今天国际物流技术股份有限公司 | Logistics order control method, device, computer equipment and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1601572A (en) * | 2004-10-15 | 2005-03-30 | 清华大学 | Control method of optimum flow rater of opening ore lorry |
| CN103854072A (en) * | 2014-03-17 | 2014-06-11 | 湖南工学院 | Processing method and system for path selection |
| CN106096783A (en) * | 2016-06-13 | 2016-11-09 | Tcl集团股份有限公司 | A kind of method for optimizing route based on Dijkstra and system thereof |
| CN106203700A (en) * | 2016-07-11 | 2016-12-07 | 中联物流（中国）有限公司 | The logistics transportation scheme of logistic management system determines method and system |
| CN109117997A (en) * | 2018-08-02 | 2019-01-01 | 武汉理工光科股份有限公司 | The optimization method and system in the fire-fighting and rescue path based on integrated many algorithms |
| CN109542098A (en) * | 2018-11-06 | 2019-03-29 | 上海威瞳视觉技术有限公司 | A kind of AGV paths planning method based on minimum turning cost |
| CN111323036A (en) * | 2020-02-19 | 2020-06-23 | 中冶东方工程技术有限公司 | Method and system for intelligently optimizing path of stock yard, electronic equipment and storage medium |
| CN111522316A (en) * | 2020-05-12 | 2020-08-11 | 中冶华天工程技术有限公司 | Optimal dynamic selection method for belt conveying process of stock yard |
| CN114139796A (en) * | 2021-11-29 | 2022-03-04 | 中邮信息科技(北京)有限公司 | Postal route planning method, apparatus, medium and equipment |
| CN114580741A (en) * | 2022-03-03 | 2022-06-03 | 中国人民解放军国防科技大学 | Path planning method, device and equipment based on multi-traffic network |
-
2023
- 2023-03-23 CN CN202310291756.5A patent/CN115994635B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1601572A (en) * | 2004-10-15 | 2005-03-30 | 清华大学 | Control method of optimum flow rater of opening ore lorry |
| CN103854072A (en) * | 2014-03-17 | 2014-06-11 | 湖南工学院 | Processing method and system for path selection |
| CN106096783A (en) * | 2016-06-13 | 2016-11-09 | Tcl集团股份有限公司 | A kind of method for optimizing route based on Dijkstra and system thereof |
| CN106203700A (en) * | 2016-07-11 | 2016-12-07 | 中联物流（中国）有限公司 | The logistics transportation scheme of logistic management system determines method and system |
| CN109117997A (en) * | 2018-08-02 | 2019-01-01 | 武汉理工光科股份有限公司 | The optimization method and system in the fire-fighting and rescue path based on integrated many algorithms |
| CN109542098A (en) * | 2018-11-06 | 2019-03-29 | 上海威瞳视觉技术有限公司 | A kind of AGV paths planning method based on minimum turning cost |
| CN111323036A (en) * | 2020-02-19 | 2020-06-23 | 中冶东方工程技术有限公司 | Method and system for intelligently optimizing path of stock yard, electronic equipment and storage medium |
| CN111522316A (en) * | 2020-05-12 | 2020-08-11 | 中冶华天工程技术有限公司 | Optimal dynamic selection method for belt conveying process of stock yard |
| CN114139796A (en) * | 2021-11-29 | 2022-03-04 | 中邮信息科技(北京)有限公司 | Postal route planning method, apparatus, medium and equipment |
| CN114580741A (en) * | 2022-03-03 | 2022-06-03 | 中国人民解放军国防科技大学 | Path planning method, device and equipment based on multi-traffic network |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117575451A (en) * | 2024-01-12 | 2024-02-20 | 深圳市今天国际物流技术股份有限公司 | Logistics order control method, device, computer equipment and storage medium |
| CN117575451B (en) * | 2024-01-12 | 2024-04-30 | 深圳市今天国际物流技术股份有限公司 | Logistics order control method, device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115994635B (en) | 2023-06-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110239868B (en) | Goods taking task allocation method and goods sorting system thereof | |
| Kim et al. | A look-ahead dispatching method for automated guided vehicles in automated port container terminals | |
| Ng | Crane scheduling in container yards with inter-crane interference | |
| CN115994635B (en) | Belt optimal discharging transportation path detection method, system and medium | |
| US20090099686A1 (en) | Work transfer system, route setting method, and route setting program | |
| CN114819420B (en) | Overhead traveling crane transportation path planning method based on conflict resolution | |
| CN111796596A (en) | Automatic warehouse goods picking method and device, computer equipment and storage medium | |
| CN111563672B (en) | Method for configuring number of multiple AGV | |
| CN116050690B (en) | OHT trolley path planning method, OHT trolley path planning device and terminal | |
| CN108275476A (en) | Container terminal horizontal transport vehicle dispatch system | |
| CN112581067A (en) | Warehouse management method and system | |
| Xing et al. | Dispatch problem of automated guided vehicles for serving tandem lift quay crane | |
| CN109613896A (en) | A kind of dispatching method and device for multiple automatic navigation vehicles | |
| CN110705781A (en) | Truck and logistics transportation matching method | |
| CN114415610B (en) | Scheduling method and device for robot, electronic equipment and storage medium | |
| JP2000152421A (en) | Charge control device and method of automatic guided vehicle, and recording media | |
| JP4410515B2 (en) | Container yard cargo handling system | |
| CN112573221A (en) | Control system and method for intelligent belt transmission flow of stock yard | |
| CN116455033A (en) | Charging control method and device for transfer robot and electronic equipment | |
| WO2020100220A1 (en) | Conveyance work control device, system, method, and computer-readable medium | |
| WO2022068935A9 (en) | Elevator resource scheduling method and apparatus | |
| WO2020230345A1 (en) | Production management system, production management device, production management method, and program | |
| CN113655796A (en) | Dynamic planning method and device for carrying path, electronic equipment and storage medium | |
| CN113534755B (en) | Material storing and taking method and device based on rail shuttle trolley and intelligent equipment | |
| JPS6285305A (en) | Operation controlling system for unmanned carrying truck |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |