首页 | 官方网站   微博 | 高级检索  
     

基于遗传算法的订单拣货实时排序问题研究
引用本文:李艳茹.基于遗传算法的订单拣货实时排序问题研究[J].包装工程,2011,32(13):97-101.
作者姓名:李艳茹
作者单位:西南交通大学,成都,610031
摘    要:根据配送中心订单拣货问题的特点,以订单客户的满意度为目标,建立了数学模型,并设计了相应的遗传算法来求解该问题。在算例中,将遗传算法与先到先服务和最早工期优先规则进行了比较,结果表明,遗传算法可以明显优化目标函数值,有助于提高配送中心的拣货效率,提高客户满意度,具有良好的实用性。

关 键 词:订单拣货  批次拣货  实时  订单排序  遗传算法
收稿时间:5/9/2011 12:00:00 AM
修稿时间:2011/7/10 0:00:00

Study on Real-time Sequencing Problem of Order Picking Based on Genetic Algorithm
LI Yan-ru.Study on Real-time Sequencing Problem of Order Picking Based on Genetic Algorithm[J].Packaging Engineering,2011,32(13):97-101.
Authors:LI Yan-ru
Affiliation:LI Yan-ru(Southwest Jiaotong University,Chengdu 610031,China)
Abstract:According to the characteristics of order picking problem in DC,with customer's satisfaction as the objective,a mathematical model was established and corresponding Genetic Algorithm(GA) was designed to solve this problem.In the example,a comparison was made between GA and the two dispatching rules of First Come First Service(FCFS) and Earliest Due Date(EDD).The result showed that GA can apparently optimize the value of objective function,improve efficiency of order picking and satisfaction of costumer,and ...
Keywords:order picking  batch picking  real-time  order sequencing  genetic algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《包装工程》浏览原始摘要信息
点击此处可从《包装工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号