CN110888904B - Intelligent optimization method and system for automatic loading sequence of crane cargos - Google Patents

Intelligent optimization method and system for automatic loading sequence of crane cargos Download PDF

Info

Publication number
CN110888904B
CN110888904B CN201911145408.7A CN201911145408A CN110888904B CN 110888904 B CN110888904 B CN 110888904B CN 201911145408 A CN201911145408 A CN 201911145408A CN 110888904 B CN110888904 B CN 110888904B
Authority
CN
China
Prior art keywords
unloading
goods
crane
sequence
loaded
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.)
Expired - Fee Related
Application number
CN201911145408.7A
Other languages
Chinese (zh)
Other versions
CN110888904A (en
Inventor
李国杰
莫栋成
任勇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou University
Original Assignee
Suzhou University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Suzhou University filed Critical Suzhou University
Priority to CN201911145408.7A priority Critical patent/CN110888904B/en
Publication of CN110888904A publication Critical patent/CN110888904A/en
Application granted granted Critical
Publication of CN110888904B publication Critical patent/CN110888904B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2455Query execution
    • G06F16/24568Data stream processing; Continuous queries
    • BPERFORMING OPERATIONS; TRANSPORTING
    • B66HOISTING; LIFTING; HAULING
    • B66CCRANES; LOAD-ENGAGING ELEMENTS OR DEVICES FOR CRANES, CAPSTANS, WINCHES, OR TACKLES
    • B66C13/00Other constructional features or details
    • B66C13/18Control systems or devices
    • B66C13/48Automatic control of crane drives for producing a single or repeated working cycle; Programme control
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Theoretical Computer Science (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • General Business, Economics & Management (AREA)
  • Educational Administration (AREA)
  • Operations Research (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Mechanical Engineering (AREA)
  • Control And Safety Of Cranes (AREA)

Abstract

The invention provides an intelligent optimization method and system for automatic loading sequence of crane cargos, wherein the method comprises the following steps: the method comprises the steps of constructing a three-dimensional space coordinate system of a crane, representing the initial position and the unloading position of goods by using position coordinates in the three-dimensional space coordinate system to form an initial position information database and an unloading position information database, formulating unloading rule optimization and automatically generating unloading sequence for the unloading position information database by combining actual loading and unloading operation characteristics of the crane, searching effective target loading goods one by one according to the unloading sequence, and further optimizing and automatically generating the loading sequence. The optimized and automatically generated unloading sequence database and loading sequence database provide a basis for planning the subsequent loading and unloading operation path, so that the control instruction of the crane can be automatically generated, the automatic continuous operation of the crane can be realized, the effective operation capacity of the crane can be fully exerted, and the operation efficiency and the operation safety can be improved.

Description

起重机货物自动装载顺序的智能优化方法及系统Intelligent optimization method and system for automatic loading sequence of crane cargo

技术领域technical field

本发明涉及起重运输机械及物料搬运技术领域,具体为一种起重机货物自动装载顺序的智能优化方法。The invention relates to the technical field of hoisting and transporting machinery and material handling, in particular to an intelligent optimization method for the automatic loading sequence of crane goods.

背景技术Background technique

集装箱港口以及集装箱堆场用起重设备是实现集装箱装卸作业的关键设备,随着港口装运量及船舶大型化的快速发展,许多港口面临熟练操作司机短缺、及提升装卸作业效率方面的压力,因此,港口运营商对自动化、智能化、能24小时连续作业的自动化起重设备的需求日益凸现。在大批量集装箱装卸作业港口或堆场,起重设备需要连续完成批量集装箱从指定对象区域吊运到目的区域的装卸作业,实现大批量货物的自动化装卸作业,必须解决以下最基本问题:1、以什么样的顺序进行装卸作业效率最高;2、这些优化的装卸顺序如何自动生成起重机可执行的控制指令,使起重机能连续自动完成批量集装箱的装卸作业。批量货物装卸及搬运顺序的最适化问题类似于TSP旅行商人问题,是离散最适化问题的具体应用例。由于港口或堆场实际装卸要求及装卸过程比较复杂,完全将该问题通过纯理论的方法进行求解,是不可能得到具有实际应用价值的研究结果。目前为止针对起重机装卸顺序最适化研究的报告还未发现。Lifting equipment for container ports and container yards is the key equipment for container loading and unloading operations. With the rapid development of port loading and large-scale ships, many ports are faced with the shortage of skilled drivers and the pressure to improve the efficiency of loading and unloading operations. , the port operators' demand for automated, intelligent and 24-hour continuous operation of automated lifting equipment is increasingly prominent. In a port or yard for large-volume container loading and unloading operations, the lifting equipment needs to continuously complete the loading and unloading operation of lifting and transporting batches of containers from the designated object area to the destination area, and to realize the automatic loading and unloading operation of large-volume goods, the following basic problems must be solved: 1. Which order is the most efficient for loading and unloading operations; 2. How can these optimized loading and unloading sequences automatically generate executable control instructions for the crane, so that the crane can continuously and automatically complete the loading and unloading operations of batches of containers. The optimization problem of batch loading and unloading and handling sequence is similar to the TSP traveling salesman problem, which is a specific application example of discrete optimization problem. Because the actual loading and unloading requirements and loading and unloading process of ports or storage yards are relatively complex, it is impossible to obtain research results with practical application value to solve this problem completely by purely theoretical methods. No reports have been found so far on the optimization of crane loading and unloading sequences.

发明内容SUMMARY OF THE INVENTION

本发明的目的在于提供一种起重机货物自动装载顺序的智能优化方法,该方法将理论研究方法与实际装卸作业要求及起重机的作业特点进行有机结合,力求获得可实际应用的最优化解,实现起重机自动化控制与作业。The purpose of the present invention is to provide an intelligent optimization method for the automatic loading sequence of crane cargo, which organically combines the theoretical research method with the actual loading and unloading operation requirements and the operation characteristics of the crane, and strives to obtain an optimal solution that can be practically applied to realize the crane. Automation control and operations.

为实现上述目的,本发明提供如下技术方案:一种起重机货物自动装载顺序的智能优化方法,包括如下步骤:In order to achieve the above purpose, the present invention provides the following technical solutions: an intelligent optimization method for the automatic loading sequence of crane cargo, comprising the following steps:

S1、建立三维坐标系,以起重机装载货物在大、小车运行和垂直下降三个运动方向的极限位置点作为所述三维空间坐标系的原点,以起重机的小车、大车和起升机构的运行方向分别作为所述三维空间坐标系的X、Y、Z方向;S1. Establish a three-dimensional coordinate system, and take the limit position points of the crane loaded goods in the three moving directions of large, trolley and vertical descending as the origin of the three-dimensional coordinate system, and use the crane's trolley, cart and hoisting mechanism. The directions are respectively used as the X, Y, and Z directions of the three-dimensional space coordinate system;

S2、定义初始堆放的货物数量为m件,建立m件货物的初始位置与所述三维空间坐标系的对应关系,得到初始位置信息数据库;S2, define the number of initially stacked goods as m pieces, establish the corresponding relationship between the initial positions of the m pieces of goods and the three-dimensional space coordinate system, and obtain the initial position information database;

S3、定义m件货物中有n件货物需要卸载,建立n件货物的卸载位置与所述三维空间坐标系的对应关系,得到卸载位置信息数据库;S3. Define that there are n pieces of goods in the m pieces of goods that need to be unloaded, establish a corresponding relationship between the unloading positions of the n pieces of goods and the three-dimensional space coordinate system, and obtain an unloading position information database;

S4、制定卸载顺序规则并将所述卸载位置信息数据库按照所述卸载顺序规则进行排序,得到卸载顺序数据库;S4, formulate an unloading sequence rule and sort the unloading location information database according to the unloading sequence rule to obtain an unloading sequence database;

S5、建立装载顺序数据库结构:S5. Establish a loading sequence database structure:

Figure BDA0002282036920000021
Figure BDA0002282036920000021

其中,

Figure BDA0002282036920000022
表示为m件货物中需装载的n件货物的初始位置,Xpc、Ypc、Zpc分别表示需装载的n件货物的初始位置KP在X、Y、Z方向的位置坐标,
Figure BDA0002282036920000023
分别表示需装载的第i件货物在X、Y、Z方向的初始位置的位置坐标,
Figure BDA0002282036920000024
分别表示需装载的第n件货物在X、Y、Z方向的初始位置的位置坐标;in,
Figure BDA0002282036920000022
It is expressed as the initial position of n pieces of goods to be loaded in m pieces of goods, X pc , Y pc , and Z pc respectively represent the position coordinates of the initial position K P of the n pieces of goods to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000023
Respectively represent the position coordinates of the initial position of the i-th cargo to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000024
Respectively represent the position coordinates of the initial position of the nth piece of goods to be loaded in the X, Y, and Z directions;

S6、依次选取所述卸载顺序数据库中的所述卸载位置的位置坐标,以所述卸载位置的位置坐标为起点计算所述初始位置信息数据库中所有可装载货物的初始位置至所述卸载位置的距离;S6. Select the position coordinates of the unloading positions in the unloading sequence database in turn, and use the position coordinates of the unloading positions as a starting point to calculate the distance from the initial positions of all loadable goods in the initial position information database to the unloading positions. distance;

S7、选择距离最近的可装载货物作为目标装载货物,将所述目标装载货物的初始位置的位置坐标顺序输入所述装载顺序数据库结构中,同时将所述目标装载货物的初始位置的位置坐标从所述初始位置信息数据库中隐藏;S7. Select the loadable cargo with the closest distance as the target loaded cargo, input the position coordinates of the initial position of the target loaded cargo into the loading sequence database structure in sequence, and set the position coordinates of the initial position of the target loaded cargo from hidden in the initial location information database;

S8、重复步骤S6~S7,直至完成对所有所述卸载位置的目标装载货物的搜索。S8. Steps S6 to S7 are repeated until the search for the target loaded goods in all the unloading positions is completed.

本发明起重机货物自动装载顺序的智能优化方法的进一步改进在于,步骤S6中的所有可装载货物通过计算确定,包括如下步骤:A further improvement of the intelligent optimization method for the automatic loading sequence of crane cargoes of the present invention is that all loadable cargoes in step S6 are determined by calculation, including the following steps:

S6-1、比较当前所述初始位置信息数据库中所有初始位置的位置坐标中的X、Y、Z值;S6-1, compare the X, Y, Z values in the position coordinates of all initial positions in the current initial position information database;

S6-2、以X、Y值相等为基础将所有位置坐标分成多组;S6-2. Divide all position coordinates into multiple groups on the basis of equal X and Y values;

S6-3、选取每组中Z值最大的位置坐标所对应的货物作为所述可装载货物。S6-3. Select the cargo corresponding to the position coordinate with the largest Z value in each group as the loadable cargo.

本发明起重机货物自动装载顺序的智能优化方法的进一步改进在于,步骤S4中的所述卸载顺序规则为按照所述卸载位置相对于所述货物装载前初始位置依次采用由低到高、由远及近的规则进行排序。A further improvement of the intelligent optimization method for the automatic loading sequence of the crane cargo according to the present invention is that the unloading sequence rule in step S4 is to follow the unloading position relative to the initial position before loading of the cargo in order from low to high, from far to The nearest rules are sorted.

本发明还提供了一种起重机货物自动装载顺序的智能优化系统,包括:The present invention also provides an intelligent optimization system for the automatic loading sequence of crane cargo, including:

三维空间坐标系建立模块,用以建立三维空间坐标系,以起重机装载货物在大、小车运行和垂直下降三个运动方向的极限位置点作为所述三维空间坐标系的原点,以起重机的小车、大车和起升机构的运行方向分别作为所述三维空间坐标系的X、Y、Z方向;The three-dimensional space coordinate system establishment module is used to establish a three-dimensional space coordinate system, and the limit position point of the crane loaded goods in the three moving directions of large, trolley and vertical descending is used as the origin of the three-dimensional space coordinate system, and the crane's trolley, The running directions of the cart and the hoisting mechanism are taken as the X, Y, and Z directions of the three-dimensional space coordinate system respectively;

初始位置信息数据库形成模块,用以建立m件货物的初始位置与所述三维空间坐标系的对应关系,得到初始位置信息数据库;The initial position information database forming module is used to establish the corresponding relationship between the initial positions of m pieces of goods and the three-dimensional space coordinate system, and obtain the initial position information database;

卸载位置信息数据库形成模块,用以建立m件货物中需要卸载的n件货物的卸载位置与所述三维空间坐标系的对应关系,得到卸载位置信息数据库;The unloading position information database forming module is used to establish the corresponding relationship between the unloading positions of the n pieces of goods to be unloaded among the m pieces of goods and the three-dimensional coordinate system to obtain the unloading position information database;

卸载顺序数据库形成模块,用以制定卸载顺序规则并将所述卸载位置信息数据库按照所述卸载顺序规则进行排序,得到卸载顺序数据库;The unloading sequence database forming module is used to formulate unloading sequence rules and sort the unloading position information database according to the unloading sequence rules to obtain the unloading sequence database;

目标装载货物确定模块,用以依次选取所述卸载顺序数据库中的所述卸载位置的位置坐标,以所述卸载位置的位置坐标为起点计算所述初始位置信息数据库中所有可装载货物的初始位置至所述卸载位置的距离,并选择距离最近的可装载货物作为目标装载货物输出,同时将当前所述目标装载货物的初始位置的位置坐标从所述初始位置信息数据库中隐藏;The target loading goods determination module is used to sequentially select the position coordinates of the unloading positions in the unloading sequence database, and use the position coordinates of the unloading positions as a starting point to calculate the initial positions of all loadable goods in the initial position information database. The distance to the unloading position, and select the loadable cargo with the closest distance as the target loaded cargo for output, and at the same time hide the position coordinates of the initial position of the current target loaded cargo from the initial position information database;

装载顺序数据库形成模块,用以建立装载顺序数据库结构,并依次提取所述目标装载货物的初始位置的位置坐标并顺序输入所述装载顺序数据库结构中以得到装载顺序数据库,所述装载顺序数据库结构为:A loading sequence database forming module is used to establish a loading sequence database structure, and sequentially extract the position coordinates of the initial position of the target loaded goods and sequentially input them into the loading sequence database structure to obtain a loading sequence database. The loading sequence database structure for:

Figure BDA0002282036920000031
Figure BDA0002282036920000031

其中,

Figure BDA0002282036920000032
表示为m件货物中需装载的n件货物的初始位置,Xpc、Ypc、Zpc分别表示需装载的n件货物的初始位置KP在X、Y、Z方向的位置坐标,
Figure BDA0002282036920000033
分别表示需装载的第i件货物在X、Y、Z方向的初始位置的位置坐标,
Figure BDA0002282036920000034
分别表示需装载的第n件货物在X、Y、Z方向的初始位置的位置坐标。in,
Figure BDA0002282036920000032
It is expressed as the initial position of n pieces of goods to be loaded in m pieces of goods, X pc , Y pc , and Z pc respectively represent the position coordinates of the initial position K P of the n pieces of goods to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000033
Respectively represent the position coordinates of the initial position of the i-th cargo to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000034
Respectively represent the position coordinates of the initial position of the nth piece of goods to be loaded in the X, Y, and Z directions.

本发明起重机货物自动装载顺序的智能优化系统的进一步改进在于,所述目标装载货物确定模块还包括可装载货物确定单元,所述可装载货物确定单元用以计算所述初始位置信息数据库中的所有货物的所述初始位置信息的X、Y、Z值,以X、Y值相等为基础将所述初始位置信息分组,并将每组中Z值最大的所述初始位置的位置坐标所对应的货物作为所述可装载货物。A further improvement of the intelligent optimization system for the automatic loading sequence of crane cargo according to the present invention is that the target loading cargo determination module further includes a loadable cargo determining unit, and the loadable cargo determining unit is used to calculate all the data in the initial position information database. The X, Y, Z values of the initial position information of the goods, the initial position information is grouped on the basis of equal X and Y values, and the position coordinates of the initial position with the largest Z value in each group correspond to Cargo as said loadable cargo.

本发明起重机货物自动装载顺序的智能优化系统的进一步改进在于,所述卸载顺序数据库形成模块中的所述卸载顺序规则为按照所述卸载位置相对于所述货物装载前初始位置依次采用由低到高、由远及近的规则进行排序。A further improvement of the intelligent optimization system for the automatic loading sequence of the crane cargo according to the present invention is that the unloading sequence rule in the unloading sequence database forming module is to follow the unloading position relative to the initial position before loading the cargo in order from low to high. High, by far and near rules.

本发明包括且不限于以下有益效果:本发明利用三维位置信息数据库的智能构建方法建立货物的初始位置信息数据库和卸载位置信息数据库,并通过将理论研究方法与实际装卸作业要求及起重机的作业特点进行有机结合,在上述位置信息数据库的基础上,优化并自动生成有效的起重机货物卸载顺序,并以优化的卸载顺序为前提,依次搜索可装载货物,以自动生成有效的起重机货物装载顺序,为后续装卸作业路径规划等定式化计算分析和优化提供了基础,进而实现起重机自动化连续作业并充分发挥起重机有效作业能力,提升作业效率和作业安全性。The present invention includes but is not limited to the following beneficial effects: the present invention uses the intelligent construction method of the three-dimensional position information database to establish the initial position information database and the unloading position information database of the goods, and by combining the theoretical research method with the actual loading and unloading operation requirements and the operation characteristics of the crane Based on the above-mentioned location information database, optimize and automatically generate an effective unloading sequence of crane cargo, and based on the optimized unloading sequence, search for loadable cargo in turn, so as to automatically generate an effective crane cargo loading sequence for The follow-up loading and unloading operation path planning and other formulaic calculation analysis and optimization provide the basis, so as to realize the automatic continuous operation of the crane, give full play to the effective operation ability of the crane, and improve the operation efficiency and operation safety.

附图说明Description of drawings

为了更清楚地说明本发明实施例中的技术方案,下面将对实施例描述中所需要使用的附图作简单地介绍。In order to illustrate the technical solutions in the embodiments of the present invention more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments.

图1示出了货物装载和卸载顺序的理论搜索方法示意图;Figure 1 shows a schematic diagram of a theoretical search method for cargo loading and unloading sequences;

图2示出了起重机卸载作业工艺和搬运作业流程示意图;Figure 2 shows a schematic diagram of the crane unloading operation process and the handling operation flow;

图3示出了起重机货物装载顺序的探索方法示意图;Fig. 3 shows the schematic diagram of the exploration method of the crane cargo loading sequence;

图4示出了本发明方法中货物的初始堆放状态为不规则时的示意图;Fig. 4 shows the schematic diagram when the initial stacking state of the goods in the method of the present invention is irregular;

图5示出了本发明方法中货物的初始堆放状态为规则时的示意图;Fig. 5 shows the schematic diagram when the initial stacking state of the goods in the method of the present invention is regular;

图6示出了起重机对多层货物进行卸载的基本规则示意图;Figure 6 shows a schematic diagram of the basic rules for unloading multi-storey goods by a crane;

图7示出了起重机装载作业工艺和基本作业要求示意图;Figure 7 shows a schematic diagram of the crane loading operation process and basic operation requirements;

图8示出了货物搬运顺序搜寻范围限定条件示意图;FIG. 8 shows a schematic diagram of the limiting conditions for the search range of the cargo handling sequence;

图9示出了本发明方法中起重机装载顺序搜索和自动生成流程图。FIG. 9 shows a flow chart of crane loading sequence search and automatic generation in the method of the present invention.

具体实施方式Detailed ways

起重机在进行一定数量货物的连续装卸作业时,为了得到起重机最短的搬运作业路径并最终获得装卸作业顺序序列指令,需要对所有理论可选择路径的搬运距离进行计算、分析和比较,根据计算、比较结果选择并存储搬运距离最短的装载货物位置,依次类推,最终完成全部装载货物位置和卸载位置的计算。When the crane is carrying out the continuous loading and unloading operation of a certain amount of goods, in order to obtain the shortest handling operation path of the crane and finally obtain the sequence instruction of the loading and unloading operation, it is necessary to calculate, analyze and compare the handling distance of all theoretically selectable paths. As a result, the loading position with the shortest handling distance is selected and stored, and so on, and finally the calculation of all loading positions and unloading positions is completed.

起重机理论可选择路径数量随着装卸货物数量的增大而爆发性地增长,以起重机从m件货物中搬运n件货物到指定目的卸载地点的搬运作业为例,参阅图1,图中的P1,P2,...,Pm分别表示m件货物初始堆放的装载位置,U1,U2,...,Un分别表示需搬运的n件货物的卸载位置,由图可知,起重机从装载位置P1装载第一件货物进行搬运作业时,由于此时所有n个卸载位置均为空置位,如果没有设定任何优化约束条件,此时,起重机可以有n条理论搬运路径可以选择,也就是说起重机完成第一件货物的搬运作业,可以通过n个不同的作业路径实现;起重机完成第一件货物的装载和卸载作业后,返回第二件货物的装载位置准备进行第二件货物的装载作业时,除了已搬运掉的第一件货物外,有(m-1)件货物可以被起重机选择为第二件货物,也就是说,起重机可以有(m-1)条不同的路径返回到第二件货物的装载位置。起重机完成将m件货物中的n件货物搬运到卸载位置的全部作业,理论上总路径数量有

Figure BDA0002282036920000051
条。计算这些不同路径的总搬运距离并寻求总搬运距离的最小化结果,在此基础上优化最短搬运距离对应的规划路径方案,并最终自动获得起重机连续作业的操作指令,实现n件货物的节能高效搬运作业。理论上讲,到此,已经得到搬运路径的最优解。The number of optional paths in the crane theory increases explosively with the increase of the number of loaded and unloaded goods. Take the handling operation of the crane moving n pieces of goods from m pieces of goods to the specified destination unloading location as an example, see Figure 1, P in the figure 1 , P 2 , ..., P m respectively represent the loading positions of m pieces of goods initially stacked, U 1 , U 2 , ... , U n respectively represent the unloading positions of n pieces of goods to be transported, as can be seen from the figure, When the crane loads the first cargo from the loading position P1 for handling, since all n unloading positions are vacant at this time, if no optimization constraints are set, at this time, the crane can have n theoretical handling paths to choose from , that is to say, when the crane completes the handling operation of the first piece of goods, it can be realized through n different operation paths; after the crane completes the loading and unloading of the first piece of goods, it returns to the loading position of the second piece of goods to prepare for the second piece of goods. During the loading operation of goods, in addition to the first piece of goods that has been removed, there are (m-1) pieces of goods that can be selected by the crane as the second piece of goods, that is, the crane can have (m-1) different pieces of goods. The path returns to the loading position for the second item. The crane completes all the operations of transporting n pieces of goods among the m pieces of goods to the unloading position. Theoretically, the total number of paths is
Figure BDA0002282036920000051
strip. Calculate the total handling distance of these different paths and seek the result of minimizing the total handling distance. On this basis, optimize the planning path scheme corresponding to the shortest handling distance, and finally automatically obtain the operation instructions for the continuous operation of the crane to achieve energy saving and high efficiency of n pieces of goods. Handling work. In theory, at this point, the optimal solution of the transport path has been obtained.

但是,在实际的装卸作业现场,起重机的作业规程以及装卸作业的基本要求必须得到严格执行,单纯从能耗最小距离最短等考虑,很难实际解决此类问题。也就是说,约束条件仅仅考虑路径最短得到的优化结果理论上是最优解,但实际是无法满足起重机连续自动化作业的。以图2所示的卸载作业为例,批量货物初始堆放位置M位于接近空间三维坐标原点的位置区域,起重机从该批货物中装载6件货物到指定的目的卸货区域N,6件货物的卸载位置状态如图2所示。按照图2所示的卸载位置和卸载状态,起重机装载第一件货物No.1到卸货区准备卸载时,理论最短路径卸载位置应该是图2所示的6号位,但实际上在1~5号卸货位货物尚未到位前,货物无法在6号位卸载。However, in the actual loading and unloading operation site, the operating procedures of the crane and the basic requirements of the loading and unloading operation must be strictly implemented, and it is difficult to solve such problems simply from the consideration of the minimum energy consumption and the shortest distance. That is to say, the optimization result obtained by considering only the shortest path in the constraints is theoretically the optimal solution, but in practice, it cannot meet the continuous automatic operation of cranes. Taking the unloading operation shown in Figure 2 as an example, the initial stacking position M of the batch of goods is located in a position area close to the origin of the three-dimensional coordinates of the space, and the crane loads 6 pieces of goods from the batch of goods to the designated destination unloading area N, and the 6 pieces of goods are unloaded. The position status is shown in Figure 2. According to the unloading position and unloading state shown in Figure 2, when the crane loads the first cargo No. 1 to the unloading area for unloading, the theoretical shortest path unloading position should be the No. 6 position shown in Figure 2, but in reality it is between 1- The goods cannot be unloaded at No. 6 until the goods are in place at No. 5 unloading position.

因此,需要结合起重机实际装卸作业工艺和搬运作业流程要求修正理论搜索方法,最终获得起重机在实际搬运作业中可执行的装卸作业顺序指令。Therefore, it is necessary to revise the theoretical search method according to the actual loading and unloading operation process of the crane and the requirements of the handling operation process, and finally obtain the loading and unloading operation sequence instructions that the crane can execute in the actual handling operation.

本发明结合理论研究方法与实际装卸作业要求及起重机的作业特点提供了自动生成有效的货物卸载顺序的方法,且基于货物卸载顺序逐个搜索有效的目标装载货物,进而自动生成货物装载顺序。The invention provides a method for automatically generating effective cargo unloading sequences by combining theoretical research methods with actual loading and unloading operation requirements and crane operating characteristics, and searches for valid target loading cargoes one by one based on the cargo unloading sequence, thereby automatically generating the cargo loading sequence.

下面结合公式与附图对本发明所涉及的一种起重机货物自动装载顺序的智能优化方法进行详细说明。The intelligent optimization method for the automatic loading sequence of crane cargo involved in the present invention will be described in detail below with reference to the formula and accompanying drawings.

一种起重机货物自动装载顺序的智能优化方法,包括如下步骤:An intelligent optimization method for the automatic loading sequence of crane goods, comprising the following steps:

S1、建立三维坐标系,以起重机装载货物在大、小车运行和垂直下降三个运动方向的极限位置点作为三维空间坐标系的原点,以起重机的小车、大车和起升机构的运行方向分别作为三维空间坐标系的X、Y、Z方向;S1. Establish a three-dimensional coordinate system, take the limit position point of the crane loaded goods in the three moving directions of the large, the trolley and the vertical drop as the origin of the three-dimensional space coordinate system, and take the running directions of the trolley, the trolley and the hoisting mechanism of the crane respectively. As the X, Y, Z directions of the three-dimensional space coordinate system;

S2、定义初始堆放的货物数量为m件,建立m件货物的初始位置与三维空间坐标系的对应关系,得到初始位置信息数据库;S2. Define the number of initially stacked goods as m pieces, establish the corresponding relationship between the initial positions of the m pieces of goods and the three-dimensional space coordinate system, and obtain the initial position information database;

S3、定义m件货物中有n件货物需要卸载,建立n件货物的卸载位置与三维空间坐标系的对应关系,得到卸载位置信息数据库;S3. Define that there are n pieces of goods in the m pieces of goods that need to be unloaded, establish the corresponding relationship between the unloading positions of the n pieces of goods and the three-dimensional space coordinate system, and obtain the unloading position information database;

S4、制定卸载顺序规则并将卸载位置信息数据库按照卸载顺序规则进行排序,得到卸载顺序数据库;S4, formulate an unloading sequence rule and sort the unloading location information database according to the unloading sequence rule to obtain an unloading sequence database;

S5、建立装载顺序数据库结构,如公式(6)所示:S5. Establish a loading sequence database structure, as shown in formula (6):

Figure BDA0002282036920000061
Figure BDA0002282036920000061

其中,

Figure BDA0002282036920000062
表示为m件货物中需装载的n件货物的初始位置,Xpc、Ypc、Zpc分别表示需装载的n件货物的初始位置KP在X、Y、Z方向的位置坐标,
Figure BDA0002282036920000063
分别表示需装载的第i件货物在X、Y、Z方向的初始位置的位置坐标,
Figure BDA0002282036920000064
分别表示需装载的第n件货物在X、Y、Z方向的初始位置的位置坐标;in,
Figure BDA0002282036920000062
It is expressed as the initial position of n pieces of goods to be loaded in m pieces of goods, X pc , Y pc , and Z pc respectively represent the position coordinates of the initial position K P of the n pieces of goods to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000063
Respectively represent the position coordinates of the initial position of the i-th cargo to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000064
Respectively represent the position coordinates of the initial position of the nth piece of goods to be loaded in the X, Y, and Z directions;

S6、依次选取卸载顺序数据库中的卸载位置的位置坐标,以卸载位置的位置坐标为起点计算初始位置信息数据库中所有可装载货物的初始位置至卸载位置的距离;S6, successively select the position coordinates of the unloading position in the unloading sequence database, and calculate the distance from the initial positions of all loadable goods in the initial position information database to the unloading position with the position coordinates of the unloading position as the starting point;

S7、选择距离最近的可装载货物作为目标装载货物,将目标装载货物的初始位置的位置坐标顺序输入装载顺序数据库结构中,同时将目标装载货物的初始位置的位置坐标从初始位置信息数据库中隐藏;S7. Select the nearest loadable cargo as the target loaded cargo, input the position coordinates of the initial position of the target loaded cargo into the loading sequence database structure in sequence, and hide the position coordinates of the initial position of the target loaded cargo from the initial position information database. ;

S8、重复步骤S6~S7,直至完成对所有卸载位置的目标装载货物的搜索。起重机货物装载顺序的探索方法示意图见图3所示,图中的P1,P2,...,Pm分别表示m件货物初始堆放的装载位置,Ku1,Ku2,...,Kun分别表示所述卸载顺序数据库中依次提取的n件货物的卸载位置。S8. Steps S6 to S7 are repeated until the search for the target loaded goods in all unloading positions is completed. The schematic diagram of the exploration method for the loading sequence of the crane cargo is shown in Figure 3. In the figure, P 1 , P 2 , ..., P m represent the initial loading positions of m pieces of cargo, Ku 1 , Ku 2 , ..., Kun respectively represent the unloading positions of n pieces of goods sequentially extracted from the unloading sequence database.

参阅图4和图5,在本实施例的步骤S1中的小车、大车和起升机构为起重机的三大机构,大车运行机构实现起重机水平移动、小车运行机构驱动小车实现小车在主梁轨道上的水平移动、起升机构实现起重机取物装置的升降作业,通过起重机三维空间坐标系的建立,使货物的整个搬运过程都在三维空间坐标系所定义的三维空间内进行,将货物看作质点,用货物的几何中心所对应的位置坐标作为货物的位置坐标。Referring to FIGS. 4 and 5 , in step S1 of this embodiment, the trolley, the trolley and the hoisting mechanism are the three major mechanisms of the crane. The trolley operating mechanism realizes the horizontal movement of the crane, and the trolley operating mechanism drives the trolley to realize the trolley on the main beam. The horizontal movement and hoisting mechanism on the track realize the lifting operation of the crane picking device. Through the establishment of the three-dimensional space coordinate system of the crane, the entire handling process of the goods is carried out in the three-dimensional space defined by the three-dimensional space coordinate system. As a mass point, the position coordinates corresponding to the geometric center of the cargo are used as the position coordinates of the cargo.

在步骤S2中,首先定义m件货物与三维空间坐标系中X、Y、Z方向相对应的列、行、层数分别为λP、τP、εP,然后分两种情况建立m件货物的初始位置信息数据库:In step S2, first define the number of columns, rows and layers corresponding to the X, Y and Z directions in the three-dimensional space coordinate system of the m pieces of goods as λ P , τ P , and ε P , respectively, and then establish m pieces in two cases. The initial position information database of the goods:

一是当货物的初始堆放状态为不规则时,如图4所示,即当λP×τP×εP≠m时,将m件货物的初始位置表示为P={P1,P2,...,Pm},建立初始位置P与三维空间坐标系的对应关系,得到第一初始位置信息数据库结构,如公式(1)所示:First, when the initial stacking state of the goods is irregular, as shown in Figure 4, that is, when λ P ×τ P ×ε P ≠m, the initial positions of m pieces of goods are expressed as P={P 1 , P 2 , ..., P m }, establish the corresponding relationship between the initial position P and the three-dimensional space coordinate system, and obtain the first initial position information database structure, as shown in formula (1):

Figure BDA0002282036920000071
Figure BDA0002282036920000071

其中,Xp、Yp、Zp分别表示初始位置P在X、Y、Z方向的位置坐标,xpi、ypi、zpi分别表示第i件货物在X、Y、Z方向的位置坐标,

Figure BDA0002282036920000072
分别表示第m件货物在X、Y、Z方向的位置坐标;Among them, X p , Y p , and Z p represent the position coordinates of the initial position P in the X, Y, and Z directions, respectively, and x pi , y pi , and z pi represent the position coordinates of the i-th cargo in the X, Y, and Z directions, respectively. ,
Figure BDA0002282036920000072
Respectively represent the position coordinates of the mth cargo in the X, Y, and Z directions;

将所有货物的初始位置的位置坐标按照预设的导入规则顺序输入至第一初始位置信息数据库结构中,以得到按照指定顺序存储的初始位置信息数据库;上述导入规则需满足使初始位置信息数据库便于后续装载顺序优化等分析计算时快速便捷地调用和存储数据,同时确保货物的相对位置关系清晰,便于系统准确判断货物空间位置关系;Input the position coordinates of the initial positions of all goods into the first initial position information database structure according to the preset import rule sequence, so as to obtain the initial position information database stored in the specified order; the above import rules need to satisfy the initial position information database. Quickly and conveniently call and store data during analysis and calculation such as subsequent loading sequence optimization, while ensuring that the relative position of the goods is clear, so that the system can accurately judge the spatial position of the goods;

二是当货物的初始堆放状态为规则时,如图5所示,即λP×τP×εP=m时,定义m件货物中距离三维空间坐标系原点最近的货物的位置坐标为(xp1,yp1,zp1),定义m件货物的X、Y、Z方向的间隔距离分别为ζPx、ζPy、ζPz,结合上述导入规则将第一初始位置信息数据库结构变形为第二初始位置信息数据库结构,如公式(2)所示:The second is when the initial stacking state of the goods is regular, as shown in Figure 5, that is, when λ P ×τ P ×ε P = m, define the position coordinates of the goods closest to the origin of the three-dimensional space coordinate system among the m pieces of goods as ( x p1 , y p1 , z p1 ), define the separation distances in the X, Y, and Z directions of m pieces of goods as ζ Px , ζ Py , ζ Pz , respectively, and combine the above import rules to transform the first initial position information database structure into the first Two initial position information database structure, as shown in formula (2):

Figure BDA0002282036920000081
Figure BDA0002282036920000081

其中,

Figure BDA0002282036920000082
Figure BDA0002282036920000083
Figure BDA0002282036920000084
是λP
Figure BDA0002282036920000085
构成的矩阵,
Figure BDA0002282036920000086
是λP
Figure BDA0002282036920000087
构成的矩阵,
Figure BDA0002282036920000088
是λP个zp1构成的矩阵,
Figure BDA0002282036920000089
是λP
Figure BDA00022820369200000810
构成的矩阵;in,
Figure BDA0002282036920000082
Figure BDA0002282036920000083
Figure BDA0002282036920000084
is λ P
Figure BDA0002282036920000085
formed matrix,
Figure BDA0002282036920000086
is λ P
Figure BDA0002282036920000087
formed matrix,
Figure BDA0002282036920000088
is a matrix composed of λ P z p1s ,
Figure BDA0002282036920000089
is λ P
Figure BDA00022820369200000810
The matrix formed;

采用第二初始位置信息数据库结构,只需获取距离三维空间坐标系原点最近的货物的位置坐标、m件货物与所述三维空间坐标系中X、Y、Z方向相对应的列、行、层数及m件货物的X、Y、Z方向的间隔距离即可自动生成按照顺序存储的初始位置信息数据库。Using the second initial position information database structure, it is only necessary to obtain the position coordinates of the goods closest to the origin of the three-dimensional space coordinate system, and the columns, rows, and layers of m pieces of goods corresponding to the X, Y, and Z directions in the three-dimensional space coordinate system. The initial position information database stored in sequence can be automatically generated by the number of items and the spacing distances in the X, Y, and Z directions of m pieces of goods.

由于在实际装卸作业过程中,会得到明确的货物卸载指令,该卸载指令根据货物种类和搬运工艺不同一般分为指定卸载货位和指定卸货区域两种:指定卸载货位就是给出每件货物的卸载位置,司机严格按照该卸载指令将每件指定的货物装载和卸载到指定货位;指定卸货区域就是给定一个卸货区域,司机根据经验安排卸载顺序并连续将计划数量的货物搬运并卸载到给定卸货区域。在接收到上述指定卸载货位的卸载指令情况下,由于每件货物以及该货物的卸载位置均被指定,货物卸载指令可以直接转化为连续卸载顺序指令,系统顺序执行该指令可以实现计划数量货物的连续搬运作业;在接收到上述指定卸货区域的卸载指令情况下,要自动获得货物连续卸载顺序指令,必须制定并给定卸货区域的卸载顺序规则,而制定卸载顺序规则的前提是需要有卸载位置信息数据库作为数据基础。During the actual loading and unloading operation, a clear cargo unloading instruction will be obtained. The unloading instruction is generally divided into two types: designated unloading location and designated unloading area according to different types of goods and handling processes: designated unloading location is to give each piece of goods. The unloading location, the driver loads and unloads each designated cargo to the designated cargo location in strict accordance with the unloading instruction; the designated unloading area is a given unloading area, the driver arranges the unloading sequence according to the experience and continuously transports and unloads the planned quantity of goods to a given unloading area. In the case of receiving the above-mentioned unloading instruction of the specified unloading location, since each piece of goods and the unloading location of the goods are specified, the unloading instruction of the goods can be directly converted into a continuous unloading sequence instruction, and the system can execute the instruction sequentially to realize the planned quantity of goods. In the case of receiving the unloading instruction of the above-mentioned designated unloading area, in order to automatically obtain the continuous unloading sequence instruction of the goods, the unloading sequence rule of the unloading area must be formulated and given, and the premise of formulating the unloading sequence rule is that there is an unloading sequence. The location information database serves as the data base.

因此,本实施例在步骤S3中针对指定卸货区域的卸载指令情况对n件需要卸载的货物建立卸载位置信息数据库,具体地,对于指定卸货区域的货物卸载指令情况,卸载位置的放置状态通常为规则的,所以本实施例参考公式(2)的第二初始位置数据库结构来建立卸载位置数据库结构,如公式(3)所示:Therefore, in this embodiment, an unloading location information database is established for n pieces of goods to be unloaded for the unloading instruction of the designated unloading area in step S3. Specifically, for the unloading instruction of the designated unloading area, the placement status of the unloading location is usually: Therefore, this embodiment refers to the second initial position database structure of formula (2) to establish the unloading position database structure, as shown in formula (3):

Figure BDA0002282036920000091
Figure BDA0002282036920000091

其中,U={U1,U2,...,Un}为n件需要卸载的货物于卸货区域的卸载位置,Xu、Yu、Zu分别表示卸载位置U在X、Y、Z方向的位置坐标,(xu1,yu1,zu1)为n个卸载位置中距离三维空间坐标系原点最近的卸载位置的位置坐标,λu、τu、εu分别为n个卸载位置与三维空间坐标系中X、Y、Z方向相对应的列、行、层数,且λu×τu×εu=n,ζux、ζuy、ζuz分别为n个卸载位置的X、Y、Z方向的间隔距离,Xuu=[xu1 xu1ux … xu1uxu-1)],

Figure BDA0002282036920000092
Figure BDA0002282036920000093
是λu个yu1构成的矩阵,
Figure BDA0002282036920000094
是λu
Figure BDA0002282036920000095
构成的矩阵,
Figure BDA0002282036920000096
是λu个zu1构成的矩阵,
Figure BDA0002282036920000097
是λu
Figure BDA0002282036920000098
构成的矩阵;Among them, U={ U 1 , U 2 , . . . , U n } is the unloading position of n pieces of goods to be unloaded in the unloading area. The position coordinates in the Z direction, (x u1 , y u1 , z u1 ) are the position coordinates of the unloading position closest to the origin of the three-dimensional space coordinate system among the n unloading positions, λ u , τ u , ε u are the n unloading positions respectively The number of columns, rows, and layers corresponding to the X, Y, and Z directions in the three-dimensional space coordinate system, and λ u ×τ u ×ε u =n, ζ ux , ζ uy , ζ uz are respectively the X of the n unloading positions , the separation distance in Y and Z directions, X uu =[x u1 x u1ux … x u1uxu -1)],
Figure BDA0002282036920000092
Figure BDA0002282036920000093
is a matrix composed of λ u y u1 ,
Figure BDA0002282036920000094
is λ u
Figure BDA0002282036920000095
formed matrix,
Figure BDA0002282036920000096
is a matrix composed of λ u z u1 ,
Figure BDA0002282036920000097
is λ u
Figure BDA0002282036920000098
The matrix formed;

通过上述卸载位置信息数据库结构的建立,仅需获取n个卸载位置中距离三维空间坐标系原点最近的卸载位置的位置坐标、n个卸载位置与三维空间坐标系中X、Y、Z方向相对应的列、行、层数及n个卸载位置的X、Y、Z方向的间隔距离即可自动生成按照顺序存储的卸载位置信息数据库。Through the establishment of the above-mentioned unloading position information database structure, it is only necessary to obtain the position coordinates of the unloading position closest to the origin of the three-dimensional space coordinate system among the n unloading positions, and the n unloading positions correspond to the X, Y, and Z directions in the three-dimensional space coordinate system. The number of columns, rows, layers and the separation distances in the X, Y, and Z directions of the n unloading positions can automatically generate a database of unloading position information stored in sequence.

步骤S4结合实际装卸作业要求及起重机的作业特点对卸货区域制定卸载顺序规则,对于卸载指令是指定卸货区域的情况,司机通常遵循一定的基本规则进行货物的搬运和卸载作业,参阅图6所示,当货物的卸载状态为多层的情况下,通常是先将货物卸载在最下一层,随后一层一层依次卸载。当货物的卸载状态只有一层的情况下,通常是先将货物卸载在离货物的初始位置最远的卸载位置,随后依次从远到近的卸货顺序完成其它货物的搬运作业。也就是说,司机在货物装卸作业时遵从先卸载的货物不会影响后续装卸作业的基本原则。针对上述基本原则制定按照卸载位置相对于货物装载前初始位置依次采用由低到高、由远及近的顺序卸载的卸载顺序规则,可以按照该卸载顺序规则对卸载位置信息数据库进行重新排序,也可以结合该卸载顺序规则将公式(3)的卸载位置信息数据库结构变形为如公式(4)所示的卸载顺序数据库结构:Step S4 formulates unloading sequence rules for the unloading area in combination with the actual loading and unloading operation requirements and the operating characteristics of the crane. For the case where the unloading instruction is a designated unloading area, the driver usually follows certain basic rules to carry out cargo handling and unloading operations, as shown in Figure 6 , when the unloading state of the goods is multi-layer, the goods are usually unloaded on the bottom layer first, and then unloaded one by one. When the unloading state of the cargo is only one layer, the cargo is usually unloaded at the unloading position farthest from the initial position of the cargo, and then the other cargo handling operations are completed from the farthest to the nearest unloading sequence. That is to say, the driver's compliance with the first unloaded cargo during cargo loading and unloading operations will not affect the basic principle of subsequent loading and unloading operations. According to the above basic principles, the unloading sequence rule is formulated according to the unloading position relative to the initial position of the goods before loading, and the unloading sequence rule is used for unloading in order from low to high, and from far to near. The unloading position information database structure of formula (3) can be transformed into the unloading sequence database structure shown in formula (4) in combination with the unloading sequence rule:

Figure BDA0002282036920000101
Figure BDA0002282036920000101

无论通过哪种方式,最终都将得到按照卸载顺序规则排列的卸载顺序数据库,如公式(5)所示:Either way, the uninstallation sequence database will be finally obtained according to the uninstallation sequence rules, as shown in formula (5):

Figure BDA0002282036920000102
Figure BDA0002282036920000102

其中,

Figure BDA0002282036920000103
表示为m件货物中需卸载的n件货物的卸载位置,Xuc、Yuc、Zuc分别表示需卸载的n件货物的卸载位置Ku在X、Y、Z方向的位置坐标,
Figure BDA0002282036920000104
分别表示需卸载的第i件货物在X、Y、Z方向的卸载位置的位置坐标,
Figure BDA0002282036920000105
分别表示需卸载的第n件货物在X、Y、Z方向的卸载位置的位置坐标。in,
Figure BDA0002282036920000103
It is expressed as the unloading position of n pieces of goods to be unloaded among the m pieces of goods, X uc , Yu uc , and Z uc respectively represent the position coordinates of the unloading position Ku of the n pieces of goods to be unloaded in the X, Y, and Z directions,
Figure BDA0002282036920000104
Respectively represent the position coordinates of the unloading position of the ith cargo to be unloaded in the X, Y, and Z directions,
Figure BDA0002282036920000105
Respectively represent the position coordinates of the unloading position of the nth piece of goods to be unloaded in the X, Y, and Z directions.

另外,由于货物的卸载顺序通常与卸货区域位于货物装载前初始位置的相对位置有关,因此,本发明实施例根据卸货区域相对于货物装载前初始位置的相对位置关系以货物装载前初始位置为中心定义多个卸货区域,并对每个卸货区域建立卸载位置信息数据库以及制定适配的卸载顺序规则,根据适配的卸载顺序规则对每个卸载位置信息数据库重新排序,以得到更加符合实际卸货习惯的有效的卸载顺序数据库。在起重机实际进行搬运作业时,根据卸货指令所制定的卸货区域位于货物初始位置的相对位置关系,选择适合的卸载顺序数据库。In addition, since the unloading sequence of the cargo is generally related to the relative position of the unloading area at the initial position before the cargo is loaded, the embodiment of the present invention takes the initial position before the cargo is loaded as the center according to the relative positional relationship between the unloading area and the initial position before the cargo is loaded Define multiple unloading areas, establish an unloading location information database for each unloading area, formulate an adapted unloading sequence rule, and reorder each unloading location information database according to the adapted unloading sequence rule, so as to obtain a more in line with the actual unloading habits A valid uninstall order database. When the crane actually carries out the handling operation, the appropriate unloading sequence database is selected according to the relative positional relationship between the unloading area and the initial position of the cargo determined by the unloading instruction.

参阅图9,步骤S5~S8为建立装载顺序数据库的步骤,在建立好货物的初始位置信息数据库及卸载顺序数据库的基础上,首先针对需装载的货物建立如公式(6)所示的装载顺序数据库结构,然后针对卸载位置搜索目标装载货物,具体分成两种情况:Referring to FIG. 9 , steps S5 to S8 are the steps of establishing a loading sequence database. On the basis of establishing the initial position information database of the goods and the unloading sequence database, the loading sequence shown in formula (6) is first established for the goods to be loaded. The database structure is then searched for the target loading cargo for the unloading position, which is divided into two cases:

在货物的初始堆放状态为单层情况下,首先,以货物卸载顺序数据库中的第1个卸载位置的位置坐标为起点开始从全部m件货物中搜索搬运路径最短(通过计算卸载位置到每件搜索货物的初始位置的距离并比较获得)的货物,搜索到的该货物成为第1件目标装载货物,系统自动将该目标搬运货物的初始位置的位置坐标存储在预先建立好的装载顺序数据库结构中,该目标装载货物的初始位置的位置坐标就成为货物的装载顺序数据库中第1组装载货物的坐标数据;其次,以货物卸载顺序数据库中的第2个卸载位置的位置坐标为起点开始从全部m-1件货物中搜索下一件搬运路径最短的货物,搜索到的该货物成为第2件目标装载货物,系统同样自动将该目标装载货物的初始位置的位置坐标存储在装载顺序数据库结构中;按照以上方法反复搜索

Figure BDA0002282036920000111
次,最终获得所有需装载货物的装载顺序,以及包含所有n件需装载货物的装载顺序数据库,如公式(6)所示,公式(6)所示的数据库有n列数据,第1列起到第n列的3行的数值分别为货物装载顺序中的第1件装载货物到第n件装载货物的初始位置的位置坐标,且依次按照装载从先到后的顺序从矩阵的左侧排列到右侧。When the initial stacking state of the goods is a single layer, first, starting from the position coordinates of the first unloading position in the unloading sequence database of the goods as the starting point, the shortest transport path is searched from all m pieces of goods (by calculating the unloading position to each piece of goods) Search for the distance from the initial position of the goods and compare the goods obtained), the searched goods become the first target loading goods, and the system automatically stores the position coordinates of the initial position of the target goods in the pre-established loading sequence database structure. , the position coordinates of the initial position of the target loaded cargo become the coordinate data of the first group of loaded cargo in the cargo loading sequence database; secondly, starting from the position coordinates of the second unloading position in the cargo unloading sequence database, starting from In all m-1 pieces of goods, search for the next item with the shortest transport path, and the searched item becomes the second target load item. The system also automatically stores the position coordinates of the initial position of the target load item in the loading sequence database structure. in; search repeatedly according to the above method
Figure BDA0002282036920000111
times, and finally obtain the loading sequence of all the goods to be loaded, as well as the loading sequence database containing all n pieces of the goods to be loaded, as shown in formula (6), the database shown in formula (6) has n columns of data, starting from the first column The values to the 3 rows of the nth column are the position coordinates of the initial position of the first loaded cargo to the nth loaded cargo in the cargo loading sequence, and they are arranged from the left side of the matrix in the order of loading from first to last. to the right.

