CAJ | 학술논문

研究了快速消费品仓库的储位优化问题.在充分考虑消费品中易碎产品特殊性的前提下,以拣货距离最短为目标,建立了储位优化问题的数学模型,并设计了求解储位优化问题的遗传算法.最后用Matlab进行编程和仿真,模拟计算结果显示,利用该方法优化储位,可以有效减少拣货期间的总行走距离.
연구료쾌속소비품창고적저위우화문제.재충분고필소비품중역쇄산품특수성적전제하,이간화거리최단위목표,건립료저위우화문제적수학모형,병설계료구해저위우화문제적유전산법.최후용Matlab진행편정화방진,모의계산결과현시,이용해방법우화저위,가이유효감소간화기간적총행주거리.
In this paper, we studied the storage space optimization of the fast-consuming products. After fully considering the uniqueness of the fragile consuming products, we built the storage space optimization model with the shortest picking distance as the objective, designed the genetic algorithm to solve the model, and at the end, simulated the problem through Matlab programming, whose result validated the model built in this paper.