共查询到17条相似文献,搜索用时 125 毫秒
1.
2.
基于数据挖掘的动态货位指派系统 总被引:1,自引:1,他引:0
目的为提高需求快速变化、波动较大的在线零售企业的仓库货位优化效率。方法利用数据仓库和数据挖掘法,研究基于复合规则的动态货位指派策略。对该货位指派的数据集成分析、指标计算、规则生成和货位指派等4个模块进行分析,并设计库区标定算法和规则生成算法来生成货位指派规则集。结果基于复合规则动态货位指派不仅能够节约拣货距离,而且拣货效率受需求变化的影响非常小。结论数值实验表明,与传统的货位指派策略相比,基于复合规则动态货位的指派系统可以得到更好的结果,并且在平均订单规模较大和需求偏度大的情况下效果更加明显。 相似文献
3.
目的对移动机器人拣货系统(RMFS)的货位指派问题进行研究,提出基于荷兰式拍卖机制的货位指派模型来提高RMFS的拣货效率。方法构建荷兰式拍卖模型并按周转率对指定区域的SKU进行逐步调整,以货位指派匹配度为期望指标,实现SKU的需求模式与仓库存储结构之间的合理匹配。结果通过与随机指派模型对比发现,在不同仓库规模、需求偏度、订单规模等情况下,基于荷兰式拍卖的货位指派方法可以使拣货路程下降21.15%、工作时间平均下降20.57%左右。结论与传统指派方法相比,提出的货位指派模型可以大幅度降低RMFS系统的拣货距离和时间,大幅度提升在线零售企业的RMFS的拣货效率。 相似文献
4.
5.
目的 针对双区型仓库,以拣货时间最短为目标函数构建数学模型,进一步提高拣货效率。方法 提出并设计动态货位调整与人工拣货协同作业的动态拣货策略,分别采用GA算法和GASA算法进行最优化求解。结果 GASA算法优于GA算法,拣货单为1张情况下的拣货时间可减少4%;与静态拣货策略相比,拣货单为10张情况下,采用GASA算法时,文中设计动态拣货策略下的拣货时间可减少6%,且随着拣货单数量的增加,拣货时间节约占比越大。结论 GASA算法较GA算法其求解动态拣货路径优化问题更高效、优化结果更好。文中所提动态拣货策略更方便实施,在静态拣货路径优化基础上,可进一步提高拣货效率,且拣货单越多,效果就越显著。 相似文献
6.
7.
目的 构建英式拍卖模型,以待指派商品品项(SKU)群的最低周转率为媒介,通过逐步提升最低周转率来实现待指派SKU与待指派区域货位数量的匹配。方法 针对移动机器人拣货系统(RMFS)中的货位指派,提出基于英式拍卖机制的货位指派方法,提升仓库拣货效率。结果 与随机指派相比,在不同仓库规模、订单规模、订单偏度的RMFS中采用英式拍卖货位指派机制,机器人行走路程下降比率在大型仓库中达30.17%,中型仓库的下降比率为27.31%,小型仓库的下降比率为24.13%。结论 采用英式拍卖机制在RFMS中进行货位指派可大幅度提高工作效率。 相似文献
8.
9.
为了推动鱼骨型仓库在实际场景下的应用,针对鱼骨型仓库布局下的拣货路径优化问题,构建待拣货点距离计算模型和以有载重、容积限制的多车拣货距离最短为总目标的拣选路径优化模型。考虑遗传算法(GA)全局搜索能力强、粒子群算法(GAPSO)收敛速度快以及蚁群算法(ACO)较强的局部寻优能力,提出一种解决拣选路径优化模型的混合算法(GA-PSO-ACO)。通过不同订单规模的仿真实验,得出该混合算法在适应度值、迭代次数、收敛速度等方面均优于GA算法和GAPSO算法,且在订单规模较大时,平均适应度值约降低8%,有效缩短了总拣选距离,验证了混合算法在解决鱼骨型仓库布局下的拣货路径问题的先进性和有效性,为解决此类仓库内部的拣货路径问题提供新的解决方法和思路。 相似文献
10.
对拣货方式、路径策略与存储策略进行协同研究,设计了具有代表性的策略组合。推出了不同路径策略下,实际拣货路径长度的计算公式。通过对各种策略组合仿真结果的比较分析,确定了3种策略的相对重要性:1)分批策略对减少拣货作业总时间影响最大;2)分类存储策略比随机存储策略所需的行走路径缩短很多;3)路径策略对拣货行走的时间的减少明显小于分批拣货方式和分类存储策略带来的拣货作业时间的减少。具体决策时,应优先考虑分类存储策略和分批拣货方式,在确定其已经有效的情况下再考虑路径策略,以使拣货效率达到整体最优。 相似文献
11.
目的 为缓解零售电商商品仓库占地面积广,拣选效率受限等问题。方法 文中就存储策略、指派策略以及路径策略方面对Auto Store仓储系统进行详尽的介绍,在此基础上流程化的分析Auto Store系统完成单次订单拣货作业的业务流程,并运用Anylogic软件对所提出的模型进行仿真和验证。结果 假定订单到达服从Erlang分布,在拣选车和工作站数量和拣选货物数量相同的情况下,对比了Auto Store仓储系统混存布局和传统布局的拣选效率,验证了混存布局的可行性。结论 同时对比基于2种任务指派策略,得出了以基于拣选时间最小化的指派策略下系统运作效率更优这一结论,对理论分析与仿真研究之间的结果进行分析比较,验证了模型的有效性。 相似文献
12.
目的 针对数字化生产车间工位物料需求时间的不确定,导致物料配送不准确、不及时的问题,提出一种动态物料配送策略。方法 首先,根据工位关联度和变动时间窗确定实时的配送工位和协同配送工位,设计基于工位排序的动态物料配送路径优化策略。其次,建立以配送成本和时间窗偏离惩罚成本综合最小为目标函数的数学模型。最后,提出并采用系统动力学仿真与蚁群遗传融合算法联合的方法对模型进行求解。结果 模拟算例表明,与静态物料配送优化策略相比,该策略的平均时间成本减少率为30.1%,平均库存减少率为14.86%。结论 该策略能够根据动态时间窗确定配送工位和协同工位,并实时调整配送顺序,实现物料配送的动态自适应性调整,降低总配送成本。融合算法在迭代次数、收敛性、最优解质量方面有明显优越性。 相似文献
13.
Increasing productivity and reducing labour cost in order picking processes are two major concerns for most warehouse managers. Particularly picker-to-parts order picking methods lead to low productivity as order pickers spend much of their time travelling along the aisles. To enhance order picking process performance, an increasing number of warehouses adopt the concept of dynamic storage where only those products needed for the current order batch are dynamically stored in the pick area, thereby reducing travel time. Other products are stored in a reserve area. We analyse the stability condition for a dynamic storage system with online order arrivals and develop a mathematical model to derive the maximum throughput a DSS can achieve and the minimum number of worker hours needed to obtain this throughput, for order picking systems with a single pick station. We discuss two applications of dynamic storage in order picking systems with multiple pick stations in series. In combination with simulation modelling, we are able to demonstrate that dynamic storage can increase throughput and reduce labour cost significantly. 相似文献
14.
In this paper, we consider an actual industrial warehouse order picking problem where goods are stored at multiple locations and the pick location of goods can be selected dynamically in near real time. We solve the problem using an intelligent agent-based model. The modeling framework is between the two extremes of hierarchical and heterarchical frameworks. It recognizes that horizontal as well as vertical decisions are made between various levels of controllers and that these have to be captured explicitly in the model. Entities (goods or parts) and resources (storage areas and order pickers) are modeled as intelligent agents that function in a co-operative manner so as to accomplish individual as well as system-wide goals. Scheduling and other decisions are taken by these agents in a dynamic real-time fashion based on conditions that exist at the time these decisions are made. To overcome the structural rigidity and lack of flexibility, a negotiation mechanism for real time task allocation is used 相似文献
15.
16.
Of all the warehouse activities, order picking is one of the most time-consuming and expensive. In order to improve the task, several researches have pointed out the need to consider jointly the layout of the warehouse, the storage assignment strategy and the routing policy to reduce travelled distances and picking time. This paper presents the storage assignment and travel distance estimation (SA&TDE) joint method, a new approach useful to design and evaluate a manual picker-to-parts picking system, focusing on goods allocation and distances estimation. Starting from a set of picking orders received in a certain time range, this approach allows to evaluate the combinations of product codes assigned to storage locations, aisles, sections or warehouse areas and to assess the most relevant ones, for the best location and warehouse layout, with the aim of ensuring optimal picking routes, through the application of the multinomial probability distribution. A case study is developed as well, in order to clarify the concept that underlies the SA&TDE joint method, and to show the validity and the flexibility of the approach, through the calculation of the saving at different levels of detail. 相似文献