摘要
本文基于物品间被同时订购的相关度,把物品进行分类处理,建立储位分配优化模型。货位优化后可以使相关性较高的物品聚集存放,又能使出库频率以及质量相对较高的物品存放在离出库口近的货位上。对于建立的优化模型,本文设计了一种基于贪婪算法的启发式算法来进行求解。
In this paper, the items are classified according to the order of the same time, and the optimization model of storage allocation is established. After slotting optimization can make highly correlated items aggregation storage, and can make the outbound frequency and quality relatively high items stored in from the storehouse mouth near the location. In this paper, a heuristic algorithm based on greedy algorithm is designed to solve the ootimization model.
出处
《江苏商论》
2016年第4期31-32,42,共3页
Jiangsu Commercial Forum
关键词
相似度
储位分配:能耗最小
贪婪算法
similarity
storage allocation
minimum energy consumption
greedy algorithm
