CN109583636B - Dangerous goods warehouse isolation door selection method based on hesitation decision set - Google Patents
Dangerous goods warehouse isolation door selection method based on hesitation decision set Download PDFInfo
- 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
- door
- dangerous goods
- 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
Links
- 238000002955 isolation Methods 0.000 title claims abstract description 25
- 238000010187 selection method Methods 0.000 title claims abstract description 5
- 238000003860 storage Methods 0.000 claims abstract description 58
- 238000000034 method Methods 0.000 claims abstract description 20
- 238000004364 calculation method Methods 0.000 claims description 4
- 239000011159 matrix material Substances 0.000 claims description 3
- 239000000446 fuel Substances 0.000 claims description 2
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 239000000383 hazardous chemical Substances 0.000 claims 1
- 239000002283 diesel fuel Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 231100001261 hazardous Toxicity 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
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)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Warehouses Or Storage Devices (AREA)
Abstract
The invention provides a dangerous goods warehouse isolation door selection method based on a hesitation decision set, which aims at the current situation that supply and demand of a dangerous goods storage warehouse are insufficient, takes an intercommunicated warehouse as an object and comprises the following steps: A. establishing the use principle of the isolation door and the forklift; B. designing a plurality of dangerous goods storage schemes according to the total storage capacity and the service condition of the isolation door; C. determining an optimal scheme decision index; D. and adopting a hesitation distance set to carry out comprehensive comparison and selection on the dangerous goods storage scheme, and determining an optimal scheme. By using the method, the use efficiency of the communicated dangerous goods warehouse can be effectively improved, and the pressure caused by insufficient capacity of the dangerous goods storage warehouse can be relieved. 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.
Description
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:
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:
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:
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:
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:
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:
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:
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:
(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
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
(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
(D4) Comparison method pair by hesitation distance set (D)2,D4)，(D2,D3)，(D1,D3) Comparing to obtain
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. A dangerous goods warehouse isolation door selection method based on a hesitation decision set is characterized by comprising 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:
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;
(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:
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 Cj'Is 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:
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:
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:
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:
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:
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:
(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.
2. The method of selecting a hazardous materials warehouse isolation door based on hesitation decision set according to claim 1, wherein the scheme parameter ah(2)，ah(4)，…，ah(k) The determination of Δ (h) is 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, calculating the related parameters of the first scheme; 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) (ii) a In this case, the parameter of the first scheme is a1(2)，a1(4)，…，a1(T), Δ (1), wherein Δ (1) ═ 12-S1(2)；
Finally, determining the relevant parameters of the scheme h-2, 3 and 4 … 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 the door warehouses in the scheme h-1 is 1, taking the warehouse which is 2 doors less than the maximum number of the doors as the maximum door warehouse of the scheme h, and calculating the number of the warehouses; 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 lessh(2) And determining a scheme hThe relevant parameters of (1);
the steps are repeatedly executed until only 2 storehouses are formed in the scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385382.9A CN109583636B (en) | 2018-11-20 | 2018-11-20 | Dangerous goods warehouse isolation door selection method based on hesitation decision set |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385382.9A CN109583636B (en) | 2018-11-20 | 2018-11-20 | Dangerous goods warehouse isolation door selection method based on hesitation decision set |
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 | Dangerous goods warehouse isolation door selection method based on hesitation decision set |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109583636B (en) |
Citations (7)
| 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 |
| CN106096890A (en) * | 2016-06-18 | 2016-11-09 | 任明和 | The method realizing storage standardized work scheme intelligentized design |
| 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 |
| 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)
| 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 |
-
2018
- 2018-11-20 CN CN201811385382.9A patent/CN109583636B/en not_active Expired - Fee Related
Patent Citations (7)
| 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)
| 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 |
|---|---|---|
| CN107480922B (en) | Method for establishing goods position distribution scheduling model under two-end type same-rail double-vehicle running mode | |
| De Jager et al. | Optimal control of hybrid vehicles | |
| CN110189077A (en) | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint | |
| CN105858044B (en) | The warehousing system Optimization Scheduling that a kind of shuttle is combined with lift | |
| CN106882079B (en) | A kind of electric car self-adapting cruise control method of driving braking optimization switching | |
| Kim et al. | Development of supervisory control strategy for optimized fuel consumption of the compound hybrid excavator | |
| Zhou et al. | A Rule‐Based Energy Management Strategy Based on Dynamic Programming for Hydraulic Hybrid Vehicles | |
| Huang et al. | Using 3D road geometry to optimize heavy truck fuel efficiency | |
| CN109583636B (en) | Dangerous goods warehouse isolation door selection method based on hesitation decision set | |
| CN113361073A (en) | Inventory path joint optimization method based on improved Lagrange relaxation algorithm | |
| CN109598370B (en) | Method for selecting intercommunicating dangerous goods warehouse isolation door | |
| CN117522065A (en) | Network freight matching method based on multi-objective decision | |
| CN112183838A (en) | Method for optimizing and solving intelligent unmanned vehicle path planning problem based on multi-constraint correction C-W algorithm | |
| CN106080192B (en) | Automobile electric gasoline throttle control method | |
| Lin et al. | Working cycle identification–based braking control strategy and its application for hydraulic hybrid loader | |
| CN110490476A (en) | A kind of logistics vehicles planing method for estimating driving path | |
| CN110633924B (en) | Method and system for inter-warehouse storage of commodities | |
| CN110516842A (en) | A kind of the two stages coordination and optimized configuring method of Large Steel Roll Sushi stream | |
| Midgley et al. | Control of a hydraulic regenerative braking system for a heavy goods vehicle | |
| CN100495434C (en) | Bulk goods ship stowage method for iron and steel product | |
| CN116502985A (en) | Efficient waybill matching method for reducing empty rate in scenerization | |
| CN116307994A (en) | Port collection and distribution planning method based on big data optimization technology | |
| Liu et al. | An evaluation method for automotive technical and comprehensive performance | |
| Сазонець et al. | ECOLOGICAL OPTIMIZATION OF CARGO TRANSPORTATION OF AN ENTERPRISE USING INFORMATION SYSTEMS | |
| Liu et al. | Road roughness identification and shift control study for a heavy-duty powertrain |
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: 20211008 |