参阅图7和图8,在货物的初始堆放状态为多层的情况下,起重机装载作业也有基本的作业要求,起重机货物装载顺序的优化必须建立在此基本作业要求基础上,以图7所示的装载作业为例,假设第一件货物的卸载位置位于图7右侧所示的1号位置,以该卸载位置为起点开始搜索距离最近的货物时,如图7左侧所示的1号货物为第一件目标装载货物,但从起重机的基本作业要求看,堆积在1号货物上面的2~5号货物在没有被装载并搬离以前,1号货物是无法首先被装载并搬运的。因此,为了获得与实际作业相适应的货物装载顺序,目标装载货物的搜寻范围要限定在起重机能够进行实际装载作业的货物,如图8所示,货物初始堆放状态为多层情况下,货物装载顺序搜索范围被限制在放置于最上层的货物(即图8中被标记O的货物)。每次搜索目标装载货物时均先确认可装载货物范围,并于可装载货物范围内搜索距离当前卸载位置搬运路径最短的货物,通过对可装载货物范围的限定,大大减少了系统的计算量。Referring to Figure 7 and Figure 8, when the initial stacking state of the goods is multi-layer, the crane loading operation also has basic operation requirements. The optimization of the crane's cargo loading sequence must be based on the basic operation requirements, as shown in Figure 7. For example, if the unloading position of the first piece of goods is located at the No. 1 position shown on the right side of Figure 7, and starting from this unloading position to search for the nearest goods, the No. 1 position shown on the left side of Figure 7 The cargo is the first target to load the cargo, but from the basic operating requirements of the crane, the No. 2 to No. 5 cargo stacked on the No. 1 cargo cannot be loaded and transported first before being loaded and removed. . Therefore, in order to obtain the cargo loading sequence suitable for the actual operation, the search range of the target loaded cargo should be limited to the cargo that the crane can actually load. As shown in Figure 8, when the initial stacking state of the cargo is multi-layered, The sequential search scope is limited to the goods placed on the top layer (ie, the goods marked O in Figure 8). When searching for the target loading cargo, the range of the loadable cargo is confirmed first, and the cargo with the shortest transport path from the current unloading position is searched within the loadable cargo range. By limiting the range of the loadable cargo, the calculation amount of the system is greatly reduced.

