CN108550007A - A kind of slotting optimization method and system of pharmacy corporation automatic stereowarehouse - Google Patents
A kind of slotting optimization method and system of pharmacy corporation automatic stereowarehouse Download PDFInfo
- Publication number
- CN108550007A CN108550007A CN201810299910.2A CN201810299910A CN108550007A CN 108550007 A CN108550007 A CN 108550007A CN 201810299910 A CN201810299910 A CN 201810299910A CN 108550007 A CN108550007 A CN 108550007A
- Authority
- CN
- China
- Prior art keywords
- stacker
- medicines
- category
- drug
- automated
- 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.)
- Granted
Links
- 238000005457 optimization Methods 0.000 title claims abstract description 125
- 238000000034 method Methods 0.000 title claims abstract description 55
- 239000003814 drug Substances 0.000 claims abstract description 234
- 229940079593 drug Drugs 0.000 claims abstract description 218
- 238000013178 mathematical model Methods 0.000 claims abstract description 54
- 238000003860 storage Methods 0.000 claims abstract description 33
- 230000033001 locomotion Effects 0.000 claims abstract description 30
- 238000004422 calculation algorithm Methods 0.000 claims description 19
- 230000008569 process Effects 0.000 claims description 18
- 230000035772 mutation Effects 0.000 claims description 17
- 230000008859 change Effects 0.000 claims description 13
- 230000006870 function Effects 0.000 claims description 12
- 238000004519 manufacturing process Methods 0.000 claims description 12
- 239000011159 matrix material Substances 0.000 claims description 10
- 230000001133 acceleration Effects 0.000 claims description 9
- 210000000349 chromosome Anatomy 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 6
- 241001589086 Bellapiscis medius Species 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 claims description 4
- 229940126678 chinese medicines Drugs 0.000 claims description 4
- 238000009826 distribution Methods 0.000 abstract description 7
- 230000000694 effects Effects 0.000 abstract description 2
- 230000007306 turnover Effects 0.000 description 5
- 108090000623 proteins and genes Proteins 0.000 description 4
- 238000004088 simulation Methods 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000002068 genetic effect Effects 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 208000035473 Communicable disease Diseases 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 238000012097 association analysis method Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 201000010099 disease Diseases 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010921 in-depth analysis Methods 0.000 description 1
- 206010022000 influenza Diseases 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 239000002994 raw material Substances 0.000 description 1
- 230000001932 seasonal effect Effects 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
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/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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2111/00—Details relating to CAD techniques
- G06F2111/10—Numerical modelling
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Geometry (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- General Engineering & Computer Science (AREA)
- Evolutionary Computation (AREA)
- Computer Hardware Design (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Entrepreneurship & Innovation (AREA)
- Mathematical Optimization (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Game Theory and Decision Science (AREA)
- Medical Treatment And Welfare Office Work (AREA)
Abstract
Description
技术领域technical field
本发明主要涉及物流仓储技术领域,特指一种制药企业自动化立体仓库的货位优化方法及系统。The invention mainly relates to the technical field of logistics storage, in particular to a method and a system for optimizing the location of an automated three-dimensional warehouse of a pharmaceutical enterprise.
背景技术Background technique
随着医药行业因供应链整体水平的不断提高和行业标准(GMP/GSP)的不断加强,医药物流成为物流自动化的重点领域。自动化立体仓库作为现代物流的重要组成部分,采用机械化作业和信息化调度,具有节约劳动力、提高仓储管理水平、降低物流费用等优点,是社会广泛认可的先进仓储模式,在企业仓储中得到普遍应用。而制药企业的自动化立体仓库通过空中输送线与生产车间连接,实现企业内部物流从原料到成品的全程自动化,解决商品完成包装下线到装车前的缓存需求。有效地管理和控制仓储成本是企业获取利润的最有效的手段之一。With the continuous improvement of the overall level of the supply chain in the pharmaceutical industry and the continuous strengthening of industry standards (GMP/GSP), pharmaceutical logistics has become a key area of logistics automation. As an important part of modern logistics, automated three-dimensional warehouse adopts mechanized operation and information scheduling, which has the advantages of saving labor, improving storage management level, and reducing logistics costs. It is an advanced storage mode widely recognized by the society and is widely used in enterprise storage. . The automated three-dimensional warehouses of pharmaceutical companies are connected to the production workshops through aerial conveying lines to realize the full automation of the company's internal logistics from raw materials to finished products, and to solve the buffering needs of products from packaging to off-line to loading. Effective management and control of warehousing costs is one of the most effective means for enterprises to obtain profits.
随着电子标签辅助系统和无线电通讯传输技术的应用等,拣货速度和效率不断提高,大部分的仓储成本更多的消耗在仓库内货物移动上。货物在仓库内移动时间的长短成为提高仓库作业效率的关键因素之一。货物的合理布局能有效的降低堆垛机等运输设备的搬运距离,降低货物在存储过程及搬运过程中的损耗。然而,由于货物不断的进出库,导致有些货位出现空位;由于一些季节性疾病如流感或者突发性传染病等的发生,导致货物的出入库频率发生变化;由于新增一些货物或者一些货物退出市场,导致仓库储位出现拥挤或空缺以及货物没有储位摆放。货位优化就是基于变化因素而动态的再配置仓库中货物的货位,以保证货位布局处在较为合理的状态。因此,定期对仓库进行货位优化,对提高仓储的作业效率、降低仓储操作成本具有重要意义。With the application of electronic label auxiliary system and radio communication transmission technology, the speed and efficiency of picking have been continuously improved, and most of the storage cost is more consumed in the movement of goods in the warehouse. The length of time for goods to move in the warehouse has become one of the key factors to improve the efficiency of warehouse operations. The reasonable layout of goods can effectively reduce the transport distance of transport equipment such as stacker cranes, and reduce the loss of goods during storage and handling. However, due to the continuous entry and exit of goods, some cargo spaces are empty; due to the occurrence of some seasonal diseases such as influenza or sudden infectious diseases, the frequency of goods entering and leaving the warehouse has changed; due to the addition of some goods or some Goods are withdrawn from the market, resulting in crowded or vacant warehouse storage spaces and no storage space for goods. Location optimization is to dynamically reconfigure the location of goods in the warehouse based on changing factors to ensure that the location layout is in a more reasonable state. Therefore, it is of great significance to optimize the location of the warehouse on a regular basis to improve the efficiency of warehousing and reduce the cost of warehousing operations.
货位优化的关键在于建立符合制药企业自动化立体仓库特点的优化模型,而优化模型的核心在于合理建立多个优化目标的数学模型,并以此设计对应的优化算法。多个优化目标的数学模型的建立基础依赖于对制药企业药品特殊性的分析、自动化立体仓库的特点以及货物相关数据的深入分析,尤其是对历史数据的分析利用。制药企业药品的单位重量比较轻,不需要考虑药品之间的重量差异。货位优化过程中,堆垛机的运行时间是影响作业效率的主要因素。而且,随着季节的变化,在不同的时期,制药企业仓库内货物的需求品种、需求数量和需求频率都会有较大变化。因此,结合制药企业药品的特殊性,考虑堆垛机在货位优化过程中运行速率的变化,合理的分析利用历史数据是设计准确的控制算法,实现自动化立体仓库货位优化的至关重要的前提。通常的货位优化过程,大都是根据货物的周转率和货架的稳定性,建立货位优化数学模型,再利用优化算法进行优化求解。但是货位优化过程中并没有考虑制药企业药品的特殊性,也没有考虑货位优化过程中堆垛机运行速度的变化,也没有考虑药品之间的关联程度。因此,对于这种货位优化方法,由于没有充分考虑优化对象的特殊性,也没有充分利用自动化立体仓库的历史数据,导致优化效果并不理想,影响仓储的作业效率和仓储的操作成本。The key to cargo location optimization is to establish an optimization model that conforms to the characteristics of the automated three-dimensional warehouse of pharmaceutical companies, and the core of the optimization model is to reasonably establish a mathematical model for multiple optimization objectives, and design the corresponding optimization algorithm based on this. The establishment of mathematical models for multiple optimization objectives relies on the analysis of the particularity of pharmaceuticals in pharmaceutical companies, the characteristics of automated warehouses, and the in-depth analysis of data related to goods, especially the analysis and utilization of historical data. The unit weight of drugs in pharmaceutical companies is relatively light, and there is no need to consider the weight difference between drugs. In the process of cargo location optimization, the running time of the stacker is the main factor affecting the operation efficiency. Moreover, as the seasons change, in different periods, the demanded varieties, demanded quantities and demanded frequency of the goods in the warehouses of pharmaceutical companies will change greatly. Therefore, in combination with the particularity of drugs in pharmaceutical companies, considering the change in the operating speed of the stacker during the optimization process of the storage space, reasonable analysis and utilization of historical data is crucial to design an accurate control algorithm and realize the optimization of storage space in the automated three-dimensional warehouse. premise. In the usual process of cargo space optimization, most of them are based on the turnover rate of the goods and the stability of the shelves to establish a mathematical model for cargo space optimization, and then use the optimization algorithm to optimize the solution. However, the particularity of pharmaceutical companies' drugs was not considered in the process of cargo space optimization, nor was the change in the running speed of the stacker during the process of cargo space optimization, nor was the degree of correlation between drugs considered. Therefore, for this kind of cargo location optimization method, because the particularity of the optimization object is not fully considered, and the historical data of the automated three-dimensional warehouse is not fully utilized, the optimization effect is not ideal, which affects the operational efficiency of the warehouse and the operating cost of the warehouse.
发明内容Contents of the invention
本发明提供的制药企业自动化立体仓库的货位优化方法及系统,解决了现有方法只考虑货物周转率和货架稳定性,不能很好地描述实际问题,造成优化结果不理想的问题。The cargo location optimization method and system of the automatic three-dimensional warehouse of pharmaceutical enterprises provided by the present invention solve the problem that the existing method only considers the turnover rate of cargo and shelf stability, and cannot describe the actual problem well, resulting in unsatisfactory optimization results.
为解决上述技术问题,本发明提出的制药企业自动化立体仓库的货位优化方法包括:In order to solve the above-mentioned technical problems, the cargo location optimization method of the automatic three-dimensional warehouse of pharmaceutical enterprises proposed by the present invention comprises:
本发明提出的制药企业自动化立体仓库的货位优化系统包括:The cargo location optimization system of the automatic three-dimensional warehouse of pharmaceutical enterprises proposed by the present invention comprises:
确立自动化立体仓库的货位优化目标;Establish the location optimization goal of the automated three-dimensional warehouse;
根据自动化立体仓库内药品的历史订单数据计算药品出入库频率;Calculate the frequency of drug entry and exit based on the historical order data of drugs in the automated three-dimensional warehouse;
对自动化立体仓库内的药品进行分类,并根据每类药品之间的关联程度,得到每类药品之间的关联因子;Classify the drugs in the automated three-dimensional warehouse, and obtain the correlation factor between each type of drugs according to the degree of correlation between each type of drugs;
根据堆垛机在货位优化过程中运动速度的变化,建立堆垛机运动数学模型;According to the change of the movement speed of the stacker in the process of cargo location optimization, the mathematical model of the movement of the stacker is established;
根据堆垛机运动数学模型、药品出入库频率和每类药品之间的关联因子,建立多目标货位优化数学模型;Based on the mathematical model of stacker movement, the frequency of drug entry and exit, and the correlation factors between each type of drug, a multi-objective cargo space optimization mathematical model is established;
对多目标货位优化数学模型进行求解,得到货位优化结果。Solve the multi-objective cargo location optimization mathematical model to obtain the cargo location optimization results.
进一步地,确立自动化立体仓库的货位优化目标具体为:Further, the goal of optimizing the location of the automated three-dimensional warehouse is established as follows:
确立自动化立体仓库内药品的出入库频率和药品的关联性为自动化立体仓库的货位优化目标。Establish the frequency of in-out and out-of-stock medicines in the automated three-dimensional warehouse and the relevance of the medicines as the goal of optimizing the location of the automated three-dimensional warehouse.
进一步地,根据自动化立体仓库内药品的历史订单数据计算药品出入库频率的计算公式为:Further, the calculation formula for calculating the frequency of medicines entering and leaving the warehouse based on the historical order data of medicines in the automated three-dimensional warehouse is:
其中,pij为第i类第j个药品的出入库频率,Mij为相应生产周期内第i类第j个药品的出入库总数,S为相应生产周期内所有药品的出入库总数。Among them, p ij is the stock-in and out frequency of the jth drug in the i-th category, M ij is the total number of stock-in and out of the j-th drug in the i-th category in the corresponding production cycle, and S is the total number of all drugs in and out in the corresponding production cycle.
进一步地,对自动化立体仓库内的药品进行分类,并根据每类药品之间的关联程度,得到每类药品之间的关联因子包括:Further, classify the drugs in the automated three-dimensional warehouse, and according to the degree of correlation between each type of drugs, get the correlation factors between each type of drugs including:
将自动化立体仓库内的全部药品分为n类,其中第i类共有ki个药品;Divide all the medicines in the automated three-dimensional warehouse into n categories, of which there are k i medicines in the i category;
计算每一类中药品之间的关联因子为其中,rifg为第i类中两个药品f,g的关联因子,f,g(f,g∈1,2,...,j,...ki),Q为相应生产周期内总订单数,qifg为同时包含药品f,g的订单个数;Calculate the correlation factor between each class of Chinese medicines as Among them, r ifg is the correlation factor of two drugs f,g in the i-th category, f,g(f,g∈1,2,...,j,...k i ), Q is the corresponding production cycle The total number of orders, q ifg is the number of orders that include drugs f and g at the same time;
根据每一类中药品之间的关联因子获得同类药品关联因子的关联矩阵为:According to the correlation factors between each class of Chinese medicines, the correlation matrix of the correlation factors of similar drugs is obtained as follows:
根据关联矩阵获取第i类中与其他药品关联程度最强的药品e;Obtain the drug e with the strongest correlation with other drugs in category i according to the correlation matrix;
计算第i类的其他药品相对药品e的关联因子,记为 Calculate the correlation factor of other drugs in category i relative to drug e, denoted as
进一步地,根据堆垛机在货位优化过程中运动速度的变化,建立堆垛机运动数学模型包括:Further, according to the change of the movement speed of the stacker during the optimization process of the cargo space, the establishment of the mathematical model of the movement of the stacker includes:
计算堆垛机拣选第i类第j个药品时,在水平方向上所花费的时间为:Calculate the time spent in the horizontal direction when the stacker picks the jth drug of the i category:
sxij=xij l s xij = x ij l
其中,txij为堆垛机拣选第i类第j个药品时,在水平方向上所花费的时间,sxij为堆垛机拣选第i类第j个药品时,在水平方向的移动距离,ax为堆垛机在水平方向的加速度,vxmax为堆垛机在水平方向的最大运行速度,Sxmax为堆垛机匀加速到vxmax时的最大水平运行距离,xij为第i类第j个药品水平方向的坐标值,l为货格的长度;Among them, t xij is the time spent in the horizontal direction when the stacker picks the jth drug of the i category, and s xij is the moving distance in the horizontal direction when the stacker picks the jth drug of the i category, a x is the acceleration of the stacker in the horizontal direction, v xmax is the maximum running speed of the stacker in the horizontal direction, S xmax is the maximum horizontal running distance of the stacker when it accelerates uniformly to v xmax , x ij is the i-th category The coordinate value of the jth drug in the horizontal direction, l is the length of the cargo box;
计算堆垛机拣选第i类第j个药品时,在垂直方向上所花费的时间为:Calculate the time spent in the vertical direction when the stacker picks the jth drug of the i category:
szij=zij h s zij =z ij h
其中,tzij为堆垛机拣选第i类第j个药品时,在垂直方向上所花费的时间,szij为堆垛机拣选第i类第j个药品时,在垂直方向的移动距离,az为堆垛机在垂直方向的加速度,vzmax为堆垛机在垂直方向的最大运行速度,Szmax为堆垛机匀加速到vzmax时的最大垂直运行距离,zij为第i类第j个药品垂直方向的坐标值,h为货格的高度;Among them, t zij is the time spent in the vertical direction when the stacker picks the jth drug of the i category, and s zij is the moving distance in the vertical direction when the stacker picks the jth drug of the i category, a z is the acceleration of the stacker in the vertical direction, v zmax is the maximum running speed of the stacker in the vertical direction, S zmax is the maximum vertical running distance of the stacker when it accelerates uniformly to v zmax , z ij is the i-type The coordinate value of the jth medicine in the vertical direction, h is the height of the cargo box;
获取堆垛机拣选第i类第j个药品所花费的时间为:The time it takes to get the stacker to pick the jth medicine of the i category is:
tij=max(txij,tzij)。t ij =max(t xij ,t zij ).
进一步地,根据堆垛机的运动数学模型、药品的出入库频率和每类药品之间的关联因子,建立多目标货位优化数学模型为:Further, according to the mathematical model of the movement of the stacker, the frequency of entering and leaving the warehouse of medicines, and the correlation factors between each type of medicines, a multi-objective cargo space optimization mathematical model is established as follows:
同时,at the same time,
且i,j,xij,yij,zij都为整数, And i, j, x ij , y ij , z ij are all integers,
其中,n为自动化立体仓库内药品的类别数,ki为第i类药品的药品个数,pij为第i类第j个药品的出入库频率,tij为堆垛机拣选第i类第j个药品所花费的时间,(xij,yij,zij)为第i类第j个药品经优化后的位置,vy为传送带的匀速运输速度,为第i类中与该类中其他药品关联程度最强的药品经优化后的位置,r,w分为别巷道间的距离和货格的宽度,为所有药品的平均位置,A、B、C分别为仓库的最大列数、最大排数、最大层数。Among them, n is the number of categories of medicines in the automated three-dimensional warehouse, ki is the number of medicines in the i-th category of medicines, p ij is the frequency of entry and exit of the j-th medicine in the i-th category, and t ij is the number of the i-th category picked by the stacker. The time spent on the jth drug, (x ij , y ij , z ij ) is the optimized position of the jth drug in the i category, v y is the uniform transport speed of the conveyor belt, It is the optimized position of the drug in category i that has the strongest correlation with other drugs in this category, r and w are divided into the distance between other lanes and the width of the cargo box, is the average position of all medicines, and A, B, and C are respectively the maximum number of columns, the maximum number of rows, and the maximum number of floors of the warehouse.
进一步地,对多目标货位优化数学模型进行求解具体为:采用NSGA-Ⅱ算法,对多目标货位优化数学模型进行求解。Further, solving the multi-objective cargo location optimization mathematical model is specifically: using the NSGA-II algorithm to solve the multi-objective cargo location optimization mathematical model.
进一步地,采用NSGA-Ⅱ算法,对多目标货位优化数学模型进行求解包括:Further, using the NSGA-II algorithm to solve the multi-objective cargo location optimization mathematical model includes:
采用整数编码,对自动化立体仓库内药品所在的货位位置进行编码,种群为一个矩阵,每行为一个染色体,对应一个可行解,设置种群数量、最大进化代数、交叉概率和变异概率;Integer encoding is used to encode the position of the drug in the automated three-dimensional warehouse. The population is a matrix, and each row is a chromosome, corresponding to a feasible solution. Set the population number, maximum evolutionary algebra, crossover probability and mutation probability;
采用梅森旋转演算法(Mersenne Twister),随机产生初始种群,将多目标货位优化数学模型中的目标函数的倒数作为适应度函数,计算个体适应度值,并进行快速非支配排序(Non-Dominated Sort),计算拥挤度(Crowding Distance);Using the Mersenne Twister algorithm, the initial population is randomly generated, and the reciprocal of the objective function in the multi-objective cargo space optimization mathematical model is used as the fitness function to calculate the individual fitness value, and perform fast non-dominated sorting (Non-Dominated) Sort), calculate the degree of congestion (Crowding Distance);
采用二元锦标赛选择策略(Tournament Selection)形成新种群;Form a new population by using the binary tournament selection strategy (Tournament Selection);
采用模拟二进制交叉算子(SBX)和多项式变异算子(polynomial mutation)分别进行交叉和变异操作,产生子代种群;Use the simulated binary crossover operator (SBX) and the polynomial mutation operator (polynomial mutation) to perform crossover and mutation operations respectively to generate offspring populations;
将父代种群与子代种群合并为一个临时种群,再进行非支配排序,计算拥挤度距离,采用拥挤度比较算子,选出新的父代种群;Merge the parent population and the child population into a temporary population, then perform non-dominated sorting, calculate the congestion distance, and use the congestion comparison operator to select a new parent population;
在此基础上,再进行选择、交叉、变异操作,形成新的子代种群,如果当前进化代数大于最大进化代数,则停止进化,得到一组Pareto最优解集。On this basis, perform selection, crossover, and mutation operations to form a new offspring population. If the current evolutionary algebra is greater than the maximum evolutionary algebra, stop evolution and obtain a set of Pareto optimal solution sets.
本发明提供的制药企业自动化立体仓库的货位优化系统包括:The cargo location optimization system of the automatic three-dimensional warehouse of pharmaceutical enterprises provided by the present invention comprises:
存储器、处理器以及存储在存储器上并可在处理器上运行的计算机程序,处理器执行计算机程序时实现上述制药企业自动化立体仓库的货位优化方法的步骤。A memory, a processor, and a computer program stored on the memory and operable on the processor, when the processor executes the computer program, the steps of the above method for optimizing the location of the automated three-dimensional warehouse of a pharmaceutical enterprise are realized.
与现有技术相比,本发明的优点在于:Compared with the prior art, the present invention has the advantages of:
本发明提供的制药企业自动化立体仓库的货位优化方法及系统,通过确立自动化立体仓库的货位优化目标,根据自动化立体仓库内药品的历史订单数据计算药品出入库频率,对自动化立体仓库内的药品进行分类,并根据每类药品之间的关联程度,得到每类药品之间的关联因子,根据堆垛机在货位优化过程中运动速度的变化,建立堆垛机运动数学模型,根据堆垛机运动数学模型、药品出入库频率和每类药品之间的关联因子,建立多目标货位优化数学模型以及对多目标货位优化数学模型进行求解,得到货位优化结果,解决了现有方法只考虑货物周转率和货架稳定性,不能很好地描述实际问题,造成优化结果不理想的问题,且建立的多目标货位优化数学模型充分考虑了制药企业药品的特殊性、自动化立体仓库的特点以及实际工况,从而使得基于多目标货位优化数学模型求解获得的货物优化结果更理想,货物分布更合理,进而大大提高了仓储作业效率,降低了仓储操作成本。The cargo location optimization method and system of the automated three-dimensional warehouse of pharmaceutical enterprises provided by the present invention, by establishing the cargo location optimization target of the automated three-dimensional warehouse, calculating the frequency of medicines in and out of the warehouse according to the historical order data of medicines in the automated three-dimensional warehouse, for the automated three-dimensional warehouse. Drugs are classified, and according to the degree of correlation between each type of drug, the correlation factor between each type of drug is obtained. According to the change of the movement speed of the stacker during the optimization process of the cargo space, a mathematical model of the stacker movement is established. According to the stacker The mathematical model of stacker movement, the frequency of drug in and out of the warehouse, and the correlation factors between each type of drug, establish a multi-objective cargo location optimization mathematical model and solve the multi-objective cargo location optimization mathematical model to obtain the cargo location optimization result, which solves the existing problems. The method only considers the turnover rate of goods and shelf stability, which cannot describe the actual problem well, resulting in unsatisfactory optimization results, and the established multi-objective optimization mathematical model fully considers the particularity of drugs in pharmaceutical companies, and the automated three-dimensional warehouse The characteristics and actual working conditions, so that the cargo optimization results obtained by solving the multi-objective cargo location optimization mathematical model are more ideal, and the cargo distribution is more reasonable, which greatly improves the efficiency of storage operations and reduces the cost of storage operations.
附图说明Description of drawings
图1是本发明实施例一的制药企业自动化立体仓库的货位优化方法的流程图;Fig. 1 is the flow chart of the goods position optimization method of the automatic three-dimensional warehouse of the pharmaceutical enterprise of embodiment one of the present invention;
图2是本发明实施例二的制药企业自动化立体仓库的货位优化方法的流程图;Fig. 2 is the flow chart of the cargo location optimization method of the automatic three-dimensional warehouse of the pharmaceutical enterprise in the second embodiment of the present invention;
图3为本发明实施例二采用NSGA-Ⅱ算法对多目标货位优化数学模型进行求解的算法流程图;Fig. 3 is an algorithm flow chart for solving the multi-objective cargo location optimization mathematical model by using the NSGA-II algorithm in Embodiment 2 of the present invention;
图4为本发明实施例二的制药企业自动化立体仓库的货位优化方法中药品优化前的货位分布图;Fig. 4 is the cargo location distribution diagram before drug optimization in the cargo location optimization method of the automated three-dimensional warehouse of the pharmaceutical enterprise in the second embodiment of the present invention;
图5为本发明实施例二的制药企业自动化立体仓库的货位优化方法中药品优化后的货位分布图;Fig. 5 is the cargo location distribution diagram after the optimization of medicines in the cargo location optimization method of the automated three-dimensional warehouse of the pharmaceutical enterprise in the second embodiment of the present invention;
图6为本发明实施例的制药企业自动化立体仓库的货位优化系统的结构框图。Fig. 6 is a structural block diagram of a cargo location optimization system for an automated three-dimensional warehouse of a pharmaceutical enterprise according to an embodiment of the present invention.
附图标记:Reference signs:
10、存储器;20、处理器。10. Memory; 20. Processor.
具体实施方式Detailed ways
为了便于理解本发明,下文将结合说明书附图和较佳的实施例对本发明作更全面、细致地描述,但本发明的保护范围并不限于以下具体的实施例。In order to facilitate the understanding of the present invention, the present invention will be described more fully and in detail below in conjunction with the accompanying drawings and preferred embodiments, but the protection scope of the present invention is not limited to the following specific embodiments.
以下结合附图对本发明的实施例进行详细说明,但是本发明可以由权利要求限定和覆盖的多种不同方式实施。The embodiments of the present invention will be described in detail below with reference to the accompanying drawings, but the present invention can be implemented in many different ways defined and covered by the claims.
实施例一Embodiment one
参照图1,本发明实施例一提供的制药企业自动化立体仓库的货位优化方法,包括:Referring to Fig. 1 , the cargo location optimization method of an automated three-dimensional warehouse of a pharmaceutical enterprise provided by Embodiment 1 of the present invention includes:
步骤S101,确立自动化立体仓库的货位优化目标;Step S101, establishing the cargo location optimization goal of the automated three-dimensional warehouse;
步骤S102,根据自动化立体仓库内药品的历史订单数据计算药品出入库频率;Step S102, calculating the frequency of medicines entering and leaving the warehouse according to the historical order data of medicines in the automated three-dimensional warehouse;
步骤S103,对自动化立体仓库内的药品进行分类,并根据每类药品之间的关联程度,得到每类药品之间的关联因子;Step S103, classify the drugs in the automated three-dimensional warehouse, and obtain the correlation factor between each type of drugs according to the degree of correlation between each type of drugs;
步骤S104,根据堆垛机在货位优化过程中运动速度的变化,建立堆垛机运动数学模型;Step S104, according to the change of the movement speed of the stacker during the cargo location optimization process, a mathematical model of the movement of the stacker is established;
步骤S105,根据堆垛机运动数学模型、药品出入库频率和每类药品之间的关联因子,建立多目标货位优化数学模型;Step S105, according to the mathematical model of the movement of the stacker, the frequency of medicines entering and leaving the warehouse, and the correlation factors between each type of medicines, a multi-objective cargo space optimization mathematical model is established;
步骤S106,对多目标货位优化数学模型进行求解,得到货位优化结果。Step S106, solving the multi-objective mathematical model for cargo location optimization to obtain a cargo location optimization result.
本发明实施例提供的制药企业自动化立体仓库的货位优化方法,通过确立自动化立体仓库的货位优化目标,根据自动化立体仓库内药品的历史订单数据计算药品出入库频率,对自动化立体仓库内的药品进行分类,并根据每类药品之间的关联程度,得到每类药品之间的关联因子,根据堆垛机在货位优化过程中运动速度的变化,建立堆垛机运动数学模型,根据堆垛机运动数学模型、药品出入库频率和每类药品之间的关联因子,建立多目标货位优化数学模型以及对多目标货位优化数学模型进行求解,得到货位优化结果,解决了现有方法只考虑货物周转率和货架稳定性,不能很好地描述实际问题,造成优化结果不理想的问题,且建立的多目标货位优化数学模型充分考虑了制药企业药品的特殊性、自动化立体仓库的特点以及实际工况,从而使得基于多目标货位优化数学模型求解获得的货物优化结果更理想,货物分布更合理,进而大大提高了仓储作业效率,降低了仓储操作成本。The cargo location optimization method of the automated three-dimensional warehouse of the pharmaceutical enterprise provided by the embodiment of the present invention, by establishing the cargo location optimization target of the automated three-dimensional warehouse, calculating the frequency of medicines entering and leaving the warehouse according to the historical order data of the medicines in the automated three-dimensional warehouse, for the automated three-dimensional warehouse. Drugs are classified, and according to the degree of correlation between each type of drug, the correlation factor between each type of drug is obtained. According to the change of the movement speed of the stacker during the optimization process of the cargo space, a mathematical model of the stacker movement is established. According to the stacker The mathematical model of stacker movement, the frequency of drug in and out of the warehouse, and the correlation factors between each type of drug, establish a multi-objective cargo location optimization mathematical model and solve the multi-objective cargo location optimization mathematical model to obtain the cargo location optimization result, which solves the existing problems. The method only considers the turnover rate of goods and shelf stability, which cannot describe the actual problem well, resulting in unsatisfactory optimization results, and the established multi-objective optimization mathematical model fully considers the particularity of drugs in pharmaceutical companies, and the automated three-dimensional warehouse The characteristics and actual working conditions, so that the cargo optimization results obtained by solving the multi-objective cargo location optimization mathematical model are more ideal, and the cargo distribution is more reasonable, which greatly improves the efficiency of storage operations and reduces the cost of storage operations.
具体地,本发明实施例根据制药企业的要求,结合制药企业药品的特殊性,确立自动化立体仓库的货位优化目标。制药企业药品的特殊性表现为以下几个方面:Specifically, according to the requirements of pharmaceutical companies, the embodiment of the present invention establishes the cargo location optimization goal of the automated three-dimensional warehouse in combination with the particularity of the drugs of the pharmaceutical companies. The specificity of the drugs of pharmaceutical companies is manifested in the following aspects:
①根据GMP/GSP标准的要求,药品需按不同自然属性分类存储。①According to the requirements of GMP/GSP standards, drugs need to be classified and stored according to different natural attributes.
②药品单位重量大都较小,在货位优化时可以不考虑药品重量。②The unit weight of medicines is mostly small, and the weight of medicines may not be considered when optimizing the storage space.
③药品之间的关联性性较强,为了保证存取效率,关联性强的药品应摆放在一起。③ There is a strong correlation between medicines. In order to ensure the access efficiency, the medicines with strong correlation should be placed together.
因此,在确立优化目标时,首先,应当使出入库频率大的药品摆放在离出入口更近的地方,以缩短堆垛机拣选货物所花费的时间,提高仓储的作业效率。同时,不再考虑药品之间的重量差异,即不再考虑货架的稳定性。然后,在药品分类存储的基础上,分析每一类中所有药品的关联程度,使得类内关联程度强的药品摆放在一起,以缩短拣选同批出入库货物所花费的时间,进一步提高仓储的作业效率,降低仓储的操作成本。由此,确立以药品的出入库频率和药品的关联性为优化目标。Therefore, when establishing the optimization goal, first of all, the medicines with high frequency of entry and exit should be placed closer to the entrance and exit, so as to shorten the time it takes for the stacker to pick goods and improve the efficiency of storage operations. At the same time, weight differences between medicines are no longer considered, that is, shelf stability is no longer considered. Then, on the basis of classified storage of drugs, analyze the correlation degree of all drugs in each category, so that the drugs with strong correlation degree within the category are placed together, so as to shorten the time spent on picking the same batch of inbound and outbound goods, and further improve storage efficiency. High operating efficiency and reduced storage operating costs. As a result, the frequency of medicines entering and leaving the warehouse and the relevance of medicines are established as the optimization goals.
实施例二Embodiment two
参照图2,本发明实施例二提供的制药企业自动化立体仓库的货位优化方法,包括:Referring to Fig. 2 , the cargo location optimization method for the automated three-dimensional warehouse of a pharmaceutical enterprise provided by Embodiment 2 of the present invention includes:
步骤S201,确立自动化立体仓库内药品的出入库频率和药品的关联性为自动化立体仓库的货位优化目标。Step S201, establishing the relationship between the frequency of medicines entering and leaving the warehouse in the automated warehouse and the correlation between medicines as the cargo location optimization goal of the automated warehouse.
步骤S202,根据自动化立体仓库内药品的历史订单数据计算药品出入库频率。Step S202, calculating the frequency of medicines entering and leaving the warehouse according to the historical order data of medicines in the automated three-dimensional warehouse.
具体地,在一个生产周期内,第i类第j个药品的出入库频率为:Specifically, within a production cycle, the frequency of entry and exit of the jth drug in category i is:
其中,pij为第i类第j个药品的出入库频率,Mij为相应生产周期内第i类第j个药品的出入库总数,S为相应生产周期内所有药品的出入库总数。Among them, p ij is the stock-in and out frequency of the jth drug in the i-th category, M ij is the total number of stock-in and out of the j-th drug in the i-th category in the corresponding production cycle, and S is the total number of all drugs in and out in the corresponding production cycle.
步骤S203,对自动化立体仓库内的药品进行分类,并根据每类药品之间的关联程度,得到每类药品之间的关联因子。Step S203, classify the drugs in the automated three-dimensional warehouse, and obtain the correlation factor between each type of drugs according to the degree of correlation between each type of drugs.
具体地,根据药品分类存储原则,对自动化立体仓库内的药品进行分类。将全部药品分为n类,第i类共有ki个药品。对于第i类第j个药品,优化后的位置为(xij,yij,zij)。在同一个生产周期内,第i类中两个药品f,g(f,g∈1,2,...,j,...ki)出现在同一订单中的订单数占总订单数的比例为关联规则的支持度。为了方便计算与表达,定义该支持度为第i类的两个药品f,g的关联因子为:Specifically, according to the principle of classification and storage of medicines, the medicines in the automated three-dimensional warehouse are classified. Divide all medicines into n categories, and there are k i medicines in category i. For the j-th drug of category i, the optimized position is (x ij , y ij , z ij ). In the same production cycle, the number of orders in which two drugs f,g (f,g∈1,2,...,j,...k i ) appear in the same order in the i-th category accounts for the total number of orders The ratio of is the support of association rules. For the convenience of calculation and expression, the correlation factor of two drugs f and g defined as the i-th category of support is:
其中,同时,在相应生产周期内总订单数为Q,同时包含药品f,g的订单个数为qifg。Wherein, at the same time, the total number of orders in the corresponding production cycle is Q, and the number of orders including drugs f and g is q ifg .
由此,该时间周期内第i类内所有药品之间的关联因子,得到同类药品关联因子的关联矩阵:Thus, the correlation factors among all drugs in the i-th category within the time period, the correlation matrix of the correlation factors of similar drugs is obtained:
由关联矩阵选出第i类中与其他药品关联程度最强的药品e,其优化后的位置,记为 The drug e with the strongest correlation with other drugs in category i is selected from the correlation matrix, and its optimized position is denoted as
由此,进一步得到第i类的其他药品相对药品e的关联因子,记为 Thus, the correlation factor of other drugs in category i relative to drug e is further obtained, denoted as
步骤S204,根据堆垛机在货位优化过程中运动速度的变化,建立堆垛机运动数学模型。Step S204, according to the change of the movement speed of the stacker during the cargo location optimization process, a mathematical model of the movement of the stacker is established.
具体地,本实施例根据实际工况,分析堆垛机在货位优化过程中运动速度的变化,将堆垛机拣选一个货物的运动过程抽象成一个均匀加减速的过程,建立堆垛机的运动数学模型为:Specifically, this embodiment analyzes the change of the movement speed of the stacker in the process of cargo location optimization according to the actual working conditions, abstracts the movement process of picking a cargo by the stacker into a process of uniform acceleration and deceleration, and establishes the The mathematical model of motion is:
堆垛机拣选第i类第j个药品时,在水平方向上所花费的时间为:When the stacker picks the j-th drug of the i-th category, the time spent in the horizontal direction is:
sxij=xij l (5)s xij = x ij l (5)
其中,txij为堆垛机拣选第i类第j个药品时,在水平方向上所花费的时间,sxij为堆垛机拣选第i类第j个药品时,在水平方向的移动距离,ax为堆垛机在水平方向的加速度,vxmax为堆垛机在水平方向的最大运行速度,Sxmax为堆垛机匀加速到vxmax时的最大水平运行距离,xij为第i类第j个药品水平方向的坐标值,l为货格的长度;Among them, t xij is the time spent in the horizontal direction when the stacker picks the jth drug of the i category, and s xij is the moving distance in the horizontal direction when the stacker picks the jth drug of the i category, a x is the acceleration of the stacker in the horizontal direction, v xmax is the maximum running speed of the stacker in the horizontal direction, S xmax is the maximum horizontal running distance of the stacker when it accelerates uniformly to v xmax , x ij is the i-th category The coordinate value of the jth drug in the horizontal direction, l is the length of the cargo box;
同理,堆垛机拣选第i类第j个药品时,在垂直方向上所花费的时间为:Similarly, when the stacker picks the jth medicine of the i-th category, the time spent in the vertical direction is:
szij=zij h (8)s zij =z ij h (8)
其中,tzij为堆垛机拣选第i类第j个药品时,在垂直方向上所花费的时间,szij为堆垛机拣选第i类第j个药品时,在垂直方向的移动距离,az为堆垛机在垂直方向的加速度,vzmax为堆垛机在垂直方向的最大运行速度,Szmax为堆垛机匀加速到vzmax时的最大垂直运行距离,zij为第i类第j个药品垂直方向的坐标值,h为货格的高度;Among them, t zij is the time spent in the vertical direction when the stacker picks the jth drug of the i category, and s zij is the moving distance in the vertical direction when the stacker picks the jth drug of the i category, a z is the acceleration of the stacker in the vertical direction, v zmax is the maximum running speed of the stacker in the vertical direction, S zmax is the maximum vertical running distance of the stacker when it accelerates uniformly to v zmax , z ij is the i-type The coordinate value of the jth medicine in the vertical direction, h is the height of the cargo box;
则,堆垛机拣选第i类第j个药品所花费的时间为:Then, the time it takes for the stacker to pick the j-th drug of the i-th category is:
tij=max(txij,tzij) (9)t ij =max(t xij ,t zij ) (9)
步骤S205,根据堆垛机运动数学模型、药品出入库频率和每类药品之间的关联因子,建立多目标货位优化数学模型。In step S205, a multi-objective mathematical model for cargo space optimization is established according to the mathematical model of the movement of the stacker, the frequency of medicines entering and leaving the warehouse, and the correlation factors between each type of medicines.
为了实现药品的就近出入库,将出入库频率大的药品存放在离出入库台近的地方,使得药品的出入库频率与拣选该药品所花费的时间的乘机之和最小,并假设每个货格中只存放一种药品,忽略货物从堆垛机到传送带上的时间,即In order to realize the nearby storage of medicines, the medicines with high frequency of entry and exit are stored in a place close to the warehouse entry and exit platform, so that the sum of the frequency of entry and exit of medicines and the time spent on picking the medicines is the smallest, and it is assumed that each shipment Only one drug is stored in the grid, and the time for the goods to go from the stacker to the conveyor belt is ignored, that is
其中,n为所述自动化立体仓库内药品的类别数,ki为第i类药品的药品个数,pij为第i类第j个药品的出入库频率,tij为堆垛机拣选第i类第j个药品所花费的时间,(xij,yij,zij)为第i类第j个药品经优化后的位置,vy为传送带的匀速运输速度,r,w分为别巷道间的距离和货格的宽度。Among them, n is the number of categories of medicines in the automated three-dimensional warehouse, k i is the number of medicines of the i-th category of medicines, p ij is the frequency of entry and exit of the j-th medicine of the i-th category, and t ij is the number of medicines picked by the stacker The time spent on the jth drug of class i, (x ij , y ij , z ij ) is the optimized position of the jth drug of class i, v y is the uniform transport speed of the conveyor belt, r, w are respectively The distance between the lanes and the width of the cargo grid.
根据药品之间具有较强的关联性,因此,在药品分类存储的基础上,根据历史数据,采用关联分析法分析每一类中所有药品之间的关联程度,使得类内关联程度强的药品摆放在一起,以缩短拣选同批出入库货物所花费的时间。According to the strong correlation between medicines, on the basis of classification and storage of medicines, according to historical data, association analysis method is used to analyze the degree of correlation between all medicines in each category, so that the medicines with strong intra-category correlation Put them together to shorten the time it takes to pick the same batch of inbound and outbound goods.
对于第i类的所有药品,以药品e为中心位置,计算该类其他药品与药品e的欧式距离,并把上述得到的关联因子作为关联权重,使得该类其他药品与药品e的欧氏距离与相对应的关联权重的乘积之和最小,即:For all drugs in category i, take drug e as the center position, calculate the Euclidean distance between other drugs of this type and drug e, and use the correlation factor obtained above as the correlation weight to make the Euclidean distance between other drugs of this type and drug e The sum of the products with the corresponding associated weights is the smallest, that is:
为了尽量使仓库中所有药品离出入库口最近,令所有药品的平均位置离出入库口的欧式距离最小,即:In order to make all the medicines in the warehouse as close as possible to the entrance and exit, the Euclidean distance between the average position of all medicines and the entrance and exit is the smallest, namely:
进而,and then,
其中,为第i类中与该类中其他药品关联程度最强的药品经优化后的位置,表示所有药品的平均位置,d表示所有药品的平均位置离出入库口的欧式距离。in, is the optimized position of the drug in category i that has the strongest correlation with other drugs in this category, Represents the average position of all medicines, and d represents the Euclidean distance from the average position of all medicines to the warehouse entrance.
同时,为了使每类药品尽量分散存放,令每类药品的中心位置与所有药品的平均位置的欧氏距离之和最大,即:At the same time, in order to store each type of medicine as scattered as possible, the sum of the Euclidean distances between the center position of each type of medicine and the average position of all medicines is maximized, namely:
由此,得到:From this, we get:
综上,得到多优化目标的货位优化数学模型:In summary, the mathematical model of cargo space optimization with multiple optimization objectives is obtained:
同时,at the same time,
且i,j,xij,yij,zij都为整数, And i, j, x ij , y ij , z ij are all integers,
其中,A、B、C分别为仓库的最大列数、最大排数、最大层数。Among them, A, B, and C are respectively the maximum number of columns, the maximum number of rows, and the maximum number of layers of the warehouse.
步骤S206,采用NSGA-Ⅱ算法,对多目标货位优化数学模型进行求解,得到货位优化结果。In step S206, the NSGA-II algorithm is used to solve the multi-objective cargo space optimization mathematical model to obtain a cargo space optimization result.
参照图3,图3为本发明实施例采用NSGA-Ⅱ算法对多目标货位优化数学模型进行求解的算法流程图,其具体步骤为:With reference to Fig. 3, Fig. 3 adopts NSGA-II algorithm to solve the algorithm flow chart of multi-objective cargo space optimization mathematical model for the embodiment of the present invention, and its specific steps are:
①采用整数编码,对药品所在的货位位置进行编码,种群为一个矩阵,每行为一个染色体,对应一个可行解。设置种群数量、最大进化代数、交叉概率和变异概率。①Integer encoding is used to encode the location of the drug. The population is a matrix, and each row is a chromosome, corresponding to a feasible solution. Set the population size, maximum evolutionary generation, crossover probability and mutation probability.
每个药品的信息包含该药品的编码、其所处的储位编码和货位号等。由于药品与其所在货位之间存在映射关系,每个药品的货物编码是固定不变的,而其所处的储位编码及货位号是随着药品的移动而动态变化的。因此,本发明采用整数编码,选择药品所在位置的货位作为染色体上的基因:The information of each drug includes the code of the drug, the code of the storage location where it is located, the number of the storage location, and the like. Due to the mapping relationship between the drug and its location, the cargo code of each drug is fixed, while its storage location code and location number change dynamically with the movement of the drug. Therefore, the present invention adopts integer coding, and selects the cargo location where the drug is located as the gene on the chromosome:
1)种群为一个矩阵,每行为一个染色体,对应一个可行解,即对应一种货位优化方案;1) The population is a matrix, each row is a chromosome, corresponding to a feasible solution, that is, corresponding to a cargo location optimization scheme;
2)每一条染色体中包含的基因个数代表待优化货物的个数;2) The number of genes contained in each chromosome represents the number of goods to be optimized;
3)每一条染色体上的每一个基因代表一个药品所在位置的货位信息,分别表示该药品所在位置的列、排、行。即,每个基因由3个整数表示。3) Each gene on each chromosome represents the location information of a drug, respectively representing the column, row, and row of the drug. That is, each gene is represented by 3 integers.
如表1所示:As shown in Table 1:
表1染色体编码Table 1 Chromosome coding
如表1所示,153即代表(1,5,3),表示货位号为1的药品存放在第1列第5排第3行。As shown in Table 1, 153 stands for (1, 5, 3), indicating that the drug with the cargo location number 1 is stored in the first column, fifth row, third row.
②采用梅森旋转演算法(Mersenne Twister),随机产生初始种群。将目标函数的倒数作为适应度函数,计算个体适应度值,并进行快速非支配排序(Non-Dominated Sort),计算拥挤度(Crowding Distance)。②Adopt the Mersenne Twister algorithm (Mersenne Twister) to randomly generate the initial population. The reciprocal of the objective function is used as the fitness function to calculate the individual fitness value, and perform a fast non-dominated sort (Non-Dominated Sort) to calculate the crowding distance (Crowding Distance).
在遗传算法中,适应度(Fitness)用来度量群体中的个体在优化计算中达到或接近于最优解的优良程度。适应度较高的个体遗传到下一代的概率就较大;而较低的个体遗传到下一代的概率就相对小一些。遗传算法引导搜索的主要依据就是个体的适应度值。也就是说,遗传算法依靠选择操作来引导算法的搜索方向。选择操作是以个体的适应度值作为确定性指标,从当前群体中选择适应度值高的个体进行交叉和变异,寻找最优解。本实施例的三个目标函数均为求全局最小值,因此,取目标函数的倒数作为适应度函数,则目标函数转化后所对应的适应度函数为:In genetic algorithm, fitness is used to measure the degree to which individuals in the population reach or approach the optimal solution in the optimization calculation. Individuals with higher fitness have a higher probability of passing on to the next generation; while individuals with lower fitness have a relatively smaller probability of passing on to the next generation. The main basis of the genetic algorithm to guide the search is the fitness value of the individual. That is, genetic algorithms rely on selection operations to guide the algorithm's search direction. The selection operation uses the fitness value of the individual as a deterministic index, and selects individuals with high fitness values from the current population for crossover and mutation to find the optimal solution. The three objective functions of this embodiment all seek the global minimum value, therefore, take the reciprocal of the objective function as the fitness function, then the corresponding fitness function after the objective function conversion is:
其中,F1、F2、F3分别对应式(16)中的各个目标函数。Among them, F 1 , F 2 , and F 3 respectively correspond to the objective functions in formula (16).
③采用二元锦标赛选择策略(Tournament Selection)形成新种群。③Using the binary tournament selection strategy (Tournament Selection) to form a new population.
④采用模拟二进制交叉算子(SBX)和多项式变异算子(polynomial mutation)分别进行交叉和变异操作,产生子代种群。④ Use simulated binary crossover operator (SBX) and polynomial mutation operator (polynomial mutation) to perform crossover and mutation operations respectively to generate offspring populations.
⑤将父代种群与子代种群合并为一个临时种群,再进行非支配排序,计算拥挤度距离。采用拥挤度比较算子,选出新的父代种群。⑤ Merge the parent population and the offspring population into a temporary population, then perform non-dominated sorting, and calculate the crowding distance. Use the crowding degree comparison operator to select a new parent population.
⑥在此基础上,再进行选择、交叉、变异操作,形成新的子代种群。如果当前进化代数大于最大进化代数,则停止进化,得到一组Pareto最优解集。⑥On this basis, carry out selection, crossover and mutation operations to form new offspring populations. If the current evolution algebra is greater than the maximum evolution algebra, then stop the evolution and get a set of Pareto optimal solutions.
下面举一个实例对本发明的货位优化方法进行详细说明:An example is given below to describe the location optimization method of the present invention in detail:
该制药企业自动化立体仓库成品库的工况参数如表2所示。Table 2 shows the working condition parameters of the finished product warehouse of the automated three-dimensional warehouse of the pharmaceutical company.
表2实例仿真参数信息表Table 2 Example simulation parameter information table
待优化药品已知初始数据如表3所示。The known initial data of the drugs to be optimized are shown in Table 3.
表3待优化药品已知初始数据Table 3 Known initial data of drugs to be optimized
运用式(1)~式(16)所提出的货位优化模型,对仓库内的货物进行货位优化,并采用MATLAB软件进行仿真。Using the cargo location optimization model proposed by formula (1) ~ formula (16), optimize the cargo location of the goods in the warehouse, and use MATLAB software for simulation.
采用本发明实施例二的方法进行制药企业自动化立体仓库货位优化,药品优化前后的货位位置如图4和图5所示,其中代表第1类药品,代表第2类药品,代表第3类药品。从图4和图5可以明显看出,优化后的药品的货位更加合理,同类药品存放在一起,不同类的药品分散存放,优化后的药品货位位置整体上也更加靠近出入库台。Adopt the method for the second embodiment of the present invention to carry out the cargo location optimization of the automatic three-dimensional warehouse of the pharmaceutical enterprise, the cargo location positions before and after the optimization of the medicine are as shown in Figure 4 and Figure 5, wherein represents class 1 drugs, represents class 2 drugs, Represents class 3 drugs. From Figure 4 and Figure 5, it can be clearly seen that the optimized drug storage location is more reasonable, the same type of drugs are stored together, and different types of drugs are stored separately, and the optimized drug storage location is also closer to the warehouse as a whole.
由此可见,本发明实施例提供的制药企业自动化立体仓库的货位优化方法,使货物分布更加合理,解决了现有方法只考虑货物周转率和货架稳定性,不能很好地描述实际问题,造成优化结果不理想的问题,且建立的多目标货位优化数学模型充分考虑了制药企业药品的特殊性、自动化立体仓库的特点以及实际工况,从而使得基于多目标货位优化数学模型求解获得的货物优化结果更理想,货物分布更合理,进而大大提高了仓储作业效率,降低了仓储操作成本。It can be seen that the cargo location optimization method for the automated three-dimensional warehouse of pharmaceutical companies provided by the embodiment of the present invention makes the distribution of goods more reasonable, and solves the problem that the existing method only considers the turnover rate of goods and shelf stability, and cannot describe the actual problem well. The problem of unsatisfactory optimization results, and the established multi-objective location optimization mathematical model fully considers the particularity of pharmaceutical companies, the characteristics of automated warehouses and actual working conditions, so that the solution based on the multi-objective location optimization mathematical model can be obtained The goods optimization results are more ideal, and the goods distribution is more reasonable, which greatly improves the efficiency of warehousing operations and reduces the cost of warehousing operations.
参照图6,本发明实施例提出的制药企业自动化立体仓库的货位优化系统,包括:Referring to Fig. 6, the cargo location optimization system of the automated three-dimensional warehouse of pharmaceutical enterprises proposed by the embodiment of the present invention includes:
存储器10、处理器20以及存储在存储器10上并可在处理器20上运行的计算机程序,其中,处理器20执行计算机程序时实现本发明实施例的制药企业自动化立体仓库的货位优化方法的步骤。The memory 10, the processor 20, and the computer program stored on the memory 10 and operable on the processor 20, wherein, when the processor 20 executes the computer program, realizes the cargo location optimization method of the pharmaceutical enterprise automated three-dimensional warehouse of the embodiment of the present invention step.
本实施例的制药企业自动化立体仓库的货位优化系统的具体工作过程和工作原理可参照本实施例中的制药企业自动化立体仓库的货位优化方法的工作过程和工作原理。For the specific working process and working principle of the storage location optimization system of the automated three-dimensional warehouse of pharmaceutical enterprises in this embodiment, please refer to the working process and working principle of the storage location optimization method of the automatic three-dimensional warehouse of pharmaceutical enterprises in this embodiment.
以上仅为本发明的优选实施例而已,并不用于限制本发明,对于本领域的技术人员来说,本发明可以有各种更改和变化。凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。The above are only preferred embodiments of the present invention, and are not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and changes. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present invention shall be included within the protection scope of the present invention.
Claims (9)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810299910.2A CN108550007B (en) | 2018-04-04 | 2018-04-04 | Goods space optimization method and system for automatic stereoscopic warehouse of pharmaceutical enterprise |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201810299910.2A CN108550007B (en) | 2018-04-04 | 2018-04-04 | Goods space optimization method and system for automatic stereoscopic warehouse of pharmaceutical enterprise |
Publications (2)
Publication Number | Publication Date |
---|---|
CN108550007A true CN108550007A (en) | 2018-09-18 |
CN108550007B CN108550007B (en) | 2021-09-28 |
Family
ID=63514343
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201810299910.2A Active CN108550007B (en) | 2018-04-04 | 2018-04-04 | Goods space optimization method and system for automatic stereoscopic warehouse of pharmaceutical enterprise |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN108550007B (en) |
Cited By (19)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109325721A (en) * | 2018-10-10 | 2019-02-12 | 江苏电力信息技术有限公司 | A method of loading and unloading materials based on intelligent analysis algorithm |
CN109886478A (en) * | 2019-01-29 | 2019-06-14 | 东南大学 | A cargo space optimization method of an automated three-dimensional warehouse for finished wine |
CN109918481A (en) * | 2019-02-28 | 2019-06-21 | 深圳市海恒智能科技有限公司 | The method and system of automatic stereowarehouse storage books |
CN110348126A (en) * | 2019-07-12 | 2019-10-18 | 中冶赛迪重庆信息技术有限公司 | Steel mill's stockpile position layout optimization method, system, equipment and storage medium |
CN110471318A (en) * | 2019-06-26 | 2019-11-19 | 康美药业股份有限公司 | A kind of intelligence control system of pharmacy heating cooking stove |
CN110942555A (en) * | 2019-12-12 | 2020-03-31 | 北京云厨科技有限公司 | Storage allocation method of vending machine |
CN111178606A (en) * | 2019-12-22 | 2020-05-19 | 南京理工大学 | Automatic warehouse storage position allocation optimization method based on NSGA-II |
CN112278694A (en) * | 2020-10-16 | 2021-01-29 | 江苏智库智能科技有限公司 | Stacker warehouse-in and warehouse-out goods position scheduling system |
CN112396362A (en) * | 2019-08-12 | 2021-02-23 | 北京京东乾石科技有限公司 | Method and device for determining driving destination and storage medium |
CN112478553A (en) * | 2020-12-11 | 2021-03-12 | 陕西科技大学 | Compact robot automatic storing and taking system cargo box closing method |
CN112580852A (en) * | 2020-11-19 | 2021-03-30 | 江苏安方电力科技有限公司 | Intensive automatic stereoscopic warehouse goods space optimization method for electric power materials |
CN113120487A (en) * | 2019-12-30 | 2021-07-16 | 北京极智嘉科技股份有限公司 | Inventory system and goods storing and taking method |
CN113387105A (en) * | 2021-06-09 | 2021-09-14 | 意欧斯物流科技(上海)有限公司 | Simulation system for logistics transportation of vertical warehouse of tray stacker |
CN113822508A (en) * | 2020-06-19 | 2021-12-21 | 广东瑞仕格科技有限公司 | Object scheduling method and device, electronic equipment and storage medium |
CN114417696A (en) * | 2021-12-07 | 2022-04-29 | 长春工业大学 | Automatic stereoscopic warehouse goods space allocation optimization method based on genetic algorithm |
CN114662396A (en) * | 2022-03-31 | 2022-06-24 | 重庆邮电大学 | A Multi-objective Warehouse Location Allocation Optimization Method Based on NSGA-II |
CN114926001A (en) * | 2022-05-10 | 2022-08-19 | 康诚科瑞医药研发(武汉)有限公司 | Biological sample inventory management method, device, electronic device and storage medium |
WO2022252268A1 (en) * | 2021-06-03 | 2022-12-08 | 江南大学 | Optimized scheduling method for intelligent stereoscopic warehouse |
CN117094648A (en) * | 2023-10-19 | 2023-11-21 | 安徽领云物联科技有限公司 | Visual management system of warehouse based on thing networking |
Citations (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7779051B2 (en) * | 2008-01-02 | 2010-08-17 | International Business Machines Corporation | System and method for optimizing federated and ETL'd databases with considerations of specialized data structures within an environment having multidimensional constraints |
US8086347B2 (en) * | 2008-01-22 | 2011-12-27 | Walgreen Co. | Targeted product distribution system and method |
CN103473616A (en) * | 2013-09-17 | 2013-12-25 | 四川航天系统工程研究所 | Dynamic goods allocation planning method and system for processing multi-variety goods and material storage |
CN103500389A (en) * | 2013-09-16 | 2014-01-08 | 广东工业大学 | Industrial explosive warehouse optimal management operating system and goods optimal management method |
CN103559396A (en) * | 2013-10-31 | 2014-02-05 | 华北水利水电大学 | Automatic pharmacy storage location optimizing method based on improved chaos particle swarm algorithm |
CN103942617A (en) * | 2014-04-17 | 2014-07-23 | 江苏物联网研究发展中心 | Intelligent stored cargo space distribution and optimization method |
CN103955818A (en) * | 2014-05-27 | 2014-07-30 | 山东大学 | Task scheduling method of multilayer shuttle vehicle automatic warehousing system |
CN104835026A (en) * | 2015-05-15 | 2015-08-12 | 重庆大学 | Automatic stereoscopic warehouse selection operation scheduling modeling and optimizing method based on Petri network and improved genetic algorithm |
CN105911982A (en) * | 2016-04-07 | 2016-08-31 | 西安建筑科技大学 | Piler scheduling path model establishment method based on distributed warehouse in/out layout mode |
CN105976054A (en) * | 2016-04-29 | 2016-09-28 | 国家电网公司 | Measuring instrument storage system goods location optimization method |
CN106203930A (en) * | 2016-08-03 | 2016-12-07 | 太仓美宅姬娱乐传媒有限公司 | Being automatically positioned and warehouse-out method of a kind of store interior association kinds of goods position |
CN106709692A (en) * | 2017-02-24 | 2017-05-24 | 北京远大宏略科技股份有限公司 | Logistics center storage position allocation method |
CN106779153A (en) * | 2016-11-15 | 2017-05-31 | 浙江工业大学 | Optimization method is distributed in a kind of intelligent three-dimensional warehouse goods yard |
CN107480922A (en) * | 2017-07-07 | 2017-12-15 | 西安建筑科技大学 | Both ends formula is unloaded goods bit allocation scheduling model method for building up with the double car operational modes of rail |
CN107863153A (en) * | 2017-11-24 | 2018-03-30 | 中南大学 | A kind of human health characteristic modeling measuring method and platform based on intelligent big data |
-
2018
- 2018-04-04 CN CN201810299910.2A patent/CN108550007B/en active Active
Patent Citations (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7779051B2 (en) * | 2008-01-02 | 2010-08-17 | International Business Machines Corporation | System and method for optimizing federated and ETL'd databases with considerations of specialized data structures within an environment having multidimensional constraints |
US8086347B2 (en) * | 2008-01-22 | 2011-12-27 | Walgreen Co. | Targeted product distribution system and method |
CN103500389A (en) * | 2013-09-16 | 2014-01-08 | 广东工业大学 | Industrial explosive warehouse optimal management operating system and goods optimal management method |
CN103473616A (en) * | 2013-09-17 | 2013-12-25 | 四川航天系统工程研究所 | Dynamic goods allocation planning method and system for processing multi-variety goods and material storage |
CN103559396A (en) * | 2013-10-31 | 2014-02-05 | 华北水利水电大学 | Automatic pharmacy storage location optimizing method based on improved chaos particle swarm algorithm |
CN103942617A (en) * | 2014-04-17 | 2014-07-23 | 江苏物联网研究发展中心 | Intelligent stored cargo space distribution and optimization method |
CN103955818A (en) * | 2014-05-27 | 2014-07-30 | 山东大学 | Task scheduling method of multilayer shuttle vehicle automatic warehousing system |
CN104835026A (en) * | 2015-05-15 | 2015-08-12 | 重庆大学 | Automatic stereoscopic warehouse selection operation scheduling modeling and optimizing method based on Petri network and improved genetic algorithm |
CN105911982A (en) * | 2016-04-07 | 2016-08-31 | 西安建筑科技大学 | Piler scheduling path model establishment method based on distributed warehouse in/out layout mode |
CN105976054A (en) * | 2016-04-29 | 2016-09-28 | 国家电网公司 | Measuring instrument storage system goods location optimization method |
CN106203930A (en) * | 2016-08-03 | 2016-12-07 | 太仓美宅姬娱乐传媒有限公司 | Being automatically positioned and warehouse-out method of a kind of store interior association kinds of goods position |
CN106779153A (en) * | 2016-11-15 | 2017-05-31 | 浙江工业大学 | Optimization method is distributed in a kind of intelligent three-dimensional warehouse goods yard |
CN106709692A (en) * | 2017-02-24 | 2017-05-24 | 北京远大宏略科技股份有限公司 | Logistics center storage position allocation method |
CN107480922A (en) * | 2017-07-07 | 2017-12-15 | 西安建筑科技大学 | Both ends formula is unloaded goods bit allocation scheduling model method for building up with the double car operational modes of rail |
CN107863153A (en) * | 2017-11-24 | 2018-03-30 | 中南大学 | A kind of human health characteristic modeling measuring method and platform based on intelligent big data |
Non-Patent Citations (6)
Title |
---|
KUNG Y. 等: "Motion Planning of Two Stacker Cranes in a Large-Scale Automated Storage/Retrieval System", 《IEEE INT CONF ROBOTICS & BIOMIMETICS》 * |
QIN GUOFENG 等: "Warehouse optimization model based on genetic algorithm", 《MATHEMATICAL PROBLEMS IN ENGINEERING》 * |
TIAN M. H. 等: "Optimization of the Hinge Point Position of Luffing Mechanism in Reach Stacker for Container", 《ADVANCED MATERIALS RESEARCH》 * |
刘新: "堆垛机位置控制若干问题研究", 《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑》 * |
印美 等: "基于非支配遗传算法的自动化仓库动态货位优化", 《组合机床与自动化加工技术》 * |
王玉湘 等: "立体仓库堆垛机的模糊控制定位技术研究", 《微处理机》 * |
Cited By (27)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109325721A (en) * | 2018-10-10 | 2019-02-12 | 江苏电力信息技术有限公司 | A method of loading and unloading materials based on intelligent analysis algorithm |
CN109325721B (en) * | 2018-10-10 | 2020-08-21 | 江苏电力信息技术有限公司 | A method of loading and unloading materials based on intelligent analysis algorithm |
CN109886478A (en) * | 2019-01-29 | 2019-06-14 | 东南大学 | A cargo space optimization method of an automated three-dimensional warehouse for finished wine |
CN109886478B (en) * | 2019-01-29 | 2023-01-31 | 东南大学 | Goods space optimization method for finished wine automatic stereoscopic warehouse |
CN109918481A (en) * | 2019-02-28 | 2019-06-21 | 深圳市海恒智能科技有限公司 | The method and system of automatic stereowarehouse storage books |
CN110471318B (en) * | 2019-06-26 | 2022-05-10 | 康美药业股份有限公司 | Intelligent control system of pharmacy heating furnace |
CN110471318A (en) * | 2019-06-26 | 2019-11-19 | 康美药业股份有限公司 | A kind of intelligence control system of pharmacy heating cooking stove |
CN110348126A (en) * | 2019-07-12 | 2019-10-18 | 中冶赛迪重庆信息技术有限公司 | Steel mill's stockpile position layout optimization method, system, equipment and storage medium |
CN110348126B (en) * | 2019-07-12 | 2023-10-24 | 中冶赛迪信息技术(重庆)有限公司 | Method, system, equipment and storage medium for optimizing raw material pile layout of steel mill |
CN112396362A (en) * | 2019-08-12 | 2021-02-23 | 北京京东乾石科技有限公司 | Method and device for determining driving destination and storage medium |
CN110942555A (en) * | 2019-12-12 | 2020-03-31 | 北京云厨科技有限公司 | Storage allocation method of vending machine |
CN111178606A (en) * | 2019-12-22 | 2020-05-19 | 南京理工大学 | Automatic warehouse storage position allocation optimization method based on NSGA-II |
CN111178606B (en) * | 2019-12-22 | 2022-09-06 | 南京理工大学 | Automatic warehouse storage position allocation optimization method based on NSGA-II |
CN113120487A (en) * | 2019-12-30 | 2021-07-16 | 北京极智嘉科技股份有限公司 | Inventory system and goods storing and taking method |
CN113822508A (en) * | 2020-06-19 | 2021-12-21 | 广东瑞仕格科技有限公司 | Object scheduling method and device, electronic equipment and storage medium |
CN113822508B (en) * | 2020-06-19 | 2024-05-17 | 广东瑞仕格科技有限公司 | Object scheduling method, device, electronic equipment and storage medium |
CN112278694A (en) * | 2020-10-16 | 2021-01-29 | 江苏智库智能科技有限公司 | Stacker warehouse-in and warehouse-out goods position scheduling system |
CN112580852A (en) * | 2020-11-19 | 2021-03-30 | 江苏安方电力科技有限公司 | Intensive automatic stereoscopic warehouse goods space optimization method for electric power materials |
CN112478553A (en) * | 2020-12-11 | 2021-03-12 | 陕西科技大学 | Compact robot automatic storing and taking system cargo box closing method |
WO2022252268A1 (en) * | 2021-06-03 | 2022-12-08 | 江南大学 | Optimized scheduling method for intelligent stereoscopic warehouse |
CN113387105A (en) * | 2021-06-09 | 2021-09-14 | 意欧斯物流科技(上海)有限公司 | Simulation system for logistics transportation of vertical warehouse of tray stacker |
CN114417696A (en) * | 2021-12-07 | 2022-04-29 | 长春工业大学 | Automatic stereoscopic warehouse goods space allocation optimization method based on genetic algorithm |
CN114662396A (en) * | 2022-03-31 | 2022-06-24 | 重庆邮电大学 | A Multi-objective Warehouse Location Allocation Optimization Method Based on NSGA-II |
CN114662396B (en) * | 2022-03-31 | 2024-10-01 | 重庆邮电大学 | A multi-objective warehouse storage allocation optimization method based on NSGA-II |
CN114926001A (en) * | 2022-05-10 | 2022-08-19 | 康诚科瑞医药研发(武汉)有限公司 | Biological sample inventory management method, device, electronic device and storage medium |
CN117094648A (en) * | 2023-10-19 | 2023-11-21 | 安徽领云物联科技有限公司 | Visual management system of warehouse based on thing networking |
CN117094648B (en) * | 2023-10-19 | 2024-01-09 | 安徽领云物联科技有限公司 | Visual management system of warehouse based on thing networking |
Also Published As
Publication number | Publication date |
---|---|
CN108550007B (en) | 2021-09-28 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN108550007B (en) | Goods space optimization method and system for automatic stereoscopic warehouse of pharmaceutical enterprise | |
CN111178606B (en) | Automatic warehouse storage position allocation optimization method based on NSGA-II | |
CN113222293B (en) | Intelligent stereoscopic warehouse optimal scheduling method | |
CN109886478B (en) | Goods space optimization method for finished wine automatic stereoscopic warehouse | |
CN107480922B (en) | Establishment method of cargo space allocation and scheduling model under the two-vehicle operation mode of two-end type on the same track | |
CN103559396B (en) | Based on the automatic dispensary stock's allocation optimization method improving chaos particle cluster algorithm | |
CN110084545B (en) | An Integrated Scheduling Method for Multi-Aisle Automated Stereoscopic Warehouse Based on Mixed Integer Programming Model | |
CN102663571B (en) | Method for optimizing and screening storage locations of intelligent categorized storage system in electronic commerce | |
CN113222410B (en) | A method for establishing a cargo space allocation model in a two-way layout mode | |
CN110980082A (en) | Automatic stereoscopic warehouse position allocation method | |
CN109359739A (en) | Genetic Algorithm-Based Stacking Combination Method, Apparatus, Equipment and Storage Medium | |
CN111815233B (en) | Goods position optimization method based on total logistics amount and energy consumption | |
CN114417696A (en) | Automatic stereoscopic warehouse goods space allocation optimization method based on genetic algorithm | |
CN111798140A (en) | An intelligent arrangement method for warehousing goods | |
CN103049800A (en) | Multi-target optimization method for dispatching of automatic stereoscopic warehouse with limitation on storage time | |
CN112989696A (en) | Automatic picking system goods location optimization method and system based on mobile robot | |
CN105858043B (en) | The warehousing system Optimization Scheduling that a kind of lift is combined with shuttle | |
CN115115256A (en) | Medicine warehouse goods space distribution method | |
CN109081030A (en) | A kind of method for optimizing configuration of the intensive warehousing system of primary and secondary shuttle vehicle type | |
CN115730789A (en) | ASRS task scheduling and goods allocation method and system under classified storage | |
CN115303689A (en) | A method for optimizing cargo space allocation in a multi-lane three-dimensional warehouse | |
CN117371918A (en) | Goods space distribution two-stage optimization method and system based on improved order association rule | |
CN111056210A (en) | Container position adjustment method and device, storage system, medium and electronic equipment | |
CN112990818A (en) | Automatic warehouse goods space optimization method and system based on auction mechanism | |
Wang et al. | Storage assignment optimization for fishbone robotic mobile fulfillment systems |
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 |