Nothing Special   »   [go: up one dir, main page]

CN109583636B - A method of selecting isolation doors for dangerous goods warehouses based on hesitant decision sets - Google Patents

A method of selecting isolation doors for dangerous goods warehouses based on hesitant decision sets Download PDF

Info

Publication number
CN109583636B
CN109583636B CN201811385382.9A CN201811385382A CN109583636B CN 109583636 B CN109583636 B CN 109583636B CN 201811385382 A CN201811385382 A CN 201811385382A CN 109583636 B CN109583636 B CN 109583636B
Authority
CN
China
Prior art keywords
warehouse
scheme
dangerous goods
warehouses
storage
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
CN201811385382.9A
Other languages
Chinese (zh)
Other versions
CN109583636A (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.)
Shanghai Maritime University
Original Assignee
Shanghai Maritime 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 Shanghai Maritime University filed Critical Shanghai Maritime University
Priority to CN201811385382.9A priority Critical patent/CN109583636B/en
Publication of CN109583636A publication Critical patent/CN109583636A/en
Application granted granted Critical
Publication of CN109583636B publication Critical patent/CN109583636B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION 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/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087—Inventory or stock management, e.g. order filling, procurement or balancing against orders

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Game Theory and Decision Science (AREA)
  • Warehouses Or Storage Devices (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明提供了一种基于犹豫决策集的危险品仓库隔离门选择方法，针对危险品存储仓库供不应求的现状，以互通仓库为对象，步骤：A、制定隔离门和铲车使用原则；B、根据总存储量和隔离门的使用情况，设计多套危险品存储方案；C、确定最优方案决策指标；D、采用犹豫距离集对危险品存储方案进行综合比选，并确定最优方案。通过使用上述方法，可有效地提高互通危险品仓库的使用效率，缓解因危险品存储仓库容量不足而引起的压力。通过本发明所提出的一种基于犹豫决策集的互通危险品仓库隔离门的使用决策方法，可以提高危险品仓库的使用效率，一定程度上能缓解危险品仓库供不应求问题。

Figure 201811385382

The invention provides a method for selecting an isolation door for a dangerous goods warehouse based on a hesitant decision set. Aiming at the current situation in which the supply of dangerous goods storage warehouses is in short supply, taking the intercommunication warehouse as an object, the steps are: A. formulating the principles for the use of isolation doors and forklifts; B. according to Design multiple sets of dangerous goods storage schemes based on the total storage capacity and the use of isolation doors; C. Determine the optimal scheme decision-making index; D. Use the hesitation distance set to comprehensively compare and select the dangerous goods storage scheme, and determine the optimal scheme. By using the above method, the utilization efficiency of the intercommunication dangerous goods warehouse can be effectively improved, and the pressure caused by the insufficient capacity of the dangerous goods storage warehouse can be relieved. The use decision method of the intercommunication dangerous goods warehouse isolation door based on the hesitation decision set proposed by the present invention can improve the use efficiency of the dangerous goods warehouse, and alleviate the problem of the shortage of dangerous goods warehouses to a certain extent.

Figure 201811385382

Description

Dangerous goods warehouse isolation door selection method based on hesitation decision set
Technical Field
Aiming at the current situation of use of supply and short supply of a dangerous goods storage warehouse and aiming at improving the use efficiency of the dangerous goods storage warehouse, the invention introduces the concept of hesitation comprehensive relative distance set with parameters, provides a selection strategy method of an intercommunicating dangerous goods storage isolation door, and belongs to the field of dangerous goods storage management.
Background
According to survey, the current domestic dangerous goods storage market generally shows that supply and demand are not met, and some urban dangerous goods storages can not meet market demands. In order to deal with the current situation of insufficient supply and demand of the warehouse, on one hand, the construction strength of the dangerous goods warehouse is increased, the supply capacity of the warehouse is improved, and the problem of shortage of the warehouse is solved from the source; on the other hand, the management level of the warehouse is scientifically improved and the use efficiency of the warehouse is improved by changing the storage structure of the existing warehouse.
In contrast, the second method described above is more advantageous from both a set-up cycle perspective and a capital investment perspective. In view of the above, the invention provides a use decision method of an intercommunicated dangerous goods warehouse isolation door, which provides a series of perfect decision methods for scientific and efficient use of a dangerous goods warehouse on the basis of modifying the storage structure of the existing dangerous goods warehouse, thereby realizing efficient management of the dangerous goods warehouse.
Disclosure of Invention
The invention provides a decision-making method for using a dangerous goods warehouse isolation door based on a hesitation decision set, aiming at the situation of structural modification of a dangerous goods warehouse and improving the use efficiency of the dangerous goods warehouse. By using the method, the use efficiency of the dangerous goods warehouse can be improved, and the problem of short supply and short demand of the dangerous goods warehouse can be relieved to a certain extent.
The technical scheme of the invention is as follows:
a dangerous goods warehouse isolation door selection method based on a hesitation decision set comprises the following steps:
(A) establishing the use principle of the isolation door and the forklift; the use principle of the isolation door is as follows: when the total storage capacity K is more than or equal to 12 and the number e of the forklifts is more than or equal to 1, the isolation door can be used; the forklift is used according to the following principle: the forklift trucks run along a specified path in the warehouse in a clockwise direction, and the two forklift trucks cannot be simultaneously present in the same room;
(B) designing a plurality of dangerous goods storage schemes according to the total storage capacity and the service condition of the isolation door;
when the following conditions occur, namely the total storage K is more than or equal to 12, and the forklift number e is more than or equal to 1, designing various dangerous goods storage schemes; the storage scheme consists of different types of multi-door warehouses which are mainly different in that different rooms are contained;
the storage scheme is designed as follows: according to the standard of the existing dangerous goods storage warehouse, the total number of warehouse bits of a warehouse with t doors is m (t) -4 t +4, wherein the number of the warehouse doors is an even number; the storage schemes under different warehouse combinations corresponding to the total storage amount K are uniformly represented by the following formula:
Figure GDA0003181093550000021
wherein, ah(t) represents the number of t door bins in the scheme h, delta (h) represents the number of the rest bins in the scheme h, and delta (h) is smaller than 12 bins; the value of K is related to K and is the maximum even number meeting the condition that m (t) is less than or equal to K;
specifically, the recipe parameters (a)h(2)，ah(4)，…，ah(k) Δ (h)) is determined as follows:
firstly, calculating the maximum warehouse door number T corresponding to the total storage K, wherein the method comprises the following steps: calculating an intermediate value B ═ int (0.25K-1), if B is an even number, T ═ B, if B is an odd number, T ═ B-1, where int (X) denotes taking an integer downward for X;
then, the relevant parameters of the first scheme are calculated. Calculating the warehouse quantity a corresponding to the maximum warehouse door number T1(T)＝int[K/m(T)]Calculating the required storage amount S after deducting the storage capacity of the T-door warehouse1(T)＝K-a1(T) m (T), compare S1(T) and the storage capacity m (T-2) of the T-2 door, if S1(T) is more than or equal to m (T-2), the number a of required T-2 door warehouses is calculated1(T-2)＝int[S1(T)/m(T-2)]Calculating the required storage amount S after deducting the storage amount of the T-2 door warehouse1(T-2)＝S1(T)-a1(T-2) × m (T-2); if S1(T) < m (T-2), S are compared in sequence1(T) and m (T-4), m (T-6), …, m (2), and determining a in sequence1(T-4)、a1(T-6)、…、a1(2) And the remaining storage amount S1(2). In this case, the parameter of the first scheme is (a)1(2)+1，a1(4)，…，a1(T), Δ (1)), wherein Δ (1) ═ 12-S1(2)。
Finally, the relevant parameters of the scheme h 1,2,3,4 … are determined in turn. If the number of the most door warehouse in the scheme h-1 is more than 2, reducing the number of the most door warehouse by one, and taking the number as the number of the most door warehouse in the scheme h; if the maximum number of door storehouses in the scheme h-1And the quantity is 1, taking the warehouse with 2 doors less than the maximum door number as the maximum door warehouse of the scheme i, and calculating the warehouse quantity. By adopting the method in the previous step, the warehouse quantity and the residual storage quantity S which are 2 doors, 4 doors and 6 doors less than the warehouse with the maximum doors of the scheme are sequentially determined, wherein … is less2(2) And determining the relevant parameters of the scheme i.
The steps are repeatedly executed until only 2 storehouses are formed in the scheme.
(C) Determining an optimal scheme decision index; the decision indexes comprise time cost, space cost, economic cost and safety degree;
said time cost cthIncluding forklift operation time and outside collection card travel time, its formula of calculating is:
Figure GDA0003181093550000031
wherein e ishIndicates the number of shovels, v, in the plan h1For the speed of operation of the forklift, v2For the container truck operating speed, l (C, p)i) Indicating that the forklift is moving from position C to storage point piRunning distance of l (C)j',Cj'+1) Indicating container truck position CjIs moved to position Cj+1The length of the track;
said space cost csphExpressed by the product of the number of warehouse rooms and the rental fee, the calculation formula is as follows:
csph＝b·th
wherein, thB represents the warehouse rental fee of a single warehouse for the number of warehouse rooms used in the plan h;
said economic cost cehIn relation to the total length of the forklift travel path and the current oil price:
Figure GDA0003181093550000032
wherein f represents the vehicle fuel price on the day;
the safety degree csahThe similarity between the forklift operation lines is represented, and the specific calculation method is as follows:
Figure GDA0003181093550000041
wherein abs (l (C, p)i)-l(C,pj) Denotes taking l (C, p)i)-l(C,pj) Absolute value of (d);
the optimal scheme is that the comprehensive cost is minimum, and the optimal scheme is further converted into a scheme for solving the maximum relative distance value of the comprehensive attribute;
(D) carrying out comprehensive comparison and selection on the dangerous goods storage scheme to determine an optimal scheme;
the method comprises the following steps:
(D1) assuming that the value of the oil price is f ═ f1,f2,…,f5) The value of the warehouse fee is b ═ b (b)1,b2,…,b5) Determining a hesitant decision set of the warehousing scheme set through actual research:
Figure GDA0003181093550000042
wherein m represents the total amount of the recipe, ctmRepresents the time cost of the mth scheme, { cspm1,…,cspm5Represents the space cost value of the mth scheme, { cem1,…,cem5Represents the value of the economic cost of the mth scheme, csamRepresents the security of the mth scheme;
(D2) determining negative ideal points in hesitation decision set
Let the ideal point be Cmax＝(c′t,(c′sp1,c′sp2,…,c′sp5),(c′e1,c′e2,…,c′e5)，c′sa) Each component is determined by:
Figure GDA0003181093550000043
wherein k is 1,2,3,4,5, q is 1,2,3,4, 5;
(D3) calculating the distance between each decision scheme and the negative ideal point; assume that the distance of the negative ideal point in scenario h is Dh＝[dth{dsph1,dsph2,…,dsph5}{deh1,deh2,…,deh5}dsah]Each component is determined by:
Figure GDA0003181093550000051
wherein k is 1,2,3,4,5, q is 1,2,3,4, 5;
the relative distance matrix of m schemes is determined in the same way:
Figure GDA0003181093550000052
(D4) and sequencing the relative distance sets of the m schemes according to a comparison method of the hesitation distance sets, and determining that the relative distance value of the comprehensive attribute is maximum as an optimal scheme.
The invention has the beneficial effects that: the use decision method of the intercommunicated dangerous goods warehouse isolation door based on the hesitation decision set can improve the use efficiency of the dangerous goods warehouse and relieve the supply and short-supply problems of the dangerous goods warehouse to a certain extent.
Drawings
FIGS. 1(a) to (d) are graphs for comparing the integrated distance values between different schemes.
Fig. 2 is a flow chart of the present invention.
Detailed Description
The technical scheme of the invention is explained in detail in the following with the accompanying drawings
As shown in fig. 2, the present invention provides a decision-making method for using an isolation door of an intercommunicated hazardous articles warehouse based on a hesitation decision set, which comprises the following steps:
step A, establishing the use principle of the isolation door and the forklift.
In the step, when the total storage capacity K is more than or equal to 12 and the number e of the forklifts is more than or equal to 1, the isolation door can be used; the forklift is used according to the following principle: the forklift runs clockwise in the warehouse according to a specified path; two forklifts cannot be present in the same room at the same time. The forklift is used according to the following principle: the forklift runs clockwise in the warehouse according to a specified path; two forklifts cannot be present in the same room at the same time.
And step B, designing a plurality of dangerous goods storage schemes according to the service condition of the isolation door.
In this step, assuming that K is 34, the total bin number of the warehouse with t gate is m (t) 4t +4, where the gate number t of the warehouse is 2,4,6,8, and therefore, the storage schemes under different warehouse combinations corresponding to the total storage amount K is 34 are shown in the following table:
table 1K scheme design under 34
Figure GDA0003181093550000061
And step C, determining the attribute indexes and the multi-attribute decision target.
In the step C, the attribute indexes comprise time cost, space cost, economic cost and safety degree. The optimal scheme is that the comprehensive cost is minimum, and the optimal scheme is further converted into a scheme for solving the maximum relative distance value of the comprehensive attribute. Given the number of forklifts used in each scenario is e1＝1，e1＝2，e1＝3，e1And 4, another forklift is always waiting for warehousing outside the warehouse. The Shanghai 0# diesel oil obtained by actual research is 6.88 yuan/liter at present, and the price of the diesel oil and the international oil price change at any time in accordance with 0.68 yuan per kilometer. Assuming that the daily cost of each room is 420 yuan, when 10 heaps are averaged per room, each heap costs 42 yuan per day, and if 12 heaps are averaged, each heap costs 35 per day. The running speeds of the forklift and the truck are v respectively1＝5km/h，v2＝15km/h。
Step D, comprehensively selecting the dangerous goods storage scheme to determine an optimal scheme;
the step D comprises the following steps:
(D1) the weight vector of the optimal indexes of the warehouse to the four schemes is (0.2,0.3,0.4 and 0.1), the cost value of each room is (400,410,420,430,440), the oil price value is (4.8,5.4,6,6.6 and 7.2), and the obtained hesitation decision set is
Figure GDA0003181093550000071
(D2) Solving the negative ideal point in the hesitation decision set is
C’＝(0.176,{1600,1640,1680,1720,1760},{0.784,0.882,0.979,1.077,1.743},0.6188)。
(D3) Calculating the distance between each decision scheme and the negative ideal point to obtain a relative distance matrix of
Figure GDA0003181093550000072
(D4) Comparison method pair by hesitation distance set (D)2,D4)，(D2,D3)，(D1,D3) Comparing to obtain
Figure GDA0003181093550000073
The combined distance ordering of these four schemes is therefore D3＞D1＞D4＞D2. And determining the maximum relative distance value of the comprehensive attribute as an optimal scheme according to the comparison result. Therefore, the third scheme is the optimal scheme. The specific comparison results are shown in fig. 1.

Claims (2)

1.一种基于犹豫决策集的危险品仓库隔离门选择方法，其特征在于，步骤如下：1. a method for selecting a dangerous goods warehouse isolation door based on hesitant decision set, is characterized in that, step is as follows: (A)、制定隔离门和铲车使用原则；其中隔离门的使用原则如下：当总存储量K≥12，且铲车数量e≥1时，才能使用隔离门；铲车的使用原则如下：铲车在仓库内顺时针方向按指定的路径行驶，两辆铲车不能同时出现在同一房间内；(A), formulate the principles of use of isolation doors and forklifts; the principles of use of isolation doors are as follows: when the total storage capacity K≥12, and the number of forklifts e≥1, the isolation doors can be used; the use principles of forklifts are as follows: The forklift drives clockwise in the warehouse according to the designated path, and two forklifts cannot appear in the same room at the same time; (B)、根据总存储量和隔离门的使用情况，设计多套危险品存储方案；(B), according to the total storage capacity and the use of isolation doors, design multiple sets of dangerous goods storage plans; 当出现下述情况时，即总存储量K≥12，且铲车数量e≥1时，设计多种危险品存储方案；存储方案由不同类型的多门仓库组成，这些多门仓库主要的区别在于包含不同的房间数；When the following situations occur, that is, the total storage capacity K≥12, and the number of forklifts e≥1, design a variety of dangerous goods storage schemes; the storage scheme consists of different types of multi-door warehouses, and the main differences between these multi-door warehouses are is to include a different number of rooms; 所述的存储方案的设计如下：按照现有危险品存储仓库的标准，一个t门的仓库所具有的总仓位数为m(t)＝4t+4，其中仓库的门数取偶数；总存储量为K所对应的不同仓库组合下的存储方案统一由下式表示：The design of the storage scheme is as follows: according to the existing standards for storage warehouses for dangerous goods, the total number of warehouses in a warehouse with t doors is m(t)=4t+4, and the number of doors in the warehouse is an even number; The storage schemes under different warehouse combinations corresponding to the quantity K are uniformly expressed by the following formula:
Figure FDA0003196960400000011
Figure FDA0003196960400000011
 其中，ah(t)表示方案h中t门仓库的数量，Δ(h)表示方案h中剩余仓位数，Δ(h)应小于12个仓位；k的取值与K有关，其值为满足m(t)≤K条件的最大偶数；Among them, a h (t) represents the number of warehouses in door t in scheme h, Δ(h) represents the number of remaining warehouses in scheme h, and Δ(h) should be less than 12 warehouses; the value of k is related to K, and its value is The largest even number that satisfies the condition of m(t)≤K; (C)、确定最优方案决策指标；决策指标包括时间成本、空间成本、经济成本和安全度；(C), determine the optimal plan decision-making index; the decision-making index includes time cost, space cost, economic cost and safety degree; 所述的时间成本cth包括铲车运行时间和外部集卡移动时间，其计算式为：The time cost c th includes the running time of the forklift and the moving time of the external truck, and its calculation formula is:
Figure FDA0003196960400000012
Figure FDA0003196960400000012
 其中，eh表示方案h中铲车数量，v1为铲车运行速度，v2为集装箱卡车运行速度，l(C,pi)表示铲车从位置C处到入库点pi的运行距离，l(Cj',Cj'+1)表示集装箱卡车由位置Cj'处移动到位置Cj'+1处的轨迹长度；Among them, e h represents the number of forklifts in the scheme h, v 1 is the running speed of the forklift, v 2 is the running speed of the container truck, and l(C, p i ) represents the operation of the forklift from the position C to the storage point p i Distance, l(C j' , C j'+1 ) represents the trajectory length of the container truck moving from position C j ' to position C j'+1 ; 所述的空间成本csph由仓库房间的数量与仓租费的乘积表示，其计算式如下：The space cost c sph is expressed by the product of the number of warehouse rooms and the warehouse rental fee, which is calculated as follows: csph＝b·th c sph = b · th 其中，th为方案h中所使用的仓库房间数，b表示单个仓库的仓租费；Among them, t h is the number of warehouse rooms used in scheme h, and b represents the warehouse rental fee of a single warehouse; 所述的经济成本ceh与铲车运行路径总长度和当前油价有关：The stated economic cost c eh is related to the total length of the forklift travel path and the current oil price:
Figure FDA0003196960400000021
Figure FDA0003196960400000021
 其中，f表示当日车辆燃油价格；Among them, f represents the vehicle fuel price of the day; 所述的安全度csah是指铲车运行线路之间的相似程度，具体计算方法如下：The safety degree c sah refers to the degree of similarity between the operating lines of the forklift, and the specific calculation method is as follows:
Figure FDA0003196960400000022
Figure FDA0003196960400000022
 其中，abs(l(C,pi)-l(C,pj))表示取l(C,pi)-l(C,pj)的绝对值；最优方案是指综合成本最小，进一步转化为求解综合属性相对距离值最大方案；Among them, abs(l(C, p i )-l(C, p j )) means to take the absolute value of l(C, p i )-l(C, p j ); the optimal solution refers to the minimum comprehensive cost, It is further transformed into a scheme for solving the maximum relative distance value of comprehensive attributes; (D)、对危险品存储方案进行综合比选，确定最优方案；(D) Carry out a comprehensive comparison and selection of dangerous goods storage plans to determine the optimal plan; 包括以下几个步骤：It includes the following steps: (D1)、假定油价的取值为f＝(f1,f2,…,f5)，仓租费的取值为b＝(b1,b2,…,b5)，通过实际调研确定仓储方案集的犹豫决策集：(D1), assuming that the value of oil price is f=(f 1 , f 2 ,…,f 5 ), and the value of warehouse rental fee is b=(b 1 ,b 2 ,…,b 5 ), through actual investigation Determine the set of hesitant decisions for the storage solution set:
Figure FDA0003196960400000023
Figure FDA0003196960400000023
 其中，m表示方案总量，ctm代表第m个方案的时间成本，{cspm1,…,cspm5}代表第m个方案的空间成本的取值，{cem1,…,cem5}代表第m个方案的经济成本的取值，csam代表第m个方案的安全度；Among them, m represents the total number of solutions, c tm represents the time cost of the mth solution, {c spm1 ,...,c spm5 } represents the value of the space cost of the mth solution, {c em1 ,...,c em5 } represents The value of the economic cost of the mth scheme, c sam represents the security of the mth scheme; (D2)、确定犹豫决策集中的负理想点(D2), determine the negative ideal point in the hesitant decision set 设理想点为Cmax＝(c′t,(c′sp1,c′sp2,…,c′sp5),(c′e1,c′e2,…,c′e5)，c′sa)，各分量由下式确定：Let the ideal point be C max =(c′ t ,(c′ sp1 ,c′ sp2 ,…,c′ sp5 ),(c′ e1 ,c′ e2 ,…,c′ e5 ), c′ sa ), each The components are determined by:
Figure FDA0003196960400000031
Figure FDA0003196960400000031
 其中，k＝1,2,3,4,5，q＝1,2,3,4,5；Among them, k=1,2,3,4,5, q=1,2,3,4,5; (D3)、计算各决策方案与负理想点距离；假定方案h中的负理想点距离为Dh＝[dth{dsph1,dsph2,…,dsph5}{deh1,deh2,…,deh5}dsah]，各分量由下式确定：(D3), calculate the distance between each decision-making scheme and the negative ideal point; assume that the distance of the negative ideal point in the scheme h is D h =[d th {d sph1 ,d sph2 ,...,d sph5 }{d eh1 ,d eh2 ,... ,d eh5 }d sah ], each component is determined by the following formula:
Figure FDA0003196960400000032
Figure FDA0003196960400000032
 其中，k＝1,2,3,4,5，q＝1,2,3,4,5；Among them, k=1,2,3,4,5, q=1,2,3,4,5; 同样的方式确定m个方案的相对距离矩阵：Determine the relative distance matrix of m options in the same way:
Figure FDA0003196960400000033
Figure FDA0003196960400000033
 (D4)、根据犹豫距离集的比较方法对m个方案的相对距离集进行排序，将综合属性相对距离值最大的确定为最优方案。(D4), sort the relative distance sets of the m schemes according to the comparison method of the hesitant distance sets, and determine the optimal scheme with the largest relative distance value of the comprehensive attribute. 2.根据权利要求1所述的基于犹豫决策集的危险品仓库隔离门选择方法，其特征在于，方案参数ah(2)，ah(4)，…，ah(k)，Δ(h)的确定方法如下：2. The method for selecting an isolation door for a dangerous goods warehouse based on a hesitant decision set according to claim 1, wherein the scheme parameters a h (2), a h (4), ..., a h (k), Δ ( h) is determined as follows: 首先，计算总存储量K所对应的最多仓库门数T，方法是：计算中间值B＝int(0.25K-1)，若B为偶数，则T＝B，若B为奇数，则T＝B-1，其中int(X)表示对X向下取整数；First, calculate the maximum number of warehouse doors T corresponding to the total storage capacity K. The method is: calculate the intermediate value B=int(0.25K-1), if B is an even number, then T=B, if B is an odd number, then T= B-1, where int(X) means rounding down X; 然后，计算方案一的相关参数；计算最多仓库门数T所对应的仓库数量a1(T)＝int[K/m(T)]，计算扣除T门仓库存储容量后的所需存储量S1(T)＝K-a1(T)*m(T)，比较S1(T)与T-2门仓库容量m(T-2)的大小，若S1(T)≥m(T-2)，则计算所需T-2门仓库的数量a1(T-2)＝int[S1(T)/m(T-2)]，计算扣除T-2门仓库存储量后的所需存储量S1(T-2)＝S1(T)-a1(T-2)*m(T-2)；若S1(T)＜m(T-2)，则依次比较S1(T)与m(T-4)、m(T-6)、…、m(2)，并依次确定a1(T-4)、a1(T-6)、…、a1(2)和剩余存储量S1(2)；此时，方案一的参数为a1(2)，a1(4)，…，a1(T)，Δ(1)，其中Δ(1)＝12-S1(2)；Then, calculate the relevant parameters of scheme 1; calculate the warehouse quantity a 1 (T)=int[K/m(T)] corresponding to the maximum number of warehouse doors T, and calculate the required storage amount S after deducting the storage capacity of the T door warehouse 1 (T)=Ka 1 (T)*m(T), compare the size of S 1 (T) and T-2 door warehouse capacity m(T-2), if S 1 (T)≥m(T-2 ), then calculate the required number of T-2 door warehouses a 1 (T-2)=int[S 1 (T)/m(T-2)], calculate the required amount after deducting the storage capacity of T-2 door warehouse Storage amount S 1 (T-2)=S 1 (T)-a 1 (T-2)*m(T-2); if S 1 (T)<m(T-2), compare S 1 in turn (T) and m(T-4), m(T-6), ..., m(2), and determine a 1 (T-4), a 1 (T-6), ..., a 1 (2 ) and the remaining storage amount S 1 (2); at this time, the parameters of the scheme 1 are a 1 (2), a 1 (4), ..., a 1 (T), Δ(1), where Δ(1)= 12-S 1 (2); 最后，依次确定方案h＝2,3,4…的相关参数；若方案h-1中的最多门仓库的数量大于2个，则将最多门仓库的数量减少一个，并作为方案h中最多门仓库的数量；若方案h-1中最多门仓库数量为1个，则将比该最多门数少2门的仓库作为方案h的最多门仓库，并计算该仓库数量；采用上一步所述方法，依次确定比该方案最多门仓库少2门、4门、6门，…的仓库数量及剩余存储量Sh(2)，并确定方案h的相关参数；Finally, the relevant parameters of the scheme h=2, 3, 4... The number of warehouses; if the maximum number of warehouses in scheme h-1 is 1, the warehouse with 2 doors less than the maximum number of doors will be used as the maximum number of warehouses in scheme h, and the number of warehouses will be calculated; the method described in the previous step will be used. , in turn determine the number of warehouses with 2, 4, 6, and . 重复执行上述步骤，直到方案中只有2门仓库组成为止。Repeat the above steps until there are only 2 warehouses in the scheme.
CN201811385382.9A 2018-11-20 2018-11-20 A method of selecting isolation doors for dangerous goods warehouses based on hesitant decision sets Expired - Fee Related CN109583636B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811385382.9A CN109583636B (en) 2018-11-20 2018-11-20 A method of selecting isolation doors for dangerous goods warehouses based on hesitant decision sets

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811385382.9A CN109583636B (en) 2018-11-20 2018-11-20 A method of selecting isolation doors for dangerous goods warehouses based on hesitant decision sets

Publications (2)

Publication Number Publication Date
CN109583636A CN109583636A (en) 2019-04-05
CN109583636B true CN109583636B (en) 2021-10-08

Family

ID=65923495

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811385382.9A Expired - Fee Related CN109583636B (en) 2018-11-20 2018-11-20 A method of selecting isolation doors for dangerous goods warehouses based on hesitant decision sets

Country Status (1)

Country Link
CN (1) CN109583636B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103971220A (en) * 2014-05-21 2014-08-06 上海第二工业大学 Intelligent hazardous chemical substance warehouse management system
CN104268736A (en) * 2014-10-16 2015-01-07 四川金投金融电子服务有限公司 Goods storage management system
CN106096885A (en) * 2016-06-12 2016-11-09 石化盈科信息技术有限责任公司 Harmful influence logistics monitoring and managing method based on technology of Internet of things and supervisory systems
CN106096890A (en) * 2016-06-18 2016-11-09 任明和 The method realizing storage standardized work scheme intelligentized design
CN106971235A (en) * 2017-02-16 2017-07-21 上海大学 A kind of flexible job shop Optimization Scheduling in batches that there is intermediate storage constraint
CN206487322U (en) * 2016-12-28 2017-09-12 安徽扬子弘福安防有限公司 A kind of mechanical security protection zone isolation door
CN107274013A (en) * 2017-06-08 2017-10-20 北京惠赢天下网络技术有限公司 Direct kinds of goods allocator, system and server based on automatic control logistics

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106779261A (en) * 2015-11-19 2017-05-31 蔡诗伟 A kind of urgent shielding system of the intelligent security guard for dangerous material
JP6746456B2 (en) * 2016-09-30 2020-08-26 シャープ株式会社 Bulletin board management system, bulletin board server, and housing complex management device
US10039400B2 (en) * 2016-12-23 2018-08-07 Innovative World Solutions, LLC Integrated package and mail delivery security system

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103971220A (en) * 2014-05-21 2014-08-06 上海第二工业大学 Intelligent hazardous chemical substance warehouse management system
CN104268736A (en) * 2014-10-16 2015-01-07 四川金投金融电子服务有限公司 Goods storage management system
CN106096885A (en) * 2016-06-12 2016-11-09 石化盈科信息技术有限责任公司 Harmful influence logistics monitoring and managing method based on technology of Internet of things and supervisory systems
CN106096890A (en) * 2016-06-18 2016-11-09 任明和 The method realizing storage standardized work scheme intelligentized design
CN206487322U (en) * 2016-12-28 2017-09-12 安徽扬子弘福安防有限公司 A kind of mechanical security protection zone isolation door
CN106971235A (en) * 2017-02-16 2017-07-21 上海大学 A kind of flexible job shop Optimization Scheduling in batches that there is intermediate storage constraint
CN107274013A (en) * 2017-06-08 2017-10-20 北京惠赢天下网络技术有限公司 Direct kinds of goods allocator, system and server based on automatic control logistics

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Multiple一attribute decision making methods for plant layout design problem;Taho Yang;《Robotics and Computer-Integrated Manufacturing》;20070228;第23卷(第1期);第126-137页 *
基于区间直觉模糊数相关系数的多准则决策模型;袁宇等;《管理科学学报》;20140430;第17卷(第4期);第11-18页 *

Also Published As

Publication number Publication date
CN109583636A (en) 2019-04-05

Similar Documents

Publication Publication Date Title
Zhou et al. Multi-objective optimization of material delivery for mixed model assembly lines with energy consideration
CN116127857B (en) Classification-oriented household garbage collection and transportation path multi-objective optimization method and system
CN111115076A (en) Composite operation three-dimensional path planning method for dense warehousing system of primary and secondary shuttle vehicles
CN109583636B (en) A method of selecting isolation doors for dangerous goods warehouses based on hesitant decision sets
CN109598370B (en) A method for selecting isolation doors for intercommunication dangerous goods warehouses
CN112836846A (en) Multi-depot and multi-direction combined transportation scheduling double-layer optimization algorithm for cigarette delivery
CN112183838A (en) A method for optimal solution of intelligent unmanned vehicle path planning problem based on multi-constraint modified C-W algorithm
Lin et al. Working cycle identification–based braking control strategy and its application for hydraulic hybrid loader
Xu et al. Research on open-pit mine vehicle scheduling problem with approximate dynamic programming
CN112418552B (en) Work method for optimally scheduling manifest and carrier vehicle based on scheduling requirements
Midgley et al. Control of a hydraulic regenerative braking system for a heavy goods vehicle
CN110633924A (en) Method and system for inter-warehouse storage of commodities
Li et al. Multiobjective scheduling for cooperative operation of multiple gantry cranes in railway area of container terminal
Tang et al. Energy management strategy for hydraulic hybrid system with compound accumulator based on dynamic programming
Zhang et al. The application model of the isolated door in interconnected hazards warehouse
Xiang et al. An Improved Multi-Objective Hybrid Genetic-Simulated Annealing Algorithm for AGV Scheduling under Composite OperationMode.
Wang et al. A pull order fulfillment method combining JIT with group technology for online supermarket
Wang et al. Layout optimisation of fishbone robotic mobile fulfilment system
Haibin et al. RESEARCH ON LOCATION OPTIMIZATION OF AUTOMATED WAREHOUSE UNDER THE BACKGROUND OF INTELLIGENT MANUFACTURING.
Srisomboon et al. A sequence change algorithm in vehicle platooning for longer driving range
CN111445100A (en) Vehicle and cargo matching method based on adaptive time window under limited capacity
Tao et al. Solving VRP using ant colony optimization algorithm
YU et al. Research on Optimization of Cold Chain Logistics Distribution Path Based on P Company
Hsayri et al. A novel multi stage optimization algorithm for a 3D-BPP resolution
CN117689163B (en) Railway special line operation regulation and control method based on graph theory

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

Granted publication date: 20211008

CF01 Termination of patent right due to non-payment of annual fee