进一步地,步骤S6中的所有可装载货物通过计算确定,包括如下步骤:Further, all loadable goods in step S6 are determined by calculation, including the following steps:

S6-1、比较当前初始位置信息数据库中所有初始位置的位置坐标中的X、Y、Z值;S6-1, compare the X, Y, Z values in the position coordinates of all initial positions in the current initial position information database;

S6-2、以X、Y值相等为基础将所有位置坐标分成多组;S6-2. Divide all position coordinates into multiple groups on the basis of equal X and Y values;

S6-3、选取每组中Z值最大的位置坐标所对应的货物作为可装载货物。S6-3. Select the cargo corresponding to the position coordinate with the largest Z value in each group as the loadable cargo.

通过上述改进,利用货物的三维位置信息存储形式,通过比较货物的位置坐标中Z值的大小可以自动筛选出放置于最上层的货物,并且根据数据库中位置坐标的Z值的比较可以自动识别货物的堆放状态为单层或多层,有效实现对可装载货物的确定,进而自动生成起重机货物的装载顺序数据库。起重机货物的装载顺序搜索和自动生成方法详见图9的流程图。Through the above improvements, using the storage form of the three-dimensional position information of the goods, the goods placed on the top layer can be automatically screened by comparing the Z value in the position coordinates of the goods, and the goods can be automatically identified according to the comparison of the Z values of the position coordinates in the database. The stacking state of the crane is single-layer or multi-layer, which effectively realizes the determination of loadable goods, and then automatically generates the loading sequence database of crane goods. See the flowchart in Fig. 9 for details of the loading sequence search and automatic generation method of crane cargo.

