基于遗传算法的储位优化问题研究

摘要

研究了快速消费品仓库的储位优化问题.在充分考虑消费品中易碎产品特殊性的前提下,以拣货距离最短为目标,建立了储位优化问题的数学模型,并设计了求解储位优化问题的遗传算法.最后用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.