CN114943434B - LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals - Google Patents

LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals Download PDF

Info

Publication number
CN114943434B
CN114943434B CN202210527473.1A CN202210527473A CN114943434B CN 114943434 B CN114943434 B CN 114943434B CN 202210527473 A CN202210527473 A CN 202210527473A CN 114943434 B CN114943434 B CN 114943434B
Authority
CN
China
Prior art keywords
crane
point
distance
loading
bit
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
Application number
CN202210527473.1A
Other languages
Chinese (zh)
Other versions
CN114943434A (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.)
Nanjing University of Aeronautics and Astronautics
Original Assignee
Nanjing University of Aeronautics and Astronautics
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 Nanjing University of Aeronautics and Astronautics filed Critical Nanjing University of Aeronautics and Astronautics
Priority to CN202210527473.1A priority Critical patent/CN114943434B/en
Publication of CN114943434A publication Critical patent/CN114943434A/en
Application granted granted Critical
Publication of CN114943434B publication Critical patent/CN114943434B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR 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/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/083Shipping

Landscapes

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

Abstract

The dynamic allocation method for the loading and unloading positions of the liquid dangerous chemicals based on LOF outliers is used for improving the safety of loading and unloading operations of the liquid dangerous chemicals and is characterized by comprising the following steps: 1. establishing a coordinate system for a dangerous chemical loading and unloading area; 2. evaluating the interval degree of the operation crane position through an LOF outlier algorithm; 3. calculating the distances between each crane position and the outlet at equal intervals by using Euler distances so as to ensure the rapid evacuation of emergency; 4. and carrying out iterative optimization calculation according to the real-time operation of the crane bit, and realizing dynamic allocation of the crane bit. According to the invention, the safety distance between crane positions in the loading and unloading area is evaluated based on the LOF outlier algorithm, the Euler distance is used for calculating the emergency evacuation distance, and the loading and unloading operation safety of the liquid dangerous chemicals is improved from the two aspects.

Description

LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals
Technical Field
The invention relates to a liquid dangerous chemicals loading and unloading storage technology, in particular to a liquid dangerous chemicals loading and unloading crane position dynamic allocation method for improving the safety of loading and unloading operation of liquid dangerous chemicals, and specifically relates to a liquid dangerous chemicals loading and unloading crane position dynamic allocation method based on LOF outliers.
Background
The liquid dangerous chemical has the characteristics of inflammability, explosiveness, toxicity, volatility and the like, and when the dangerous chemical is assembled and disassembled, the life and property safety of people are closed, and once accidents occur, the consequences are not considered. The loading crane is located in the storage and transportation field, and refers to the position where the loading arm can extend to obtain the tank wagon, and is considered as the core area where the liquid dangerous chemicals are loaded and unloaded. Because of the material characteristics of the liquid dangerous chemicals, the liquid is heated by heat transfer, friction and other factors, and the pressure is usually increased after the liquid is heated, so that potential safety hazards are easily caused. In hazardous chemical production or transportation enterprises, large storage tanks are usually concentrated in tank areas, and each tank area can be simultaneously provided with a large number of crane positions, so that the safety of the tank area is affected due to the suitability of crane position distribution.
The traditional loading and unloading crane position distribution method mainly depends on manual and independent selection, has high subjectivity, and is difficult to scientifically and comprehensively optimize the safety of loading and unloading operation. Based on the characteristic that liquid dangerous chemicals are volatile, the crane positions and the outlet distances at equal intervals are calculated through Euler distances so as to ensure quick evacuation in emergency, iterative optimization calculation is carried out according to real-time operation of the crane positions, and a dynamic allocation method for loading and unloading crane positions of the liquid dangerous chemicals based on LOF outliers is provided, and reasonable allocation is carried out through intelligent computer decision.
Disclosure of Invention
The invention aims at solving the problems that the existing loading and unloading crane position distribution depends on a manual seat for a long time, the manual loading and unloading position specifying method has great subjectivity and is difficult to ensure the storage and transportation safety, and the invention discloses a dynamic loading and unloading crane position distribution method for liquid dangerous chemicals based on LOF outliers.
The technical scheme of the invention is as follows:
A dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals based on LOF outliers is characterized by comprising the following steps: firstly, establishing a coordinate system of a dangerous chemical loading and unloading area, and evaluating the interval degree of operation crane positions through a local anomaly (LOF, local Outlier Factor) outlier algorithm; then, calculating the distances between each crane position and the outlet at equal intervals by using Euler distances so as to ensure the rapid evacuation of emergency; and finally, carrying out iterative optimization calculation according to the real-time operation of the crane bit to realize dynamic allocation of the crane bit. The method specifically comprises the following steps:
Step 1: establishing a crane bit distribution map, and determining a crane bit set, namely a set formed by each crane bit distributed on the crane bit distribution map according to the crane bit;
step 2: inputting a vehicle entrance signal, automatically identifying a license plate number when the vehicle enters, and setting the entrance signal to be 1 at the moment;
Step 3: checking a vehicle departure signal, automatically identifying license plate numbers when the vehicle leaves, and setting the departure signal to be 1 at the moment;
Step 4: calculating the k distance of each site in an activated point set by using an LOF algorithm, wherein the activated point set is a set consisting of crane sites which are being used by a vehicle, and the activated points are set to mark the situation of crane bit occupation in a crane bit distribution map;
step 5: calculating the reachable distance of each point in the inactive point set by LOF algorithm, wherein the inactive point set is a set formed by crane points in an idle state;
step 6: calculating local reachable density and local outlier degree of each point in the non-activated point set through an LOF algorithm;
step 7: outputting the outlier degree of the inactive points in a descending order;
step 8: checking whether the point with the greatest outlier degree is unique, if so, indicating that the point is the target point, otherwise, turning to the step 9;
Step 9: calculating Euler distances between all points with the maximum outlier degree and the outlet, namely, the evacuation distance;
step 10: and (3) sequencing all the evacuation distances in a descending order, wherein the minimum value of the evacuation distances is the shortest evacuation distance, and the point where the minimum value is located is the crane position allocated to the vehicle.
In the step 1: because of factors of topography, storage tank position, pipeline arrangement and fire control requirements, not all loading and unloading crane positions of tank areas or petrochemical enterprises are in rectangular distribution; so a crane position distribution diagram R of 5 rows and 6 columns is established, the transverse spacing of the central points of each crane position is 20m, and the longitudinal spacing is 30 m; because the actual tank area loading and unloading crane positions are not all rectangular in distribution, in GB 50160-2018 petrochemical industry enterprise design fireproof standard, the loading and unloading crane positions which are not rectangular in distribution are provided, the distance between the loading and unloading crane positions is more than 4 meters to meet the normal operation of the loading and unloading crane pipes, and when the distance is less than 4 meters, the loading and unloading crane positions are inconvenient for the transportation vehicles to adjust the positions, and the liquid dangerous chemicals are mostly inflammable and easy to cause explosion danger. Thus, in order to make the distribution meet international standards while leaving a certain elastic space, the present invention aligns at least 5 meters per column of crane bit positions. After the crane bit distribution diagram R is built, the crane bit being used by the vehicle is in an activated state in R, and the idle crane bit is in an inactivated state in R;
And determining a crane bit set C according to the crane bit distribution, wherein the activation point set S is the number of the activation point sets S, the factory entrance coordinate is (x i,yi), and the factory exit is (x o,yo).
In the step 2: the distribution position of each crane bit is determined, the distribution result depends on the current state, and the algorithm only starts to calculate when the vehicle enters the field; when a vehicle enters a field, the license plate number can be automatically identified, at the moment, an entering signal is set to be 1, and otherwise, the entering signal is set to be 0; when the entry signal is 1, the method starts to execute; since the assigned crane bits are a subset of the set of activation points S by calculation after the vehicle enters, the vehicle entry signal can be defined as S i;
dynamic allocation is realized through round calculation, and a round starting mark is a vehicle entrance signal; that is, when the vehicle entrance signal S i =1, execution is started.
In the step 3: before each round of calculation, the service condition of the loading and unloading crane bit in the factory needs to be updated, and the specific method is to check whether the crane bit in the original operation is completed or not, and after the operation is completed, the crane bit state is updated.
In the step 4: defining d (p, o) as the distance from point p to point o, the k-distance d k (p) for any point p and p+.o in the set of crane bits C is defined as:
dk(p)=d(p,o) (1)。
in the step 5: the kth reachable distance from data point o to data point p is defined as the greater of the kth distance from point o and the distance from point o to point p; the k reachable distance calculation mode from the point o to the point p is shown in the formula (2):
reachDistk(pc-i,pi)=max(kDist(pi),d(pc-i,pi)) (2)
In equation (2), kDist (p i) represents the k distance for each site of the set of activation points S, where k=1, p i∈S,pc-i∈C-S,pi e S.
In the step 6: lrd k denotes the inverse of the average reachable distance from the point to p in the kth neighborhood of the point p, and is denoted as formula (3); this value reflects the dot concentration at the location of the dot p; when this value is higher, it means that the sites are more likely to belong to the same cluster; conversely, the lower the density, the more likely it is an outlier; if p and the surrounding neighborhood point are the same cluster, REACHDIST is smaller d k (o), resulting in a small sum of reachable distances and higher density; if p and the neighbors are far apart, the reachable distance will take on a large value d (p, o), resulting in a small density and possibly outliers. ;
with local densities, the outliers can be found for each point p using equation (4):
In the formula (4), lof k (p) represents an average of the ratio of the local reachable density of the neighborhood point N k (p) of the point p to the local reachable density of the point p; when this ratio is closer to 1, it is explained that p is closer to all neighborhood point densities; if the ratio is smaller than 1, the density of the point p is higher than that of the neighborhood point, and the point p is a dense point; if this ratio is greater than 1, indicating that the density of p is less than its neighborhood point density, p may be an outlier; in the formulas (3) and (4), p c-i∈C-S,pi ε S.
In the step 9: calculating Euler distances between all points with the maximum isolation degree and the outlet; the Euler distance in the constructed crane position distribution diagram R is the distance between two points and is marked as a formula (5); sorting the obtained Euler distance values in a descending order, and selecting p opt with the smallest distance as p out as a crane position allocated to the approaching vehicle;
In formula (5), (x o,yo) represents the outlet, p opt∈pmax.
The beneficial effects of the invention are as follows:
(1) Aiming at the unsafe problem caused by manual monitoring in the loading and unloading crane position distribution in the storage and transportation process for a long time, the dynamic distribution method based on outliers is provided, and computer intelligent decision is used for reasonable distribution, so that the manual distribution link is replaced, and the safety of the storage and transportation process is ensured.
(2) In order to improve the crane position dynamic allocation efficiency, the invention uses a density-based outlier algorithm, comprehensively judges the local density of the points by setting the distance between the fixed points and the points to measure the outlier condition, uses an LOF algorithm to calculate the outlier degree of each site of the activated point set, uses the maximum value selected after descending order as the allocation crane position of the given factory-entering vehicle, and improves the execution efficiency of the algorithm.
(3) In the process of loading and unloading dangerous chemicals at the crane position, if accidents happen, the influence of the dangerous chemicals shows a trend of diffusing from the center to the periphery, and the chain influence is easy to happen, so that the point set density of the position is reflected by calculating the value of the local reachable density, and outliers are obtained; when the value of the outlier factor is larger than 1, the density of the locus is smaller than the density of the regional points, and the outlier factor is possibly an outlier. The site with the minimum density is found through the steps, so that the possible chain reaction caused by the danger of loading and unloading the crane is greatly reduced.
Drawings
Fig. 1 is a flow chart of the present invention.
FIG. 2 is a diagram illustrating the dynamic allocation of bits for the crane of the present invention.
FIG. 3 is a crane bitmap in operation in the present invention.
Detailed Description
The invention will now be described in further detail with reference to the drawings and examples.
As shown in fig. 1-3.
A liquid dangerous chemical loading and unloading crane position dynamic allocation method based on LOF outliers comprises the steps of firstly, evaluating the interval degree of operation crane positions through a local anomaly (LOF, local Outlier Factor) outlier algorithm; then, calculating the distances between each crane position and the outlet at equal intervals by using Euler distances so as to ensure the rapid evacuation of emergency; and finally, carrying out iterative optimization calculation according to the real-time operation of the crane bit to realize dynamic allocation of the crane bit.
FIG. 1 is a flow chart of the present invention for dynamically allocating load and unload bits, comprising the steps of:
Step1: establishing a coordinate system based on the actual loading and unloading area of the enterprise;
Due to factors such as topography, storage tank position, pipeline arrangement, fire protection requirements, etc., not all loading and unloading crane positions of tank areas or petrochemical enterprises are rectangular in distribution. In this embodiment, a crane position distribution diagram R of 5 rows and 6 columns is established, and the center points of each crane position are laterally spaced by 20m and longitudinally spaced by 30 m. Because the actual loading and unloading crane positions of the tank farm do not all show rectangular distribution, in GB 50160-2018 petrochemical enterprises design fireproof standard, the loading and unloading crane positions which are not rectangular are provided, the distance between the loading and unloading crane positions is more than 4 meters, so that the normal operation of the loading and unloading crane can be met, and when the distance is less than 4 meters, the loading and unloading crane positions are inconvenient for the transportation vehicle to adjust, and the liquid dangerous chemicals are mostly inflammable and easy to cause explosion danger. Thus, to make the allocation meet international standards while leaving a certain spring space, the present embodiment aligns each row of crane positions offset by 5 meters (or more, but optimally 5 meters). After the crane bit distribution map R is established, the crane bit being used by the vehicle is in an activated state in R, and the idle crane bit is in an inactivated state in R.
Initializing, namely establishing a crane position distribution map R according to the size of a factory, determining a crane position set C according to the crane position distribution, wherein the activation point set S and m are the number of the activation point set S, the entrance coordinate of the factory is (x i,yi), and the exit is (x o,yo).
The established crane bit dynamic allocation plan space diagram is shown in fig. 2: assuming that the factory has 5 rows and 6 columns and 30 crane positions, the center points of each crane position are transversely spaced by 20 meters, and the longitudinal spacing is 30 meters, and the crane positions in each column are staggered and aligned by 5 meters. And establishing a coordinate system by taking the lower left corner of the drawing as an origin.
Step 2: detecting a vehicle entrance signal S i;
The distribution position of each crane bit is determined, the distribution result is dependent on the current state, and the algorithm only starts to calculate when the vehicle enters the field. When a vehicle enters, the license plate number can be automatically identified, the entering signal is set to be 1 at the moment, and otherwise, the entering signal is set to be 0. When the entry signal is 1, the method starts to execute. Since the assigned crane bits are a subset of the set of activation points S by calculation after the vehicle is entered, the vehicle entry signal can be defined as S i.
The method realizes dynamic allocation through round calculation, and a round starting mark is a vehicle entrance signal. That is, the method starts to be executed when the vehicle entrance signal S i =1.
if(Si==1):
Step 3, jumping to step 3, and starting calculation according to the current round allocation condition;
else:
Jump to step 2, poll wait.
Step 3: detecting a vehicle departure signal S o;
Before each calculation, the service condition of the loading and unloading crane bit of the factory is required to be updated, and the specific method is to check whether the crane bit in the original operation is completed or not, for example, the coloring crane bit in fig. 3 is the crane bit in operation, and after the operation is completed, the crane bit state is updated.
if(So==1):
Let the departure vehicle be o and its working site be p o. Removing the crane site p o of the outgoing vehicle from the activation point set
S, and recalculate m.
else:
Go to step 4.
Step 4: calculating the outlier degree of each locus of the activated point set I by using an LOF algorithm;
first, define d (p, o) as the distance from point p to point o, and define k distance d k (p) for any point p and p+.o in point set C as: d k (p) =d (p, o). Each site k distance kDist (p i) of the activation point set I is calculated, where k=1, p i e S.
The reachable distances REACHDIST k(pc-i,pi for each point in the set of inactive points C-S are then calculated.
for pc-i∈C-S,pi∈S do
reachDistk(pc-i,pi)=max(kDist(pi),d(pc-i,pi)) (1)
end for
Second, the local reachable density and local outlier degree of p c-i were calculated:
for pc-i∈C-S,pi∈S do
end for
Step 5: the point p c-i outlier lof k(pc-i) is ordered from large to small by numerical size. The isolation of the crane bits is shown in descending order as in Table 1, with the crane bit A 23 having the first highest isolation being selected for allocation to the entering vehicle.
Table 1:
step 6: checking whether p max with the largest isolation degree is unique;
if (p max only):
p out=pmax is caused to jump to the step 9;
else:
Go to step 7.
Step 7: all the Euler distances of p max to the factory entrance (x i,yi) and exit (x o,yo) were calculated separately.
for popt∈pmax do
end for
Step 8: the Euler distance dist (p) between the point p opt and the entrance is ordered from big to small according to the numerical value,
P opt, the minimum distance, is chosen to be p out.
Step 9: output p out, ready for the next round of computation.
And outputting p out, namely, the crane position allocated for the approaching vehicle. Meanwhile, p out needs to be added into the active point set, the step 2 is skipped, and the next round of operation is waited.
When the next round of calculation starts, the system records the out-of-field signal when the vehicle is out-of-field in the middle, but the vehicle with the allocated crane position is not adjusted. The outgoing signal is processed only when a new vehicle enters the ground. The processing method is that the crane bit in operation is marked as an empty crane bit, and the crane bit to be allocated is added when the crane bit is allocated. While a 23, which has just been assigned to the vehicle, is added to the crane bit being worked. If the vehicle in which A 44 is located is finished loading and unloading and the crane is released, the second round of calculation requires that A 44 be stripped. The results of the second calculation are shown in Table 2, and it is easy to find that the optimal dispense location is not A 44 but A 45 due to the addition of A 23.
Table 2:
The invention is not related in part to the same as or can be practiced with the prior art.

Claims (8)

1. A dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals based on LOF outliers is characterized by comprising the following steps: firstly, establishing a coordinate system of a dangerous chemical loading and unloading area, and evaluating the interval degree of operation crane positions through a local anomaly, LOF and outlier algorithm; then, calculating the distances between each crane position and the outlet at equal intervals by using Euler distances so as to ensure the rapid evacuation of emergency; finally, carrying out iterative optimization calculation according to the real-time operation of the crane bit to realize dynamic allocation of the crane bit; the method specifically comprises the following steps:
Step 1: establishing a crane bit distribution map, and determining a crane bit set, namely a set formed by each crane bit distributed on the crane bit distribution map according to the crane bit;
step 2: inputting a vehicle entrance signal, automatically identifying a license plate number when the vehicle enters, and setting the entrance signal to be 1 at the moment;
Step 3: checking a vehicle departure signal, automatically identifying license plate numbers when the vehicle leaves, and setting the departure signal to be 1 at the moment;
Step 4: calculating the k distance of each site in an activated point set by using an LOF algorithm, wherein the activated point set is a set consisting of crane sites which are being used by a vehicle, and the activated points are set to mark the situation of crane bit occupation in a crane bit distribution map;
step 5: calculating the reachable distance of each point in the inactive point set by LOF algorithm, wherein the inactive point set is a set formed by crane points in an idle state;
step 6: calculating local reachable density and local outlier degree of each point in the non-activated point set through an LOF algorithm;
step 7: outputting the outlier degree of the inactive points in a descending order;
step 8: checking whether the point with the greatest outlier degree is unique, if so, indicating that the point is the target point, otherwise, turning to the step 9;
Step 9: calculating Euler distances between all points with the maximum outlier degree and the outlet, namely, the evacuation distance;
step 10: and (3) sequencing all the evacuation distances in a descending order, wherein the minimum value of the evacuation distances is the shortest evacuation distance, and the point where the minimum value is located is the crane position allocated to the vehicle.
2. The method according to claim 1, wherein in step 1:
Because of factors of topography, storage tank position, pipeline arrangement and fire control requirements, not all loading and unloading crane positions of tank areas or petrochemical enterprises are in rectangular distribution; so a crane position distribution diagram R of 5 rows and 6 columns is established, the transverse spacing of the central points of each crane position is 20m, and the longitudinal spacing is 30 m; because the loading and unloading crane positions of the actual tank areas are not all rectangular in distribution, in GB 50160-2018 petrochemical enterprises design fireproof standard, the loading and unloading crane positions which are not rectangular in distribution are provided, the distance between the loading and unloading crane positions is more than 4 meters to meet the normal operation of the loading and unloading crane pipes, and when the distance is less than 4 meters, the loading and unloading crane positions are inconvenient for the transportation vehicles to adjust, and the liquid dangerous chemicals are most flammable and are easy to cause explosion danger; for this purpose, the crane dislocation sites of each column should be aligned at least 5 meters; after the crane bit distribution diagram R is built, the crane bit being used by the vehicle is in an activated state in R, and the idle crane bit is in an inactivated state in R; and determining a crane bit set C according to the crane bit distribution, wherein the activation point set S is the number of the activation point sets S, the factory entrance coordinate is (x i,yi), and the factory exit is (x o,yo).
3. The method according to claim 1, wherein in step 2:
The distribution position of each crane bit is determined, the distribution result depends on the current state, and the algorithm only starts to calculate when the vehicle enters the field; when a vehicle enters a field, the license plate number can be automatically identified, at the moment, an entering signal is set to be 1, and otherwise, the entering signal is set to be 0; when the entry signal is 1, the method starts to execute; since the assigned crane bits are assigned to the assigned crane bits by calculation after the vehicle enters, the assigned crane bits are a subset of the set of activation points S, and the vehicle entering signal is defined as S i;
dynamic allocation is realized through round calculation, and a round starting mark is a vehicle entrance signal; that is, when the vehicle entrance signal S i =1, execution is started.
4. The method according to claim 1, wherein in the step 3:
Before each round of calculation, the service condition of the loading and unloading crane bit in the factory needs to be updated, and the specific method is to check whether the crane bit in the original operation is completed or not, and after the operation is completed, the crane bit state is updated.
5. The method according to claim 1, wherein in step 4: defining d (p, o) as the distance from point p to point o, the k-distance d k (p) for any point p and p+.o in the set of crane bits C is defined as:
dk(p)=d(p,o) (1)。
6. The method according to claim 5, wherein in step 5: the kth reachable distance from data point o to data point p is defined as the greater of the kth distance from point o and the distance from point o to point p; the k reachable distance calculation mode from the point o to the point p is shown in the formula (2):
reachDistk(pc-i,pi)=max(kDist(pi),d(pc-i,pi)) (2)
In equation (2), kDist (p i) represents the k distance for each site of the set of activation points S, where k=1, p i∈S,pc-i∈C-S,pi e S.
7. The method according to claim 6, wherein in step 6: lrd k denotes the inverse of the average reachable distance from the point to p in the kth neighborhood of the point p, and is denoted as formula (3); this value reflects the dot concentration at the location of the dot p; when this value is higher, it means that the sites are more likely to belong to the same cluster; conversely, the lower the density, the more likely it is an outlier; if p and the surrounding neighborhood point are the same cluster, REACHDIST is smaller d k (o), resulting in a small sum of reachable distances and higher density; if p and the adjacent point are far, the reachable distance takes a larger value d (p, o), so that the density is small and the possible outliers are caused;
with local densities, the outliers can be found for each point p using equation (4):
In the formula (4), lof k (p) represents an average of the ratio of the local reachable density of the neighborhood point N k (p) of the point p to the local reachable density of the point p; when this ratio is closer to 1, it is explained that p is closer to all neighborhood point densities; if the ratio is smaller than 1, the density of the point p is higher than that of the neighborhood point, and the point p is a dense point; if this ratio is greater than 1, indicating that the density of p is less than its neighborhood point density, p may be an outlier; in the formulas (3) and (4), p c-i∈C-S,pi ε S.
8. The method according to claim 1, wherein in step 9: calculating Euler distances between all points with the maximum isolation degree and the outlet; the Euler distance in the constructed crane position distribution diagram R is the distance between two points and is marked as a formula (5); sorting the obtained Euler distance values in a descending order, and selecting p opt with the smallest distance as p out as a crane position allocated to the approaching vehicle;
In formula (5), (x o,yo) represents the outlet, p opt∈pmax.
CN202210527473.1A 2022-05-16 2022-05-16 LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals Active CN114943434B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210527473.1A CN114943434B (en) 2022-05-16 2022-05-16 LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210527473.1A CN114943434B (en) 2022-05-16 2022-05-16 LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals

Publications (2)

Publication Number Publication Date
CN114943434A CN114943434A (en) 2022-08-26
CN114943434B true CN114943434B (en) 2024-07-02

Family

ID=82906921

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210527473.1A Active CN114943434B (en) 2022-05-16 2022-05-16 LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals

Country Status (1)

Country Link
CN (1) CN114943434B (en)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100535955C (en) * 2008-04-01 2009-09-02 东南大学 Method for recognizing outlier traffic data
CN106162862A (en) * 2015-03-24 2016-11-23 中兴通讯股份有限公司 Calculate the mobile station method and device to community distance
CN112782686A (en) * 2020-12-15 2021-05-11 浙江中控技术股份有限公司 Automatic alignment system and method for loading based on multidimensional identification and positioning technology
CN112731887B (en) * 2020-12-31 2023-03-31 南京理工大学 Digital twin intelligent monitoring system and method for petrochemical unattended loading and unloading line
CN112949735A (en) * 2021-03-15 2021-06-11 南京航空航天大学 Liquid hazardous chemical substance volatile concentration abnormity discovery method based on outlier data mining

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于LOF与欧氏距离的液态危化品安全鹤位分配方法;薛善良 等;《西华大学学报(自然科学版)》;20230510;第42卷(第3期);第105-112页 *

Also Published As

Publication number Publication date
CN114943434A (en) 2022-08-26

Similar Documents

Publication Publication Date Title
CN115994689B (en) Management method and device for safe transportation of dangerous goods in intelligent dock and harbor district
CN105389975A (en) Chauffeured car scheduling method and apparatus
CN102722775A (en) Security crisis management system and method for coal mine
CN112100933B (en) SCR denitration system ammonia injection grid quantitative optimization simulation method, system and medium
CN114943434B (en) LOF outlier-based dynamic allocation method for loading and unloading crane positions of liquid dangerous chemicals
CN112668907A (en) Logistics node management information processing method and device
CN116512272B (en) Part processing supervision method, device, equipment and storage medium
WO2023116573A1 (en) Scheduling method and apparatus, electronic device, and readable storage medium
CN114974452B (en) Method and device for determining control target of secondary conversion source
CN116596425A (en) Safety scheduling method and system for petrochemical harbor tank truck based on seepage analysis
Virtudes et al. ICT method for evaluation of heritage buildings conservation
CN113742641A (en) Enterprise environment risk assessment system and method based on fuzzy approximation application
KR20080025994A (en) Job assignment apparatus of automatic material handling system and method thereof
CN113127800B (en) Method and device for generating loading position of vehicle to be loaded for mine unmanned operation
Pankratovich et al. Parameters of optimization of transfer operations of the harvesting process
Rekik et al. Container stacking problem: a literature review
Blokus-Roszkowska et al. Reliability analysis of complex shipyard transportation system with dependent components
Wendl Occupancy modeling of coverage distribution for whole genome shotgun DNA sequencing
KR102254402B1 (en) Conceptual Cost Estimation Method and System for Industrial Modular Construction Project based Quantity of Standard Work
Liu et al. Quay crane scheduling problem with the consideration of maintenance
Li et al. Simulation based optimization for the loading-unloading strategies of railway container terminal
CN117973642B (en) Cross variation optimization pulp ship loading method and system
CN116561880B (en) Installation analysis method for special-shaped steel structure
CN118036161B (en) Analysis method for durability of aqueduct structure
CN114036450B (en) Method for quickly checking testability index of electronic information equipment and storage medium

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