本发明基于起重机货物自动装载顺序的智能优化方法提供了一种起重机货物自动装载顺序的智能优化系统,包括:The present invention provides an intelligent optimization system for the automatic loading sequence of crane cargo based on the intelligent optimization method of the crane cargo automatic loading sequence, including:

三维空间坐标系建立模块,用以建立三维空间坐标系,以起重机装载货物在大、小车运行和垂直下降三个运动方向的极限位置点作为三维空间坐标系的原点,以起重机的小车、大车和起升机构的运行方向分别作为三维空间坐标系的X、Y、Z方向;The three-dimensional space coordinate system establishment module is used to establish a three-dimensional space coordinate system. The limit position points of the crane loaded goods in the three moving directions of the large, the trolley and the vertical drop are used as the origin of the three-dimensional space coordinate system. and the running direction of the hoisting mechanism as the X, Y, and Z directions of the three-dimensional space coordinate system;

初始位置信息数据库形成模块,用以建立m件货物的初始位置与三维空间坐标系的对应关系,得到初始位置信息数据库;The initial position information database forming module is used to establish the corresponding relationship between the initial positions of m pieces of goods and the three-dimensional space coordinate system, and obtain the initial position information database;

卸载位置信息数据库形成模块,用以建立m件货物中需要卸载的n件货物的卸载位置与三维空间坐标系的对应关系,得到卸载位置信息数据库;The unloading position information database forming module is used to establish the corresponding relationship between the unloading positions of the n pieces of goods to be unloaded among the m pieces of goods and the three-dimensional space coordinate system, and obtain the unloading position information database;

