CN113173428B - Bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning - Google Patents
Bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning Download PDFInfo
- Publication number
- CN113173428B CN113173428B CN202110274783.2A CN202110274783A CN113173428B CN 113173428 B CN113173428 B CN 113173428B CN 202110274783 A CN202110274783 A CN 202110274783A CN 113173428 B CN113173428 B CN 113173428B
- Authority
- CN
- China
- Prior art keywords
- yard
- path
- goods
- planning
- stacking
- 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.)
- Active
Links
Images
Classifications
-
- 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
- B65G63/00—Transferring or trans-shipping at storage areas, railway yards or harbours or in opening mining cuts; Marshalling yard installations
Landscapes
- Ship Loading And Unloading (AREA)
Abstract
The invention discloses a bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning, which comprises the step of obtaining an optimal stock area and a belt path of cargos by utilizing a hierarchical screening method, wherein the hierarchical screening comprises the following steps: s1, acquiring goods information; s2, inference of assignable areas; s3, sorting available spaces; s4, reasoning equipment and a storage yard; and S5, optimal path reasoning. The invention provides a dry bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning, which takes a dry bulk cargo wharf stock yard as a research object and can quickly and accurately find a proper stock yard planning and utilizing method based on knowledge reasoning.
Description
Technical Field
The invention relates to the technical field of cargo distribution of bulk cargo wharf storage yards, in particular to a method for planning and utilizing a bulk cargo wharf storage yard based on knowledge reasoning.
Background
The yard is used as a buffer area for transferring the goods of the dry bulk cargo wharf to transportation, is a limited resource of all wharfs, has an important place in the wharf transportation, and the planning utilization efficiency of the yard greatly influences the overall speed of a loading and unloading ship, is one of key factors for determining the service capacity of the wharf, so that the yard of the wharf can be effectively utilized under the existing conditions, a reasonable yard planning utilization scheme is provided for the goods, the turnover efficiency of the wharf is improved, and the important subject is that in the prior art, the method for planning utilization of the yard of the bulk cargo wharf mainly comprises the following steps:
1. the distribution strategy based on manual experience is that a wharf tally dispatcher specifies a proper storage yard storage position and a proper loading and unloading flow path for goods according to work experience;
2. and (4) a random stacking strategy, which is to randomly select an area for direct stacking if the size of the residual space is met on the premise of ensuring that the type of the bulk cargo is the same as that of the shipper.
With both of the above prior approaches, manual experience-based allocation strategies, which are too dependent on past work experience, may be relatively single; in addition, the artificial experience depends on perceptual knowledge, quantization is difficult to perform, the space for optimizing and improving the artificial experience is small, the intelligent degree is low, time and labor are consumed, and the stability is poor; the random stacking strategy can lead to relatively dispersed stacking of the goods on one hand, is not beneficial to the turnover of subsequent goods and has low utilization rate of a storage yard, only considers the stacking space in addition, meets the stacking requirement, but is not necessarily the optimal selection, cannot ensure that the operation path of the equipment is the optimal path, and also influences the turnover efficiency of the goods to a certain extent.
Disclosure of Invention
The invention aims to avoid the defects in the prior art and provides a bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning, so that the defects in the prior art are effectively overcome.
In order to achieve the purpose, the invention adopts the technical scheme that: a bulk cargo wharf stock yard planning utilization method based on knowledge reasoning comprises the steps of obtaining an optimal stock area and a belt path of cargos by a hierarchical screening method;
the hierarchical screening comprises the following steps:
s1, acquiring goods information;
s2, inference of distributable areas, and selecting a primary planning position meeting the attribute of the goods under the condition of considering the goods to be planned and the storage of the storage yard;
s3, sorting available space on the basis of the primary planned positions obtained in the step S2, and screening out secondary planned positions which can be selected on the premise of considering the capacity of the storage yard stack positions;
s4, reasoning equipment and a yard on the basis of the secondary planned position obtained in the step S3, and screening out a tertiary planned position on the basis of considering the relation between the operation state of the stacker-reclaimer and the yard selection matching;
s5, performing optimal path reasoning on the basis of the three-level plan position obtained in the step S4, and screening out an optimal stockpiling area and a belt path;
further, in step S1, the acquired cargo information includes whether the cargo is bonded cargo or not and the type of the cargo.
Further, in step S2, the specific content of the assignable region inference is:
firstly, dividing according to whether goods are bonded, wherein a storage yard area is divided into a bonded area and a non-bonded area, bonded goods can only be placed in the bonded area storage yard, non-bonded goods preferentially select the non-bonded area storage yard, and if the non-bonded area is unavailable, the non-bonded area is selected from the bonded area;
and classifying and stacking according to the types of the goods on the basis of the selection, preferentially selecting the stacking positions in the range as primary planning positions if the stacking positions of a certain type of the goods exist in the wharf yard, and selecting the empty stacking positions on the yard as the primary planning positions if the stacking positions of a certain type of the goods do not exist in the wharf yard.
Further, in step S3, the specific content of the available spatial ordering is:
and (4) setting the weight of the current cargo as x tons, calculating all stacking space in the primary planned position, and repeating the search results in a descending order from large to small according to the total tonnage to form a set (w) 1 ，w 2 ，w 3 ，...w n ) Representing the available space of each stack, occupying the current task and each element in the set one by one from large to small until a stack set meeting the storage space required by the current task is found, wherein each element in the set meets x and is not more than w x Taking the stack position in accordance with the stack position space as a secondary planning position; if the maximum available space is less than the space required by goods stacking, the situation that all goods cannot be stacked independently is indicated, a plurality of paths need to be split, and the number of the paths is ensured to be as small as possible, so that a plurality of split stack positions serve as secondary planning positions.
Further, in step S4, the specific content of the inference between the device and the yard is as follows:
based on the association between the operation rule of the equipment and the operation characteristic of the equipment, each stacker-reclaimer has a fixed track and can only serve the material piles at two sides of the track, any material pile in each operation period can only be served by one stacker-reclaimer, and the following allocation strategies exist according to the mapping relation between the yard position and the equipment:
if a certain stack position is carrying out ship loading and unloading operation, the adjacent stack position can not be selected as a three-level planning position; if a certain stack position is in the process of shipping operation and the other stacking position also needs to enter for stacking, the stack positions which are not on the same row can be used as three-level planning positions; if two types of material seeds are loaded on the ship at the same time, the stacking positions on different rows are selected as three-level planning positions, and the operation of the stacking positions is ensured not to interfere with each other.
Further, in step S5, the specific content of the optimal path inference is:
if the three-level planned position screened out in the step S4 is only one position and the specific stack corresponds to the only belt path, the three-level planned position is the optimal stacking area and the corresponding belt path is the optimal belt path;
if any of the belt paths of the tertiary planned positions screened out by step S4 corresponding to the tertiary planned positions is not unique, screening is performed in accordance with the following method:
assuming that the storage yard area has n stacks, the set is M, and M is represented for each stack in the set 1 ，M 2 ，M 3 ...M n For yard space, M, provided that the starting point and the end point are known k Belongs to M, the quantity of the paths for transferring goods from the starting point to the optional belt is Num 1 The number of the optional belt paths for goods to be transferred out is Num2, the minimum value is obtained by traversing and adding the two sets, namely the global optimal path for transferring in and out is calculated and recorded as path k I.e. in space state M k Based on the corresponding optimal path, for all space resources, a corresponding optimal belt path set can be obtained, and is represented as path 1 ，path 2 ，path 3 ...path n For the whole path state set, min (path) can be obtained 1 ，path 2 ...path k ...path n ) And the obtained minimum value is the global optimal belt path based on the goods transferring in and out, and the corresponding yard space under the optimal path is the optimal stockpiling area.
The technical scheme of the invention has the following beneficial effects: the invention provides a dry bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning, which takes a dry bulk cargo wharf stock yard as a research object, can quickly and accurately find a proper stock yard planning and utilizing method based on knowledge reasoning.
Drawings
FIG. 1 is an overall flow chart of an embodiment of the present invention;
FIG. 2 is a flow diagram of assignable region inference according to an embodiment of the invention;
FIG. 3 is a flowchart illustrating a spatial ordering that may be used in accordance with an embodiment of the present invention;
FIG. 4 is a flowchart illustrating the apparatus and yard inference according to an embodiment of the present invention;
fig. 5 is a flowchart of optimal path inference according to an embodiment of the present invention.
Detailed Description
The embodiments of the present invention will be described in further detail with reference to the drawings and examples. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
In the description of the present invention, "a plurality" means two or more unless otherwise specified; the terms "upper", "lower", "left", "right", "inner", "outer", "front", "rear", "head", "tail", and the like, indicate orientations or positional relationships based on the orientations or positional relationships shown in the drawings, are only for convenience in describing and simplifying the description, and do not indicate or imply that the device or element referred to must have a particular orientation, be constructed in a particular orientation, and be operated, and thus, should not be construed as limiting the invention. In the description of the present invention, it is to be noted that, unless otherwise explicitly specified or limited, the terms "connected" and "connected" are to be interpreted broadly, e.g., as being fixed or detachable or integrally connected; can be mechanically or electrically connected; may be directly connected or indirectly connected through an intermediate. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art.
The method for planning and utilizing the bulk cargo wharf yard based on knowledge reasoning comprises the steps of obtaining an optimal stocking area and a belt path of cargos by utilizing a hierarchical screening method;
as shown in fig. 1, the hierarchical screening includes the following steps:
s1, acquiring goods information;
s2, inference of distributable areas, and selecting a primary planning position meeting the attribute of the goods under the condition of considering the goods to be planned and the storage of the storage yard;
s3, sorting available space on the basis of the primary planned positions obtained in the step S2, and screening out secondary planned positions which can be selected on the premise of considering the capacity of the storage yard stack positions;
s4, reasoning equipment and a yard on the basis of the secondary planned position obtained in the step S3, and screening out a tertiary planned position on the basis of considering the relation between the operation state of the stacker-reclaimer and the yard selection matching;
s5, performing optimal path reasoning on the basis of the three-level plan position obtained in the step S4, and screening out an optimal stockpiling area and a belt path;
after the five steps, a yard planning scheme is generated.
In step S1, the acquired cargo information includes whether the cargo is bonded cargo or not and the type of the cargo.
As shown in fig. 2, in step S2, the specific content of assignable region inference is:
firstly, dividing according to whether goods are bonded, wherein a storage yard area is divided into a bonded area and a non-bonded area, bonded goods can only be placed in the bonded area storage yard, non-bonded goods preferentially select the non-bonded area storage yard, and if the non-bonded area is unavailable, the non-bonded area is selected from the bonded area;
and classifying and stacking according to the types of the goods on the basis of the selection, preferentially selecting the stacking positions in the range as primary planning positions if the stacking positions of a certain type of the goods exist in the wharf yard, and selecting the empty stacking positions on the yard as the primary planning positions if the stacking positions of a certain type of the goods do not exist in the wharf yard.
As shown in fig. 3, in step S3, the specific contents of the available spatial ordering are:
and (4) setting the weight of the current cargo as x tons, calculating all stacking space in the primary planned position, and repeating the search results in a descending order from large to small according to the total tonnage to form a set (w) 1 ，w 2 ，w 3 ，...w n And) representing the space available for each stack, occupying the current task and each element in the set one by one from large to small until a stack set meeting the stacking space required by the current task is found, wherein each element in the set meets x ≦ w x Taking the stack position in accordance with the stack position space as a secondary planning position; if the maximum available space is less than the space required by goods stacking, the situation that all goods cannot be stacked independently is indicated, a plurality of paths need to be split, and the number of the paths is ensured to be as small as possible, so that a plurality of split stack positions serve as secondary planning positions.
In this embodiment, the specific method for splitting the path is as follows:
preferentially splitting into two stacks and searching for w in the set i And w j So that w i +w j X is more than or equal to x; if two paths can not be met, the number of the paths is sequentially increased, the paths are split into multiple paths, multiple w are searched in the set, and w is enabled to be smaller i +w j +...+w k ≥x。
As shown in fig. 4, in step S4, the specific content of the equipment and yard inference is as follows:
based on the association between the operation rule of the equipment and the operation characteristic of the equipment, each stacker-reclaimer has a fixed track and can only serve the material piles at two sides of the track, any material pile in each operation period can only be served by one stacker-reclaimer, and the following allocation strategies exist according to the mapping relation between the yard position and the equipment:
if a certain stack position is carrying out ship loading and unloading operation, the adjacent stack position can not be selected as a three-level planning position; if a certain stack position is in the process of shipping operation and the other stacking is also required to enter for stacking, the stack positions which are not on the same row can be used as three-level planning positions; if two types of material seeds are loaded on the ship at the same time, the stacking positions on different rows are selected as three-level planning positions, and the operation of the stacking positions is ensured not to interfere with each other.
As shown in fig. 5, in step S5, the specific content of the optimal path inference is:
if the three-level planned position screened out in the step S4 is only one position and the specific stack corresponds to the only belt path, the three-level planned position is the optimal stacking area and the corresponding belt path is the optimal belt path;
if any of the belt paths of the tertiary planned positions screened out by step S4 corresponding to the tertiary planned positions is not unique, screening is performed in accordance with the following method:
assuming that the storage yard area has n stacks, the set is M, and M is represented for each stack in the set 1 ,M 2 ,M 3 ,...M n For yard space, M, provided that the starting point and the end point are known k Belongs to M, the quantity of the paths for transferring goods from the starting point to the optional belt is Num 1 The number of the optional belt paths for goods to be transferred out is Num2, the minimum value is obtained by traversing and adding the two sets, namely the global optimal path for transferring in and out is calculated and recorded as path k I.e. in space state M k The corresponding optimal path is obtained, and based on the optimal path, the corresponding optimal belt path set can be obtained for all space resourcesIs denoted as path 1 ，path 2 ，path 3 ...path n For the whole path state set, min (path) can be obtained 1 ，path 2 ...path k ...path n )。
And the obtained minimum value is based on the global optimal belt path for transferring the goods into and out, and the corresponding yard space under the optimal path is the optimal stockpiling area, so that a yard planning utilization scheme of the goods is generated.
The invention provides a dry bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning, which takes a dry bulk cargo wharf stock yard as a research object, can quickly and accurately find a proper stock yard planning and utilizing method based on knowledge reasoning.
The embodiments of the present invention have been presented for purposes of illustration and description, and are not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
Claims (5)
1. A bulk cargo wharf stock yard planning utilization method based on knowledge reasoning is characterized by comprising the steps of obtaining an optimal stock area and a belt path of cargos by a hierarchical screening method;
the hierarchical screening comprises the following steps:
s1, acquiring goods information;
s2, inference of distributable areas, and selecting a primary planning position meeting the attribute of the goods under the condition of considering the goods to be planned and the storage of the storage yard;
s3, sorting available space on the basis of the primary planned positions obtained in the step S2, and screening out secondary planned positions which can be selected on the premise of considering the capacity of the storage yard stack positions;
s4, reasoning equipment and a yard on the basis of the secondary planned position obtained in the step S3, and screening out a tertiary planned position on the basis of considering the relation between the operation state of the stacker-reclaimer and the yard selection matching;
s5, performing optimal path reasoning on the basis of the three-level plan position obtained in the step S4, and screening out an optimal stockpiling area and a belt path;
in step S5, the specific content of the optimal path inference is:
if the three-level planned position screened out in the step S4 is only one position and the specific stack corresponds to the only belt path, the three-level planned position is the optimal stacking area and the corresponding belt path is the optimal belt path;
if any of the belt paths of the tertiary planned positions screened out by step S4 corresponding to the tertiary planned positions is not unique, screening is performed in accordance with the following method:
assuming that the storage yard area has n stacks, the set is M, and M is represented for each stack in the set 1 ，M 2 ，M 3 ...M n For yard space, M, provided that the starting point and the end point are known k Belongs to M, the quantity of the paths for transferring goods from the starting point to the optional belt is Num 1 The number of the paths of the goods which are turned out of the selectable belt is Num 2 In both sets, the sum is calculatedObtaining the minimum value, namely calculating the global optimal path switched into and out, and recording the path k I.e. in space state M k Based on the corresponding optimal path, for all space resources, a corresponding optimal belt path set can be obtained, and is represented as path 1 ，path 2 ，path 3 ...path n For the whole path state set, min (path) can be obtained 1 ，path 2 ...path k ...path n ) And the obtained minimum value is the global optimal belt path based on the goods transferring in and out, and the corresponding yard space under the global optimal belt path is the optimal stocking area.
2. The method for utilizing bulk cargo terminal yard plan based on knowledge-based reasoning as claimed in claim 1, wherein the cargo information obtained in step S1 includes whether the cargo is bonded cargo or not and the type of the cargo.
3. The method for utilizing bulk cargo terminal yard planning based on knowledge-based reasoning as claimed in claim 2, wherein in step S2, the specific content of said assignable regional reasoning is:
firstly, dividing according to whether goods are bonded, wherein a storage yard area is divided into a bonded area and a non-bonded area, bonded goods can only be placed in the bonded area storage yard, non-bonded goods preferentially select the non-bonded area storage yard, and if the non-bonded area is unavailable, the non-bonded area is selected from the bonded area;
and classifying and stacking according to the types of the goods on the basis of the selection, if the stacking position of a certain type of the goods exists in the wharf yard, preferentially selecting the stacking position within the range of the stacking position of the certain type of the goods as a primary planning position, and if the stacking position of a certain type of the goods does not exist in the wharf yard, selecting an empty stacking position on the yard as a primary planning position.
4. The method for utilizing bulk cargo terminal yard planning based on knowledge-reasoning of claim 3, wherein in step S3, the specific contents of the available spatial ordering are:
and (4) setting the weight of the current cargo as x tons, calculating all stacking space in the primary planned position, and repeating the search results in a descending order from large to small according to the total tonnage to form a set (w) 1 ，w 2 ，w 3 ，...w n ) Representing the available space of each stack, occupying the current task and each element in the set one by one from large to small until a stack set meeting the storage space required by the current task is found, wherein each element in the set meets x and is not more than w x Taking the stack position in accordance with the stack position space as a secondary planning position; if the maximum available space is less than the space required by goods stacking, the situation that all goods cannot be stacked independently is indicated, a plurality of paths need to be split, and the number of the paths is ensured to be as small as possible, so that a plurality of split stack positions serve as secondary planning positions.
5. The method for planning and utilizing the bulk cargo terminal yard based on knowledge inference as claimed in claim 4, wherein in step S4, the specific content of the equipment and yard inference is:
based on the association between the operation rule of the equipment and the operation characteristic of the equipment, each stacker-reclaimer has a fixed track and can only serve the material piles at two sides of the track, any material pile in each operation period can only be served by one stacker-reclaimer, and the following allocation strategies exist according to the mapping relation between the yard position and the equipment:
if a certain stack position is carrying out ship loading and unloading operation, the adjacent stack position can not be selected as a three-level planning position; if a certain stack position is in the process of shipping operation and the other stacking is also required to enter for stacking, the stack positions which are not on the same row are used as three-stage planning positions; if two types of material seeds are loaded on the ship at the same time, the stacking positions on different rows are selected as three-level planning positions, and the operation of the stacking positions is ensured not to interfere with each other.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110274783.2A CN113173428B (en) | 2021-03-15 | 2021-03-15 | Bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110274783.2A CN113173428B (en) | 2021-03-15 | 2021-03-15 | Bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113173428A CN113173428A (en) | 2021-07-27 |
| CN113173428B true CN113173428B (en) | 2022-08-05 |
Family
ID=76921968
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110274783.2A Active CN113173428B (en) | 2021-03-15 | 2021-03-15 | Bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113173428B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117550367B (en) * | 2023-10-27 | 2026-01-20 | 中冶华天南京工程技术有限公司 | Intelligent material stacking and taking control system of raw material factory and implementation method |
Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101458788A (en) * | 2008-12-19 | 2009-06-17 | 天津市市政工程设计研究院 | Container terminal physical distribution emulation optimizing system |
| CN101986313A (en) * | 2010-11-03 | 2011-03-16 | 上海海事大学 | Knowledge-based container quay berth and shore bridge dispatching method |
| CN103065005A (en) * | 2012-12-20 | 2013-04-24 | 招商局国际信息技术有限公司 | Yard position allocation method and system |
| CN105517146A (en) * | 2015-11-30 | 2016-04-20 | 青岛海尔智能家电科技有限公司 | Storage positioning method and device |
| CN205204317U (en) * | 2015-11-30 | 2016-05-04 | 华电重工股份有限公司 | Container loading and unloading system |
| CN105938572A (en) * | 2016-01-14 | 2016-09-14 | 上海海事大学 | Interference-prevention-based multi-automatic-guided-vehicle path planning method for logistics storage system |
| CN106203915A (en) * | 2016-07-11 | 2016-12-07 | 北京交通大学 | Scattered groceries based on Internet of Things management system |
| CN106815707A (en) * | 2017-01-24 | 2017-06-09 | 大连大学 | An intelligent dispatching system and method for a bulk cargo port yard |
| CN109118011A (en) * | 2018-08-28 | 2019-01-01 | 摩佰尔（天津）大数据科技有限公司 | The intelligent dispatching method and system of pier storage yard |
| AU2018229435A1 (en) * | 2017-09-11 | 2019-03-28 | SilverRail Australia Pty Ltd | Computer implemented technologies configured to enable efficient processing of queries in a transportation data system, including use of partitioning based on trip attributes |
| CN110510309A (en) * | 2019-08-02 | 2019-11-29 | 南京博约智能科技有限公司 | A kind of robot palletizer path planning system and planing method |
| CN111782646A (en) * | 2020-05-19 | 2020-10-16 | 浙江数链科技有限公司 | Method, system, computer device and readable storage medium for library bit allocation |
| CN111882282A (en) * | 2020-08-04 | 2020-11-03 | 广东货多多物流科技股份有限公司 | Shipping cargo matching method, device, equipment and storage medium |
| CN112249583A (en) * | 2020-09-30 | 2021-01-22 | 华东师范大学 | A method and system for intelligent selection of stacking position in bulk cargo terminal |
| CN112488628A (en) * | 2020-11-30 | 2021-03-12 | 广东电网有限责任公司 | Application method and device of warehouse bit code and storage medium |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7613617B2 (en) * | 2006-02-21 | 2009-11-03 | United States Postal Service | Systems and methods for managing powered industrial vehicles |
| CN103902778B (en) * | 2014-04-04 | 2017-01-18 | 天津市市政工程设计研究院 | Microscopic simulation method for matching wharf stockpiling volume and berthing capability |
| CN112418584B (en) * | 2019-08-23 | 2024-10-01 | 深圳顺丰泰森控股(集团)有限公司 | Task planning method, device, computer equipment and storage medium |
-
2021
- 2021-03-15 CN CN202110274783.2A patent/CN113173428B/en active Active
Patent Citations (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101458788A (en) * | 2008-12-19 | 2009-06-17 | 天津市市政工程设计研究院 | Container terminal physical distribution emulation optimizing system |
| CN101986313A (en) * | 2010-11-03 | 2011-03-16 | 上海海事大学 | Knowledge-based container quay berth and shore bridge dispatching method |
| CN103065005A (en) * | 2012-12-20 | 2013-04-24 | 招商局国际信息技术有限公司 | Yard position allocation method and system |
| CN105517146A (en) * | 2015-11-30 | 2016-04-20 | 青岛海尔智能家电科技有限公司 | Storage positioning method and device |
| CN205204317U (en) * | 2015-11-30 | 2016-05-04 | 华电重工股份有限公司 | Container loading and unloading system |
| CN105938572A (en) * | 2016-01-14 | 2016-09-14 | 上海海事大学 | Interference-prevention-based multi-automatic-guided-vehicle path planning method for logistics storage system |
| CN106203915A (en) * | 2016-07-11 | 2016-12-07 | 北京交通大学 | Scattered groceries based on Internet of Things management system |
| CN106815707A (en) * | 2017-01-24 | 2017-06-09 | 大连大学 | An intelligent dispatching system and method for a bulk cargo port yard |
| AU2018229435A1 (en) * | 2017-09-11 | 2019-03-28 | SilverRail Australia Pty Ltd | Computer implemented technologies configured to enable efficient processing of queries in a transportation data system, including use of partitioning based on trip attributes |
| CN109118011A (en) * | 2018-08-28 | 2019-01-01 | 摩佰尔（天津）大数据科技有限公司 | The intelligent dispatching method and system of pier storage yard |
| CN110510309A (en) * | 2019-08-02 | 2019-11-29 | 南京博约智能科技有限公司 | A kind of robot palletizer path planning system and planing method |
| CN111782646A (en) * | 2020-05-19 | 2020-10-16 | 浙江数链科技有限公司 | Method, system, computer device and readable storage medium for library bit allocation |
| CN111882282A (en) * | 2020-08-04 | 2020-11-03 | 广东货多多物流科技股份有限公司 | Shipping cargo matching method, device, equipment and storage medium |
| CN112249583A (en) * | 2020-09-30 | 2021-01-22 | 华东师范大学 | A method and system for intelligent selection of stacking position in bulk cargo terminal |
| CN112488628A (en) * | 2020-11-30 | 2021-03-12 | 广东电网有限责任公司 | Application method and device of warehouse bit code and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 自动化集装箱码头堆场规划设计;耿卫宁，张连钢，李波，王吉升，隋晓;《水运工程》;20190831;第1-5页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113173428A (en) | 2021-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101585453B (en) | Distribution Method for export container yard of container wharf | |
| Luo et al. | Modelling of dual-cycle strategy for container storage and vehicle scheduling problems at automated container terminals | |
| Lee et al. | A heuristic for retrieving containers from a yard | |
| Han et al. | A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub | |
| CN114580925B (en) | A container turning method for automated container terminals based on strategy algorithm | |
| CN103246941B (en) | Space scheduling method stored up by a kind of Containers For Export harbour | |
| CN114476704B (en) | Yard box position dynamic assignment method suitable for ART yard edge loading and unloading | |
| CN111798183A (en) | Library management method, device, system and storage medium | |
| CN110599000B (en) | Automatic dock turning evaluation method, box position distribution method and related devices | |
| CN107545366A (en) | The shipment dispatching method and system of full-automatic container terminal | |
| Ku et al. | An optimisation framework for yard planning in a container terminal: case with automated rail-mounted gantry cranes | |
| Boywitz et al. | Robust storage assignment in stack-and queue-based storage systems | |
| CN114580983B (en) | Scattered distribution mixed stacking management method for container yard | |
| CN113173428B (en) | Bulk cargo wharf stock yard planning and utilizing method based on knowledge reasoning | |
| CN116451290A (en) | A kind of method of pre-shrinking container in container yard | |
| Jacyna et al. | Road vehicle sequencing problem in a railroad intermodal terminal–simulation research | |
| Saini et al. | A stochastic model for the throughput analysis of passing dual yard cranes | |
| CN115860161B (en) | Method, device and readable medium for selecting access container | |
| Lee et al. | Integrated bay allocation and yard crane scheduling problem for transshipment containers | |
| CN120996260A (en) | A method, system, equipment and medium for optimizing container scheduling at railway stations. | |
| CN119005862B (en) | Container storage and position selection method based on stacking behavior characteristics | |
| CN119885646A (en) | Storage yard allocation template design method, device and storage medium | |
| JP2025105561A (en) | Warehouse organization method, device, and storage medium using robots | |
| CN119106945A (en) | Dynamic energy efficiency simulation optimization method and system for automated container terminal storage strategy | |
| CN115310917B (en) | Warehousing management method |
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 |