关键词: 供应链, 混合整数规划模型, 遗传算法, 线性交易费用函数, 订单分配

Abstract: The transaction costs are proportional to the transaction volume in LSSC order allocation problem. Considering this characteristic, the transaction costs are expressed as linear function. A new mixed integer programming model for LSSC order allocation problem is established, so as to minimize the transaction costs, purchasing costs, rejected units and late delivered units. Because it is NP-hard in nature, a genetic algorithm combined with a heuristics rule is developed to solve the model and to avoid the illegal initial solutions. Random instances show that the model provides systemic simulation for the whole decision-making process and reflects the linear transaction costs factor. And the results of GA are stable and acceptable in allowable CPU time. Computational experiments show that the GA heuristic algorithm outperforms LINGO with respect to solution quality and computational time when the instances become larger.

Key words: supply chain, mixed integer programming model, genetic algorithm, linear transaction costs function, order allocation