易腐产品运输调度问题的优化  

Optimization of Perishable Products in Incident Vehicle Route Problem

作　　者：汤雅连[1] 蔡延光[1] 章云[1] 乐峰[1] 

机构地区：[1]广东工业大学自动化学院,广州510006

出　　处：《计算机系统应用》2013年第8期136-140,共5页Computer Systems & Applications

基　　金：国家自然科学基金(61074147;60374062;61074185);广东省自然科学基金(S2011010005059;8351009001000002);广东省教育部产学研结合项目(2012B091000171;2011B090400460);广东省科技计划项目(2012B050600028;2010B090301042)

摘　　要：针对易腐产品在运输过程中容易变质,具有时效性和货物关联性的特点,构建一种带软时间窗的关联运输调度问题的数学模型来考虑易腐产品的配送,并采用免疫克隆选择算法求解这个复杂问题.通过对该问题进行分析建模和数值求解,说明了该模型和算法的合理性和有效性.与遗传算法相比较,免疫克隆选择算法能更有效地解决关联运输调度问题.The perishable products go bad easily in transportational process and have the trait of timeliness and incident among goods. This paper proposed a mathematical model of Incident Vehicle Route Problem with Time Window （IVRPTW） to consider production distribution for perishable products.And adapt the Immune Clonal Selection Algorithm（ICSA） to solve this complex problem. On the basis of modeling and simulating examples of this problem, it is shown that the programming model and algorithm are reasonable and efficient.Experiment result also shows the immune clonal selection algorithm can find the optimal or nearly optimal solution effectively compared with the genetic algorithm.

关 键 词：易腐产品 关联运输调度问题 免疫克隆选择算法 遗传算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]