卸载顺序数据库形成模块,用以制定卸载顺序规则并将卸载位置信息数据库按照卸载顺序规则进行排序,得到卸载顺序数据库;The unloading sequence database forming module is used to formulate the unloading sequence rules and sort the unloading position information database according to the unloading sequence rules to obtain the unloading sequence database;

目标装载货物确定模块,用以依次选取卸载顺序数据库中的卸载位置的位置坐标,以卸载位置的位置坐标为起点计算初始位置信息数据库中所有可装载货物的初始位置至卸载位置的距离,并选择距离最近的可装载货物作为目标装载货物输出,同时将当前目标装载货物的初始位置的位置坐标从初始位置信息数据库中隐藏;The target loading goods determination module is used to sequentially select the position coordinates of the unloading positions in the unloading sequence database, and calculate the distance from the initial positions of all loadable goods in the initial position information database to the unloading positions with the position coordinates of the unloading positions as the starting point, and select The nearest loadable cargo is output as the target loaded cargo, and the position coordinates of the initial position of the current target loaded cargo are hidden from the initial position information database;

装载顺序数据库形成模块,用以建立装载顺序数据库结构,并依次提取目标装载货物的初始位置的位置坐标并顺序输入装载顺序数据库结构中以得到装载顺序数据库,装载顺序数据库结构为:The loading sequence database forming module is used to establish the loading sequence database structure, and sequentially extract the position coordinates of the initial position of the target loaded goods and sequentially input them into the loading sequence database structure to obtain the loading sequence database. The loading sequence database structure is:

