基于大邻域搜索算法的D公司汽车备件库拣选优化

    Optimization of Picking in D Company's Automotive Spare Parts Warehouse Based on Large Neighborhood Search Algorithm

    • 摘要: 库内拣选在汽车备件库的仓库作业中占据重要地位,直接影响仓库作业的成本和效率。本文以D公司汽车备件库为研究对象,在考虑拣选时间限制、员工拣选能力和拣选距离等因素的基础上,构建了囊括最大拣选时间和累计拣选时间的多目标优化模型,旨在协同优化其拣选任务分配和路径规划问题,并利用自适应大邻域搜索算法得到最优方案。研究结果表明:1)与优化前相比,优化后的累计拣选时间降低14%以上,平均拣选路径缩短19%以上,员工的工作时长更加均衡,同时能以更短的路径完成更多的拣选任务,显著提升了作业效率。2)在数值实验中,2 000个订单行任务可快速规划出较优的任务分配方案和相应的拣选路径,实现了短时间快速求解大规模任务分配问题的目标。研究成果不仅对提升备件库拣选效率有指导意义,同时为相关行业的仓库拣选作业效率优化提供了借鉴。

       

      Abstract: In-warehouse picking operations play a crucial role in automotive spare parts warehouse operations, directly impacting warehouse operation costs and efficiency. Taking D′s automotive spare parts warehouse as the research subject, and considering constraints such as picking time limits, employee picking capacity, and picking distances, a multi-objective optimization model incorporating maximum picking time and cumulative picking time was developed. The model aims to synergistically optimize task allocation and route planning for picking operations, using an adaptive large neighborhood search algorithm to derive optimal solutions. The results are as follows. 1) Compared to the pre-optimization state, the optimized system has reduced employees′ cumulative picking time by over 14%, shortened average picking paths by over 19%, and balanced employee working hours more effectively. This enables employees to complete more picking tasks with shorter routes, thereby significantly improving work efficiency. 2) In numerical experiments, 2 000 order line tasks can be quickly planned to obtain an optimal task allocation scheme and corresponding picking paths, achieving the objective of rapidly solving large-scale task allocation problems in a short time. The research findings not only provide guidance for improving picking efficiency in spare parts warehouses, but also offer valuable insights for optimizing picking operation efficiency in related industries.

       

    /

    返回文章
    返回