摘要
以拣选所有订单的行走距离最短为目标,研究了配送中心内订单分批拣选的优化问题.文中采用了遗传算法来优化订单的分批组合,不同于先前的分批优化方法,本文在订单分批时,考虑了种子订单的选择方法,通过种子订单的有效选取,使拣选总距离得到了明显的优化.
We address the problem ofbatching orders in a parallel-aisle warehouse, with the objective to minimize the travel distance of picking all of the batches. This study develops an order batching approach based on genetic algorithms (GAs). Unlike to previous batching methods, in this paper it pays attention on the selection of seed orders. And it does reduce the distance of picking obvipusly, comparing with other's approach.
出处
《河北工业大学学报》
CAS
北大核心
2009年第5期10-14,共5页
Journal of Hebei University of Technology
基金
河北省自然科学基金(G200800122)