Figure BDA0002282036920000121
Figure BDA0002282036920000121

其中,

Figure BDA0002282036920000122
表示为m件货物中需装载的n件货物的初始位置,Xpc、Ypc、Zpc分别表示需装载的n件货物的初始位置KP在X、Y、Z方向的位置坐标,
Figure BDA0002282036920000123
分别表示需装载的第i件货物在X、Y、Z方向的初始位置的位置坐标,
Figure BDA0002282036920000124
分别表示需装载的第n件货物在X、Y、Z方向的初始位置的位置坐标。in,
Figure BDA0002282036920000122
It is expressed as the initial position of n pieces of goods to be loaded in m pieces of goods, X pc , Y pc , and Z pc respectively represent the position coordinates of the initial position K P of the n pieces of goods to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000123
Respectively represent the position coordinates of the initial position of the i-th cargo to be loaded in the X, Y, and Z directions,
Figure BDA0002282036920000124
Respectively represent the position coordinates of the initial position of the nth piece of goods to be loaded in the X, Y, and Z directions.

进一步地,目标装载货物确定模块还包括可装载货物确定单元,可装载货物确定单元用以计算初始位置信息数据库中的所有货物的初始位置信息的X、Y、Z值,以X、Y值相等为基础将初始位置信息分组,并将每组中Z值最大的初始位置的位置坐标所对应的货物作为可装载货物。Further, the target loaded goods determination module also includes a loadable goods determination unit, and the loadable goods determination unit is used to calculate the X, Y, and Z values of the initial position information of all goods in the initial position information database, and the X and Y values are equal. The initial position information is grouped as the basis, and the goods corresponding to the position coordinates of the initial position with the largest Z value in each group are regarded as loadable goods.

