供应链订单分配优化模型及其模拟退火算法  

Simulated annealing algorithm to supply chain order allocation problem

作　　者：范志强[1,2] 

机构地区：[1]河南理工大学经济管理学院,河南焦作454000 [2]上海海事大学物流研究中心,上海200135

出　　处：《计算机工程与应用》2012年第25期28-33,共6页Computer Engineering and Applications

基　　金：河南省软科学研究项目(No.112400450285);河南省教育厅人文社科研究项目(No.2011-QN-063)

摘　　要：受4M1E(人、机、料、法、环)因素的随机波动影响,产品的制造过程通常是不完美的,从而产生不良产品。针对已有研究多忽略不良产品的特点,建立了更加符合实际需求的订单分配多目标混合整数规划模型,其优化目标为最小化交易成本、采购成本、不良产品数量、产品延迟交付数量,以及最大化供应商信誉评价。考虑到模型求解的复杂度,设计了一种模拟退火算法,并结合启发式规则避免了大量非法初始解与邻点解的出现。实验算例表明所建立的模型能够反映订单分配过程中的产品缺陷现象,其算法能够在允许的运算时间内获得稳定的满意解,并且随着算例规模的增大,其计算时间与优化结果均优于LINGO软件。Because of the stochastic fluctuations of man, machine, material, method and environment, defective items can not be avoided in the production process. Considering these characteristics, a more practical Mixed Inte- ger Programming （MIP） model is presented for supply chain order allocation problem, so as to minimizing the trans- action cost of purchasing from suppliers, purchasing cost, defective units, delivered units and maximizing the evalu- ation scores of the selected suppliers. Because of its difficulty, a Simulated Annealing （SA） algorithm combined with a heuristics rule is developed to solve the model and to avoid the illegal initial solutions and neighborhood solu- tions. Random instances show that the model provides systemic simulation for the whole decision-making process and reflects the product defect situation. And the results of SA are stable and acceptable in allowable CPU time. Computational experiments show that the SA heuristic algorithm outperforms LINGO with respect to solution quality and computational time when the instances become larger.

关 键 词：产品缺陷率 订单分配 混合整数规划模型 模拟退火算法 

分 类 号：F406[经济管理—产业经济]