陣列式自動揀選系統(tǒng)配置優(yōu)化研究
發(fā)布時間：2019-06-04 03:32
【摘要】：隨著電子商務(wù)和連鎖零售行業(yè)的快速發(fā)展,配送中心的商品揀選日益呈現(xiàn)小批量、多品種、多批次、高時效的發(fā)展趨勢,對訂單拆零揀選作業(yè)提出了更高的要求。拆零揀選是指小于一箱數(shù)量的貨物揀選,由于每個訂單包含貨物數(shù)量較少,但需要從成千上萬種品項(the stock keeping unit, SKU)中快速揀選出貨物的最小包裝單位,且訂單數(shù)量龐大,所以拆零揀選是影響配送中心作業(yè)成本和訂單履行效率的重要因素之一。為有效提高拆零揀選效率的同時降低人員勞動強度,陣列式自動揀選系統(tǒng)設(shè)計研發(fā)并得到成功應(yīng)用。陣列式自動揀選系統(tǒng)是一類由大量水平傾斜式揀選通道在空間中排列組合而成的新型自動化拆零揀選系統(tǒng)。該系統(tǒng)的使用雖然可以提高揀選效率,但同時需要增加較多的人工補貨成本,因此,管理者希望針對現(xiàn)場已有陣列式自動揀選設(shè)備找到一種優(yōu)化的配置方式,實現(xiàn)陣列式自動揀選系統(tǒng)總節(jié)省人工成本最大、訂單處理總時間最小的目標。目前國內(nèi)外對于自動化揀選系統(tǒng)的研究多集中在A字機系統(tǒng),該系統(tǒng)的設(shè)備結(jié)構(gòu)和揀選控制方式與陣列式自動揀選機差別較大,多適用于揀選量集中于有限品項的訂單揀選。此外,現(xiàn)有關(guān)于自動化揀選系統(tǒng)配置優(yōu)化領(lǐng)域的文獻,多是以系統(tǒng)訂單處理總時間最小或節(jié)省人工成本最大為目標的優(yōu)化,綜合考慮系統(tǒng)成本與效率的多目標優(yōu)化研究較少�；诖�,本文提出以系統(tǒng)總節(jié)省人工成本最大、訂單處理總時間最小為目標的陣列式自動揀選系統(tǒng)配置優(yōu)化問題,通過對系統(tǒng)揀選品項選擇與通道配比、品項分配以及品項貨位分配的優(yōu)化,實現(xiàn)系統(tǒng)性能的綜合提高。本文主要內(nèi)容與成果如下：(1)系統(tǒng)揀選品項選擇與通道配比優(yōu)化子問題中,以系統(tǒng)總節(jié)省人工成本最大為目標的建立數(shù)學模型,提出啟發(fā)式算法求解。以同時采用陣列式自動揀選系統(tǒng)和人工揀選系統(tǒng)的雙分揀區(qū)為工程應(yīng)用背景,對該雙分揀區(qū)內(nèi)人工成本進行全面分析；在假設(shè)揀選品項確定的條件下,以陣列式自動揀選系統(tǒng)總節(jié)省人工成本最大為目標建立設(shè)備通道配比優(yōu)化數(shù)學模型,設(shè)計貪婪算法得出揀選通道合理配比方案；在此基礎(chǔ)上,將該問題推廣到人工和自動化雙分揀區(qū)系統(tǒng)品項分配中,歸結(jié)為一類特殊的背包問題,并給出啟發(fā)式算法。通過實例仿真從多角度分析了算法的有效性。(2)單機品項分配優(yōu)化子問題中,以串行合流下訂單處理總時間最小為目標建立品項分配數(shù)學模型,設(shè)計改進品項相似系數(shù)與聚類算法進行求解。將每個通道列視為一個揀貨區(qū),則陣列式自動揀選機屬于分區(qū)自動化揀選系統(tǒng)。在串行合流下,設(shè)備訂單處理總時間等于揀貨區(qū)揀選時間總和,以最小揀貨區(qū)揀選時間總和為目標建立品項分配模型。為求解該模型,將不同品項并行作業(yè)節(jié)省的獨立揀選時間作為品項相似系數(shù),提出基于該系數(shù)的搜索式層次聚類算法。該算法的核心思想是在滿足揀貨區(qū)內(nèi)空間約束的條件下,通過將相關(guān)性強的品項分配至同一揀貨區(qū),增加各揀貨區(qū)內(nèi)并行揀貨量,同時減少各訂單內(nèi)參與揀選的揀貨區(qū)個數(shù),實現(xiàn)系統(tǒng)分揀效率的提高。最后實例分析證明了改進品項相似系數(shù)的優(yōu)越性和搜索式層次聚類算法的有效性。(3)單機列品項貨位分配子問題中,以并行合流下訂單處理總時間最小為目標建立數(shù)學模型,在假設(shè)品項分配方案確定的條件下,設(shè)計聚類算法對模型求解。針對陣列式自動揀選機內(nèi)揀貨區(qū)串行揀選、并行合流的工作特點,分析揀貨區(qū)作業(yè)時序,建立單機訂單處理總時間數(shù)學模型,在假設(shè)品項分配方案確定的條件下,依據(jù)揀貨區(qū)內(nèi)品項集合生成列品項,將其歸結(jié)為以最大總虛擬視窗時差為目標的列品項貨位分配問題。為求解該問題,設(shè)計聚類算法,將相關(guān)性強的列品項分配至間隔距離遠的揀貨區(qū)存儲,以增大總虛擬視窗時差。實例仿真顯示算法可有效減少單機訂單處理總時間,提高作業(yè)效率。(4)根據(jù)各子問題討論結(jié)果,研究以系統(tǒng)總節(jié)省人工成本最大、訂單處理總時間最小為目標的串行合流下系統(tǒng)配置優(yōu)化問題及綜合求解方法。采用主要目標優(yōu)化法將雙目標優(yōu)化問題轉(zhuǎn)化為以系統(tǒng)總節(jié)省人工成本最大為目標、訂單處理總時間為約束的單目標優(yōu)化問題。提出啟發(fā)式迭代算法求解,該算法首先以系統(tǒng)總節(jié)省人工成本最大為目標確定揀選品項和通道配比,然后應(yīng)用搜索式層次聚類算法將品項在揀貨區(qū)間分配,確定系統(tǒng)初始配置方案。在此基礎(chǔ)上,設(shè)計配置方案迭代改進策略對初始配置方案進行調(diào)整,迭代優(yōu)化至恰好滿足系統(tǒng)揀選效率要求。實例分析證明了該方法的有效性和優(yōu)越性。
[Abstract]:With the rapid development of e-commerce and the chain-chain retail industry, the commodity selection of the distribution center increasingly presents the development trend of small-batch, multi-product, multi-batch and high-time-time. The removal and sorting means that the goods are sorted less than a box of goods, and since each order contains fewer goods, it is necessary to quickly pick out the minimum packing unit of the goods from the stock keeping unit (SKU), and the quantity of the order is large, Therefore, it is one of the important factors that affect the operation cost and the order fulfillment efficiency of the distribution center. In order to effectively improve the efficiency of sorting and sorting, the labor intensity of the personnel and the design and development of the array automatic sorting system are reduced, and the successful application is obtained. The array type automatic sorting system is a new type of automatic sorting and sorting system which is formed by arranging a large number of horizontal inclined sorting channels in the space. The use of the system can improve the sorting efficiency, but at the same time, more manual replenishment cost is required, and therefore, the manager wants to find an optimized configuration mode for the existing array automatic sorting equipment on the site, so that the overall saving labor cost of the array automatic sorting system is the largest, The objective of the order processing total time is the minimum. At present, the research of the automatic sorting system at home and abroad is mainly focused on the A-word system, and the device structure and the sorting control method of the system are different from the array type automatic sorting machine, so that the sorting quantity is applicable to the order picking of the limited items in the picking quantity. In addition, the existing literature on the optimization field of automatic picking system configuration is the optimization of the goal of minimizing the total time or saving the labor cost with the system order, and the multi-objective optimization of the system cost and efficiency is less. Based on this, this paper presents an array-type automatic picking system configuration optimization problem with the largest total cost of the system and the minimum total time of the order processing. The optimization of the selection and channel matching, the item allocation and the distribution of the goods item in the system is proposed. And the comprehensive improvement of the system performance is realized. The main contents and results of this paper are as follows: (1) The selection of the system's picking item and the optimization of the channel ratio, and the establishment of the mathematical model with the maximum total labor cost of the system as the target, and the heuristic algorithm to solve the problem. the double-sorting area of the array type automatic sorting system and the manual sorting system is simultaneously adopted as the engineering application background, and the labor cost in the double-sorting area is comprehensively analyzed; and under the condition that the sorting item is determined, in that method, an array-type automatic sorting system is used for automatically saving the labor cost and the target establishment equipment channel ratio optimization mathematical model, and a greedy algorithm is designed to obtain a reasonable proportioning scheme of the sorting channel; on the basis of that, the problem is generalized to the product item distribution in the manual and automatic double-sorting area, It boils down to a class of special knapsack problem and gives a heuristic algorithm. The effectiveness of the algorithm is analyzed from the multi-angle through the example simulation. (2) In the problem of single-machine item allocation and optimization, the mathematical model of the item allocation is set up with the minimum total time of the order processing at the serial confluence, and the similarity coefficient of the product item and the clustering algorithm are designed to solve the problem. Each channel column is considered as a pick-up area, and the array automatic sorting machine belongs to the partition automatic sorting system. In that serial confluence, the total time of the equipment order proces is equal to the sum of the picking time of the picking area, and the sum of the picking time of the minimum picking area is the target establishment item distribution model. In order to solve the model, a search-based hierarchical clustering algorithm based on this coefficient is proposed. The core idea of the algorithm is to improve the sorting efficiency of the system by distributing the item items with strong correlation to the same picking area under the condition that the space constraints in the picking area are met, increasing the parallel picking quantity in each sorting area, and simultaneously reducing the number of picking areas participating in the sorting in each order. At last, the advantage of the similarity coefficient of the improved item and the effectiveness of the search-based hierarchical clustering algorithm are proved. (3) In the problem of the allocation of the single-stand column item, the mathematical model is built with the minimum total time of the order processing under the parallel merging, and the model is solved by the design clustering algorithm under the condition that the item allocation scheme is determined. aiming at the working characteristics of serial sorting and parallel merging of a picking area in an array type automatic sorting machine, the working time sequence of the picking area is analyzed, a single-machine order processing total time mathematical model is established, It is attributed to the problem of the allocation of the item items with the maximum total virtual window time difference as the target. In order to solve the problem, a clustering algorithm is designed, and the relevant strong column items are distributed to the picking area far from the interval to increase the total virtual window time difference. An example simulation display algorithm can effectively reduce the total time of single-machine order processing and improve the operation efficiency. (4) Based on the results of each sub-problem, the system configuration optimization problem and the comprehensive solution method of the serial confluence with the maximum total cost of the system, the minimum total time of the order processing and the minimum total time of the order processing are studied. The main objective optimization method is used to transform the double objective optimization problem into a single objective optimization problem with the maximum total cost of the system as the target and the total time of the order processing as the constraint. In this paper, a heuristic iterative algorithm is proposed to solve the problem. The algorithm first determines the picking item and the channel ratio with the maximum of the total cost of the system. Then, the search-type hierarchical clustering algorithm is applied to allocate the product items in the picking interval, and the initial configuration scheme of the system is determined. On this basis, the design and configuration scheme iteration improvement strategy is used to adjust the initial configuration scheme, and the iteration is optimized to just meet the system picking efficiency requirements. The example analysis shows the effectiveness and superiority of the method.
【學位授予單位】：山東大學
【學位級別】：博士
【學位授予年份】：2015
【分類號】：TH692
本文編號：2492442
[Abstract]:With the rapid development of e-commerce and the chain-chain retail industry, the commodity selection of the distribution center increasingly presents the development trend of small-batch, multi-product, multi-batch and high-time-time. The removal and sorting means that the goods are sorted less than a box of goods, and since each order contains fewer goods, it is necessary to quickly pick out the minimum packing unit of the goods from the stock keeping unit (SKU), and the quantity of the order is large, Therefore, it is one of the important factors that affect the operation cost and the order fulfillment efficiency of the distribution center. In order to effectively improve the efficiency of sorting and sorting, the labor intensity of the personnel and the design and development of the array automatic sorting system are reduced, and the successful application is obtained. The array type automatic sorting system is a new type of automatic sorting and sorting system which is formed by arranging a large number of horizontal inclined sorting channels in the space. The use of the system can improve the sorting efficiency, but at the same time, more manual replenishment cost is required, and therefore, the manager wants to find an optimized configuration mode for the existing array automatic sorting equipment on the site, so that the overall saving labor cost of the array automatic sorting system is the largest, The objective of the order processing total time is the minimum. At present, the research of the automatic sorting system at home and abroad is mainly focused on the A-word system, and the device structure and the sorting control method of the system are different from the array type automatic sorting machine, so that the sorting quantity is applicable to the order picking of the limited items in the picking quantity. In addition, the existing literature on the optimization field of automatic picking system configuration is the optimization of the goal of minimizing the total time or saving the labor cost with the system order, and the multi-objective optimization of the system cost and efficiency is less. Based on this, this paper presents an array-type automatic picking system configuration optimization problem with the largest total cost of the system and the minimum total time of the order processing. The optimization of the selection and channel matching, the item allocation and the distribution of the goods item in the system is proposed. And the comprehensive improvement of the system performance is realized. The main contents and results of this paper are as follows: (1) The selection of the system's picking item and the optimization of the channel ratio, and the establishment of the mathematical model with the maximum total labor cost of the system as the target, and the heuristic algorithm to solve the problem. the double-sorting area of the array type automatic sorting system and the manual sorting system is simultaneously adopted as the engineering application background, and the labor cost in the double-sorting area is comprehensively analyzed; and under the condition that the sorting item is determined, in that method, an array-type automatic sorting system is used for automatically saving the labor cost and the target establishment equipment channel ratio optimization mathematical model, and a greedy algorithm is designed to obtain a reasonable proportioning scheme of the sorting channel; on the basis of that, the problem is generalized to the product item distribution in the manual and automatic double-sorting area, It boils down to a class of special knapsack problem and gives a heuristic algorithm. The effectiveness of the algorithm is analyzed from the multi-angle through the example simulation. (2) In the problem of single-machine item allocation and optimization, the mathematical model of the item allocation is set up with the minimum total time of the order processing at the serial confluence, and the similarity coefficient of the product item and the clustering algorithm are designed to solve the problem. Each channel column is considered as a pick-up area, and the array automatic sorting machine belongs to the partition automatic sorting system. In that serial confluence, the total time of the equipment order proces is equal to the sum of the picking time of the picking area, and the sum of the picking time of the minimum picking area is the target establishment item distribution model. In order to solve the model, a search-based hierarchical clustering algorithm based on this coefficient is proposed. The core idea of the algorithm is to improve the sorting efficiency of the system by distributing the item items with strong correlation to the same picking area under the condition that the space constraints in the picking area are met, increasing the parallel picking quantity in each sorting area, and simultaneously reducing the number of picking areas participating in the sorting in each order. At last, the advantage of the similarity coefficient of the improved item and the effectiveness of the search-based hierarchical clustering algorithm are proved. (3) In the problem of the allocation of the single-stand column item, the mathematical model is built with the minimum total time of the order processing under the parallel merging, and the model is solved by the design clustering algorithm under the condition that the item allocation scheme is determined. aiming at the working characteristics of serial sorting and parallel merging of a picking area in an array type automatic sorting machine, the working time sequence of the picking area is analyzed, a single-machine order processing total time mathematical model is established, It is attributed to the problem of the allocation of the item items with the maximum total virtual window time difference as the target. In order to solve the problem, a clustering algorithm is designed, and the relevant strong column items are distributed to the picking area far from the interval to increase the total virtual window time difference. An example simulation display algorithm can effectively reduce the total time of single-machine order processing and improve the operation efficiency. (4) Based on the results of each sub-problem, the system configuration optimization problem and the comprehensive solution method of the serial confluence with the maximum total cost of the system, the minimum total time of the order processing and the minimum total time of the order processing are studied. The main objective optimization method is used to transform the double objective optimization problem into a single objective optimization problem with the maximum total cost of the system as the target and the total time of the order processing as the constraint. In this paper, a heuristic iterative algorithm is proposed to solve the problem. The algorithm first determines the picking item and the channel ratio with the maximum of the total cost of the system. Then, the search-type hierarchical clustering algorithm is applied to allocate the product items in the picking interval, and the initial configuration scheme of the system is determined. On this basis, the design and configuration scheme iteration improvement strategy is used to adjust the initial configuration scheme, and the iteration is optimized to just meet the system picking efficiency requirements. The example analysis shows the effectiveness and superiority of the method.
【學位授予單位】：山東大學
【學位級別】：博士
【學位授予年份】：2015
【分類號】：TH692
【參考文獻】
相關(guān)期刊論文 前1條
1 李明;吳耀華;吳穎穎;陳寧寧;;人工與自動化雙分揀區(qū)系統(tǒng)品項分配優(yōu)化[J];機械工程學報;2015年10期
相關(guān)博士學位論文 前1條
1 張貽弓;基于分區(qū)揀選策略的分揀機系統(tǒng)綜合優(yōu)化研究[D];山東大學;2011年
，本文編號：2492442
本文鏈接：http://sikaile.net/jixiegongchenglunwen/2492442.html
最近更新
教材專著