较佳地,卸载顺序数据库形成模块中的卸载顺序规则为按照卸载位置相对于货物装载前初始位置依次采用由低到高、由远及近的规则进行排序。Preferably, the unloading sequence rules in the unloading sequence database forming module are sorted according to the unloading position relative to the initial position before loading of the goods using the rules from low to high and from far to near.

本实施例的起重机货物自动装载顺序的智能优化系统,首先通过三维空间坐标系建立模块结合起重机的三大机构建立三维空间坐标系,使货物的整个搬运过程都在三维空间坐标系所定义的三维空间内进行,将货物看作质点,用货物的几何中心所对应的位置坐标作为货物的位置坐标;然后通过初始位置信息数据库形成模块形成货物的初始位置信息数据库、通过卸载位置信息数据库形成模块形成需装载货物的卸载位置信息数据库、通过卸载顺序数据库形成模块结合起重机实际的装卸作业特点指定卸载顺序规则并自动生成实用的卸载顺序数据库;最后通过目标装载货物确定模块按照卸载顺序数据库的位置坐标的先后顺序依次搜索目标装载货物,并向装载顺序数据库形成模块顺序输出目标装载货物以自动生成实用的目标装载顺序数据库。The intelligent optimization system for the automatic loading sequence of the crane cargo in this embodiment first establishes a three-dimensional spatial coordinate system through the three-dimensional spatial coordinate system establishment module combined with the three major mechanisms of the crane, so that the entire handling process of the cargo is in the three-dimensional space defined by the three-dimensional spatial coordinate system. Carry out in space, regard the goods as mass points, and use the position coordinates corresponding to the geometric center of the goods as the position coordinates of the goods; then form the initial position information database of the goods through the initial position information database forming module, and form the module through the unloading position information database forming module. The unloading position information database of the goods to be loaded is formed by the unloading sequence database, and the unloading sequence rules are specified in combination with the actual loading and unloading operation characteristics of the crane, and a practical unloading sequence database is automatically generated; finally, the module is determined by the target loading cargo according to the position coordinates of the unloading sequence database. The target loading goods are searched in sequence, and the target loading goods are sequentially output to the loading order database forming module to automatically generate a practical target loading order database.

以上所述仅是本发明的较佳实施例而已,并非对本发明做任何形式上的限制,虽然本发明已以较佳实施例揭露如上,然而并非用以限定本发明,任何熟悉本专业的技术人员,在不脱离本发明技术方案的范围内,当可利用上述揭示的技术内容作出些许更动或修饰为等同变化的等效实施例,但凡是未脱离本发明技术方案的内容,依据本发明的技术实质对以上实施例所作的任何简单修改、等同变化与修饰,均仍属于本发明技术方案的范围内。The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the present invention in any form. Although the present invention has been disclosed above with preferred embodiments, it is not intended to limit the present invention. Personnel, within the scope of not departing from the technical solution of the present invention, can make some changes or modifications to equivalent examples of equivalent changes by using the technical content disclosed above. Any simple modifications, equivalent changes and modifications made to the above embodiments still fall within the scope of the technical solutions of the present invention.

Claims (6)

