配送中心存储布局的一种动态调度方法  

Dynamic scheduling method on warehouse layout in distribution centers

作　　者：赵志彦[1] 詹原瑞[1] 李波[1] 

机构地区：[1]天津大学管理学院,天津300072

出　　处：《计算机应用》2008年第2期484-487,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(70572045)

摘　　要：货物在配送中心仓储空间内的定位可以描述为一个NP-Hard的装填问题。把仓储空间分为若干单位空间,并结合空间、时间性质,提出了货物存储空间动态调度的优化算法,在一段连续的调度计划时间段内,整个调度方法被分成三部分。第一部分通过考虑空间约束、离库时间产生对应于不同时间片的货物初步分组集合。第二部分设计了遗传算法来实现初步分组后的货物在单位空间内的优化布局。由于GA的全局搜索特性及精华策略、去负策略的应用,可以实现一个单位空间内的较优货物布局方案。为了克服零散货物占用空间的问题,第三部分是进行手工微调。最后两个仿真例子验证了所提方法的有效性。Locating the goods into the warehouse in distribution centers is a NP-Hard problem. In this paper, the warehouse was divided into some unit spaces. Integrating the properties of space and time, a dynamic algorithm for the warehouse scheduling in distribution centers was proposed. Within a period of schedule planning horizon, the whole scheduling problem was divided into three parts. The first part generated the initial set of goods with respect to every time slice by considering spatial constraints, arriving time and departure time of the goods; The second part realized the warehouse layout of the initial set of goods obtained in the first part via GA. Because the global searching property of GA, application of elite strategy and leaving minus strategy have been designed to realize the genetic operations, the preferable layout scheme can be found within a unit space. In the third part, the mutual adjustments were used to overcome the scrap in the unit space because of the small amount of goods. Finally, two simulation examples were performed to demonstrate the validity of the proposed optimization approach.

关 键 词：装填问题 存储布局 遗传算法 动态调度 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]