基于蚁群算法的配送中心订单优化匹配  

Order Matching Problem Based on Ant Colony Algorithm

作　　者：薛召杰[1] 缪立新[1] 杨朋[1] 戚铭尧[1] 

机构地区：[1]清华大学,深圳研究生院现代物流研究中心,深圳518055

出　　处：《工业工程与管理》2011年第6期75-78,共4页Industrial Engineering and Management

摘　　要：结合半导体行业的特点,针对芯片配送中心拣货作业中的订单-货箱匹配问题进行研究。该问题优选合适的货箱,在保证满足订单需求数量的前提下,降低拆箱和翻倒箱的人工操作。建立了该问题的数学模型,并基于蚁群算法设计了求解该问题的启发式算法,最后借助实际的算例试验以及与已有算法相比较验证了算法的有效性。The problem of order-carton matching in a chip distribution center was studied considering the characteristics of the semiconductor industry.The problem was to choose the right cartons to meet the demand quantity of orders,minimizing the manual operation of unboxing and box overtuning.A mathematical model was proposed and a heuristic algorithm was developed based on the Ant Colony Algorithm（ACO）.At last real case study and the comparison with existing algorithm were conducted to validate the algorithm.

关 键 词：订单匹配 蚁群算法 多目标规划 配送中心 半导体 

分 类 号：F253.9[经济管理—国民经济]