1. An intelligent optimization method for automatic loading sequence of crane cargos is characterized by comprising the following steps:
s1, establishing a three-dimensional space coordinate system, taking limit position points of cargos loaded by a crane in three motion directions of large and small car running and vertical descending as an original point of the three-dimensional space coordinate system, and taking the running directions of a small car, a large car and a hoisting mechanism of the crane as X, Y and Z directions of the three-dimensional space coordinate system respectively;
s2, defining the quantity of the initially stacked goods as m goods, and establishing a corresponding relation between the initial positions of the m goods and the three-dimensional space coordinate system to obtain an initial position information database;
s3, defining that n cargos in m cargos need to be unloaded, and establishing a corresponding relation between unloading positions of the n cargos and the three-dimensional space coordinate system to obtain an unloading position information database;
s4, setting an unloading sequence rule and sequencing the unloading position information database according to the unloading sequence rule to obtain an unloading sequence database;
s5, establishing a loading sequence database structure:
Figure FDA0003829817050000011
wherein,
Figure FDA0003829817050000012
expressed as the initial position, X, of the n loads to be loaded out of the m loads pc 、Y pc 、Z pc Respectively representing the initial positions K of n goods to be loaded P Position coordinates in X, Y and Z directions,
Figure FDA0003829817050000013
respectively showing the position coordinates of the initial position of the ith goods to be loaded in the X, Y and Z directions,
Figure FDA0003829817050000014
respectively showing the n-th goods to be loaded in X, Y,Position coordinates of an initial position in the Z direction;
s6, sequentially selecting the position coordinates of the unloading positions in the unloading sequence database, and calculating the distances from the initial positions of all loadable cargos in the initial position information database to the unloading positions by taking the position coordinates of the unloading positions as starting points;
s7, selecting the loaded object with the closest distance as a target loaded object, inputting the position coordinate sequence of the initial position of the target loaded object into the loading sequence database structure, and hiding the position coordinate of the initial position of the target loaded object from the initial position information database;
and S8, repeating the steps S6-S7 until the target loaded goods at all the unloading positions are searched.
2. The intelligent optimization method for the automatic loading sequence of crane cargos according to claim 1, wherein all the loadable objects in the step S6 are determined by calculation, and the method comprises the following steps:
s6-1, comparing X, Y and Z values in position coordinates of all initial positions in the initial position information database;
s6-2, dividing all position coordinates into a plurality of groups on the basis of equal X and Y values;
and S6-3, selecting the goods corresponding to the position coordinate with the maximum Z value in each group as the loadable goods.
3. The intelligent optimization method for the automatic loading sequence of the crane cargos according to claim 1, wherein the unloading sequence rules in the step S4 are that the unloading positions are sequentially sorted from low to high and from far to near relative to the initial positions before the cargos are loaded.
4. An intelligent optimization system for automatic loading sequence of crane cargos, comprising:
the three-dimensional space coordinate system establishing module is used for establishing a three-dimensional space coordinate system, taking limit position points of goods loaded by a crane in three motion directions of large and small car operation and vertical descending as the origin of the three-dimensional space coordinate system, and taking the motion directions of a small car, a large car and a hoisting mechanism of the crane as the X, Y and Z directions of the three-dimensional space coordinate system respectively;
the initial position information database forming module is used for establishing a corresponding relation between the initial positions of the m pieces of goods and the three-dimensional space coordinate system to obtain an initial position information database;
the unloading position information database forming module is used for establishing a corresponding relation between the unloading positions of n cargos to be unloaded in the m cargos and the three-dimensional space coordinate system to obtain an unloading position information database;
the unloading sequence database forming module is used for formulating an unloading sequence rule and sequencing the unloading position information database according to the unloading sequence rule to obtain an unloading sequence database;
the target loaded goods determining module is used for sequentially selecting the position coordinates of the unloading positions in the unloading sequence database, calculating the distances from the initial positions of all loadable goods in the initial position information database to the unloading positions by taking the position coordinates of the unloading positions as starting points, selecting the loadable goods with the closest distances as target loaded goods to be output, and hiding the position coordinates of the initial positions of the current target loaded goods from the initial position information database;
a loading sequence database forming module, configured to establish a loading sequence database structure, sequentially extract the position coordinates of the initial position of the target loaded cargo, and sequentially input the position coordinates into the loading sequence database structure to obtain a loading sequence database, where the loading sequence database structure is:
Figure FDA0003829817050000031
wherein,
Figure FDA0003829817050000032
expressed as initial position, X, of n pieces of goods to be loaded out of m pieces of goods pc 、Y pc 、Z pc Respectively representing the initial positions K of n pieces of goods to be loaded P Position coordinates in X, Y and Z directions,
Figure FDA0003829817050000033
respectively showing the position coordinates of the initial position of the ith goods to be loaded in the X, Y and Z directions,
Figure FDA0003829817050000034
and position coordinates respectively representing initial positions of the nth goods to be loaded in the X, Y and Z directions.
5. An intelligent optimization system for crane cargo automatic loading sequence according to claim 4, wherein said target loadable cargo determination module further comprises a loadable cargo determination unit for calculating X, Y and Z values of said initial position information of all the cargos in said initial position information database, grouping said initial position information on the basis of equal X and Y values, and regarding the cargo corresponding to the position coordinate of said initial position having the largest Z value in each group as said loadable cargo.
6. The intelligent optimization system for the automatic loading sequence of the crane cargos according to claim 4, wherein the unloading sequence rules in the unloading sequence database formation module are ordered according to the rules that the unloading positions are sequentially arranged from low to high and from far to near relative to the initial positions before the cargos are loaded.
CN201911145408.7A 2019-11-21 2019-11-21 Intelligent optimization method and system for automatic loading sequence of crane cargos Expired - Fee Related CN110888904B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911145408.7A CN110888904B (en) 2019-11-21 2019-11-21 Intelligent optimization method and system for automatic loading sequence of crane cargos

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911145408.7A CN110888904B (en) 2019-11-21 2019-11-21 Intelligent optimization method and system for automatic loading sequence of crane cargos

Publications (2)

Publication Number Publication Date
CN110888904A CN110888904A (en) 2020-03-17
CN110888904B true CN110888904B (en) 2022-10-18

Family

ID=69748147

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911145408.7A Expired - Fee Related CN110888904B (en) 2019-11-21 2019-11-21 Intelligent optimization method and system for automatic loading sequence of crane cargos

Country Status (1)

Country Link
CN (1) CN110888904B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115490016A (en) * 2022-09-30 2022-12-20 山东海运股份有限公司 Distribution method of dynamic container storage positions

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102139831A (en) * 2011-01-25 2011-08-03 三一集团有限公司 Container crane and method for loading and unloading containers using crane
CN103761635A (en) * 2014-01-14 2014-04-30 大连理工大学 A three-dimensional multi-box heterogeneous cargo loading optimization method

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7155406B2 (en) * 2002-03-04 2006-12-26 Total Soft Bank, Ltd. Scheduling method for loading and unloading containers at the terminal and a computer readable recording medium recorded a computer programming of the same
US11138827B2 (en) * 2016-09-15 2021-10-05 Simpsx Technologies Llc Implementations of a computerized business transaction exchange for various users

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102139831A (en) * 2011-01-25 2011-08-03 三一集团有限公司 Container crane and method for loading and unloading containers using crane
CN103761635A (en) * 2014-01-14 2014-04-30 大连理工大学 A three-dimensional multi-box heterogeneous cargo loading optimization method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Design of heavy off-road vehicle cargo shipment packing plan SKD;Yong L;《Automobile Applied Technology》;20151231;全文 *
基于三维模型的可视化装箱系统;赵亮;《河南科技》;20150125(第02期);全文 *
集装箱绿色装卸工艺与设备优化配置标准化探究;郭旭;《中国标准化》;20171231;全文 *

Also Published As

Publication number Publication date
CN110888904A (en) 2020-03-17

Similar Documents

Publication Publication Date Title
CN110888903B (en) Method and system for automatic continuous carrying operation of crane
Sha et al. Scheduling optimization of yard cranes with minimal energy consumption at container terminals
CN101866179B (en) Boat segmental hoisting simulation system restricted by three-dimensional space
Kim et al. An optimal routing algorithm for a transfer crane in port container terminals
Ellithy et al. AGV and Industry 4.0 in warehouses: a comprehensive analysis of existing literature and an innovative framework for flexible automation
CN106773686B (en) Path model method for building up is dispatched with piler under the double vehicle operational modes of rail
CN105279629B (en) A kind of intelligent packaging system of optimization
CN110322309A (en) Order processing method, apparatus and computer readable storage medium
CN108932597A (en) Operation management system and operation management method
CN116194391A (en) Controller and method for transporting equipment
CN115724113B (en) Goods picking method, device, electronic device and readable storage medium
JP7402986B2 (en) Container storage planning device, container storage planning system, and container storage planning method
US10643159B2 (en) System and method for mining site production planning
CN110968567B (en) Intelligent construction method and system for three-dimensional location information database of crane cargo
US20200011175A1 (en) Method for optimizing mining production
Angra et al. Comparison and evaluation of job selection dispatching rules for integrated scheduling of multi-load automatic guided vehicles serving in variable sized flexible manufacturing system layouts: a simulation study
CN109911272B (en) A Free Palletizing and Packing Method Based on Reference Line Criterion
CN110888904B (en) Intelligent optimization method and system for automatic loading sequence of crane cargos
JP5434267B2 (en) Transport control method, transport control device, and program
CN110888905B (en) Automatic generation method and system for unloading sequence of crane cargos
Jawahar et al. Optimal random storage allocation for an AS/RS in an FMS
CN101303590B (en) Double-container generating method of automatic dock container
CN101893854B (en) Multiple delivering sequence decision-making system for container terminal shipment
Rajković et al. A multi-objective optimization model for minimizing investment expenses, cycle times and CO2 footprint of an automated storage and retrieval systems
Liu et al. Bins relocation problem in AutoStore: an overview

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
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20221018