基于奇偶蚁群算法的印刷厂订单排序方法研究  

Research on Sorting Orders in Printing House Based on Odd-Even Ant Algorithm

作　　者：吴红[1] 王远世[1] 陈光聪[1] 陈浩钦[1] 

机构地区：[1]中山大学数学与计算科学学院,广州510275

出　　处：《现代计算机》2010年第7期9-12,15,共5页Modern Computer

基　　金：中山大学实验教学研究;改革基金项目(No.YJ200922)

摘　　要：印刷业是订单指向型产业,最小化误工订单数是印刷厂的生产目标,用什么方法对大量的订单进行排序生产以获取最佳绩效,是所有印刷厂要考虑的问题。提出适合印刷厂订单排序的奇偶蚁群算法,分析算法中的参数计算公式,并将奇偶蚁群算法与遗传算法和模拟退火算法进行试验对比,实验结果表明奇偶蚁群算法的优点。Printing is an order-oriented industry. To minimize the number of orders that are belated is the goal of the printing house. Every printing house has to consider how to sort the orders to gain the best performance. Proposes an Odd-Even Ant Algorithm to sort the orders in printing house, analyzes the calculation formulas of the parameters in Odd-Even Ant Algorithm. Experiment results show that Odd-Even Ant Algorithm performs well compared with Genetic Algorithm and Simulated Annealing.

关 键 词：印刷厂 订单排序 蚁群算法 

分 类 号：F407.84[经济管理—产业经济] TP301.6[自动化与计算机技术—计算机系统结构]