论文部分内容阅读
在LMRP模型基础上,从优化角度将配送中心建设成本设为配送中心规模的线性函数,构建基于可变建设成本的LMRP模型。依据选址模型与粒子群算法特性,设计了矩阵粒子作为粒子群启发式算法初始可行解。对已有的10节点、49节点、88节点算例进行近百次测试,确定针对LMRPVCC问题的粒子群算法参数。进而利用平均计算时间与平均质量2种指标对49节点算例进行测试,得到平均计算时间为23 s,满意解比其下界平均高出12.7%的测试结果。
Based on the LMRP model, the LMRP model based on variable construction cost is constructed from the perspective of optimizing the distribution center construction cost as a linear function of distribution center size. According to the characteristics of site selection model and particle swarm optimization, matrix particle is designed as initial feasible solution of particle swarm heuristic algorithm. The existing 10-node, 49-node and 88-node examples were tested nearly 100 times to determine the parameters of PSO for LMRPVCC. Furthermore, the 49-node case is tested by using two kinds of indexes: average calculation time and average quality. The average calculation time is 23s, and the satisfactory result is 12.7% higher than the lower bound.