CN109598370B - Method for selecting intercommunicating dangerous goods warehouse isolation door - Google Patents
Method for selecting intercommunicating dangerous goods warehouse isolation door Download PDFInfo
- Publication number
- CN109598370B CN109598370B CN201811385396.0A CN201811385396A CN109598370B CN 109598370 B CN109598370 B CN 109598370B CN 201811385396 A CN201811385396 A CN 201811385396A CN 109598370 B CN109598370 B CN 109598370B
- Authority
- CN
- China
- Prior art keywords
- scheme
- warehouse
- 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.)
- Active
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
Abstract
The invention belongs to the technical field of dangerous goods warehouse management, and provides a selection method of an intercommunicating dangerous goods warehouse isolation door, aiming at the current situation that the supply and demand of a dangerous goods storage warehouse are not in short supply, the invention researches a use decision method of the intercommunicating dangerous goods warehouse isolation door under the condition that the weight information of a preferred index is not given on the basis of an intercommunicating warehouse concept, and the method 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 comprehensively selecting the dangerous goods storage scheme to determine an optimal scheme. 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.
Description
Technical Field
The invention provides a selection method of an intercommunicated dangerous goods warehouse isolation door based on Topsis-hypercube segmentation, which aims at the current situation of short supply and short supply of a dangerous goods storage warehouse and belongs to the technical field of dangerous goods warehouse management.
Background
According to survey, the supply and demand conditions of the national dangerous goods storage market are generally expressed as supply and demand shortage, and some urban dangerous goods storages can not meet the market demand far away. 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 an intelligent selection method of an intercommunicated dangerous goods warehouse isolation door, aiming at improving the use efficiency of a dangerous goods warehouse and aiming at the situation of structural transformation 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 method for selecting an intercommunicating dangerous goods warehouse isolation door, in particular to a method for selecting an intercommunicating dangerous goods warehouse isolation door based on Topsis-hypercube segmentation, which 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 runs clockwise in the warehouse according to a specified path; two forklifts cannot be present in the same room at the same time;
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 bin banks in the scheme h, Δ (h) represents the number of the rest bin positions in the scheme h, and Δ (h) is smaller than 12 bin positions; 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 i 1,2,3,4 … are determined in turn. If the number of the most door warehouse in the scheme i-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 i; and if the maximum number of the door warehouses in the scheme i-1 is 1, taking the warehouse with 2 doors less than the maximum number of the doors as the maximum door warehouse of the scheme i, and calculating the number of the warehouses. And sequentially determining the number of the warehouses which are 2,4 and 6 less than the warehouse with the largest door of the scheme, the … and the residual storage amount S2(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 attribute 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);
D. comprehensively selecting the dangerous goods storage scheme to determine an optimal scheme; 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.
The step D comprises the following steps:
(D1) determining weight vectors using hypercube segmentation: if there are 4 decision indexes of time cost, space cost, economic cost and safety degree, the weight vector W is equal to (W)1,w2,w3,w4) Is a 4-dimensional hypercube V ═ 0,1]×[0,1]×[0,1]×[0,1]The random elements are used for equally dividing each weight component q to obtain q-1 equally divided points and two endpoint values; constitution 4q+1A point vector; note 4q+1The set formed by the point vectors is P, and the weight vectors with the sum of all weight components in the set P not being 1 are subjected to normalization processing;
(D2) and obtaining a decision matrix C of the warehousing scheme set through actual research and calculation, wherein,
(D3) calculating a negative ideal point of the warehousing scheme set:
(D4) calculating the distance DI (i) of each decision scheme from the negative ideal point:
(D5) and selecting the scheme set. First, calculate theComprehensive attribute relative distance value D of h schemes under k1 th weight vectorhk1＝w1(k1)d1(h)+w2(k1)d2(h)+w3(k1)d3(h)+w4(k1)d4(h) Wherein d isj1(h) A j1 th component representing the distance of the decision scheme h from the negative ideal point, j1 being 1,2,3, 4; w is ae1(k1) An e1 th component representing the k1 th weight vector, e1 being 1,2,3, 4; comparing the relative distance values of the comprehensive attributes of all the schemes under the k1 th weight vector, and counting the times that each scheme is the scheme with the maximum relative distance value of the comprehensive attributes under each weight vector; k1 has a value in the range of 4q+1。
(D6) And determining the scheme with the most times as the optimal scheme according to the comparison result.
The invention has the beneficial effects that: the use decision method of the intercommunicated dangerous goods warehouse isolation door can improve the use efficiency of the dangerous goods warehouse and can relieve the problem of short supply and short demand of the dangerous goods warehouse to a certain extent.
Drawings
FIG. 1(a) shows a comparison of the integrated distance values between case 1 and case 3.
FIG. 1(b) shows a comparison of the integrated distance values between case 2 and case 4.
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 an intelligent selection method for communicating hazardous material warehouse isolation doors, 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 is determined using hypercube segmentation. Assuming that there are Q decision metrics, the weight vector W is equal to (W)1,w2,…,wQ) Is Q-dimensional hypercube V ═ 0,1]×[0,1]×…×[0,1]And (3) equally dividing each weight component q by the random elements to obtain q-1 equally divided points and two endpoint values. Form Qq+1A point vector; note Qq+1The set of point vectors is P, and the weight vectors in the set P, the sum of which is not 1, are normalized.
(D2) Obtaining a decision matrix C of the warehousing scheme set through actual research and calculation, wherein
(D3) Calculating a negative ideal point C of the warehousing scheme setmax＝(0.1762,1680,0.9798,1)。
(D4) Calculating the distance between each decision scheme and the negative ideal point, and obtaining the distance between each decision scheme and the negative ideal point as follows:
(D5) and selecting the scheme set. Calculating the relative distance value of the comprehensive attribute under different weight vectors corresponding to each scheme
And then counts the number of weight vectors that satisfy it as the optimal solution.
(D6) And determining the maximum relative distance value of the comprehensive attribute as an optimal scheme according to the comparison result. For each scheme, the relative distance value of the comprehensive attribute under different weight vectors is obtained, and the details are shown in fig. 1(a) and fig. 1 (b). It can be seen that the comprehensive distance values of the four schemes are distributed in [0,1.2], and the number of optimal weight vectors supporting each scheme is compared to obtain a third scheme, which is an optimal scheme.
The above embodiments are only for illustrating the technical idea of the present invention, and the protection scope of the present invention is not limited thereby, and any modifications made on the basis of the technical scheme according to the technical idea of the present invention fall within the protection scope of the present invention.
Claims (2)
1. A method for selecting an isolation door of an intercommunicated dangerous goods warehouse 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 runs clockwise in the warehouse according to a specified path; two forklifts cannot be present in the same room at the same time;
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 attribute 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);
D. comprehensively selecting the dangerous goods storage scheme to determine an optimal scheme; 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;
the step D comprises the following steps:
(D1) determining weight vectors using hypercube segmentation: if there are 4 decision indexes of time cost, space cost, economic cost and safety degree, the weight vector W is equal to (W)1,w2,w3,w4) Is a 4-dimensional hypercube V ═ 0,1]×[0,1]×…×[0,1]The random elements are used for equally dividing each weight component q to obtain q-1 equally divided points and two endpoint values; constitution 4q+1A point vector; note 4q+1The set formed by the point vectors is P, and the weight vectors with the sum of all weight components in the set P not being 1 are subjected to normalization processing;
(D2) and obtaining a decision matrix C of the warehousing scheme set through actual research and calculation, wherein,
(D3) calculating a negative ideal point of the warehousing scheme set:
(D4) calculating the distance DI (h) between each decision scheme and the negative ideal point:
(D5) selecting a scheme set; firstly, the relative distance value D of the comprehensive property of the h scheme under the k1 weight vectors is calculatedhk1＝w1(k1)d1(h)+w2(k1)d2(h)+w3(k1)d3(h)+w4(k1)d4(h) Wherein d isj1(h) A j1 th component representing the distance of the decision scheme h from the negative ideal point, j1 being 1,2,3, 4; w is ae1(k1) An e1 th component representing the k1 th weight vector, e1 being 1,2,3, 4; comparing the comprehensive attribute relative distance values of all the schemes under the k1 th weight vector, and counting the relative distance values of all the schemes under the weight vectorsIs the number of times of the scheme with the maximum relative distance value of the comprehensive attribute; k1 has a value in the range of 4q+1；
(D6) And determining the scheme with the most times as the optimal scheme according to the comparison result.
2. Selection method according to claim 1,
scheme parameter a in step Bh(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; adopting the method in the previous stepSequentially determining the number of 2,4 and 6 less warehouses and the residual storage amount S of … less than the warehouse with the maximum doors of the schemeh(2) Determining relevant parameters of the scheme h;
the steps are repeatedly executed until only 2 storehouses are formed in the scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385396.0A CN109598370B (en) | 2018-11-20 | 2018-11-20 | Method for selecting intercommunicating dangerous goods warehouse isolation door |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811385396.0A CN109598370B (en) | 2018-11-20 | 2018-11-20 | Method for selecting intercommunicating dangerous goods warehouse isolation door |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109598370A CN109598370A (en) | 2019-04-09 |
| CN109598370B true CN109598370B (en) | 2021-10-08 |
Family
ID=65960241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811385396.0A Active CN109598370B (en) | 2018-11-20 | 2018-11-20 | Method for selecting intercommunicating dangerous goods warehouse isolation door |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109598370B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110223022A (en) * | 2019-06-12 | 2019-09-10 | 交通运输部天津水运工程科学研究所 | Dangerous Goods Container stores up method for early warning and system |
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 CN201811385396.0A patent/CN109598370B/en active Active
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 (1)
| Title |
|---|
| Multiple一attribute decision making methods for plant layout design problem;Taho Yang;《Robotics and Computer-Integrated Manufacturing》;20070228;第23卷(第1期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109598370A (en) | 2019-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110909930B (en) | Goods position distribution method of mobile goods shelf storage system for refrigeration house | |
| CN110189077A (en) | A kind of multistage vehicle and goods matching method considering Three-dimensional Packing constraint | |
| CN109598370B (en) | Method for selecting intercommunicating dangerous goods warehouse isolation door | |
| CN107239844A (en) | A kind of petroleum transportation vehicle oil consumption Forecasting Methodology based on Hadoop | |
| CN106600077A (en) | Fuzzy TOPSIS evaluation method | |
| CN109886490A (en) | A kind of intermodal matching optimization method of combined vehicle | |
| CN106096825A (en) | A kind of electrical power services channel analysis method and system | |
| Ma | Generalised grey target decision method for mixed attributes with index weights containing uncertain numbers | |
| CN109583636B (en) | Dangerous goods warehouse isolation door selection method based on hesitation decision set | |
| CN110490476A (en) | A kind of logistics vehicles planing method for estimating driving path | |
| Yang et al. | Research on design of cross-aisles shuttle-based storage/retrieval system based on improved particle swarm optimization | |
| CN110705806A (en) | Electric quantity prediction method based on capacity utilization hours | |
| CN111311096A (en) | QFD and KANO model-based multi-yield quality optimization method | |
| CN110633924B (en) | Method and system for inter-warehouse storage of commodities | |
| CN103177123A (en) | Method for improving database retrieval information relevancy | |
| Fan et al. | Research on the optimization of vehicle distribution routes in logistics enterprises | |
| Cao | Research on green port efficiency evaluation based on DEA and topsis | |
| Zhang et al. | The application model of the isolated door in interconnected hazards warehouse | |
| CN117196150B (en) | Intelligent park center platform system based on digital twinning | |
| Chen et al. | Research on Urban Logistics Sharing Distribution Method Based on Improved Genetic Algorithm | |
| CN102583194A (en) | Stacking machine providing transport information according to weight of cargos and relevant method thereof | |
| CN110610265A (en) | Method for making decision on operations of packaging dangerous goods in roundabout warehouse under safe red line | |
| Expósito-Izquierdo et al. | Optimization model and heuristic approach for blocks retrieval processes in warehouses | |
| Wang | A GM (1, N) Approach to the Pricing of Auto Production in China | |
| Jain et al. | Understanding Individual‟ s Behaviour towards Two-Wheeler Electric Vehicles |
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 |