As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of c...As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.展开更多
针对电子废弃物逆向物流网络特点,从整体逆向物流选址优化角度,分析并确定了网络成本最优化混合整数线性规划(Mixed-Integer Linear Programming,MILP)模型.考虑废弃物的回收成本、处理成本、处理规模、经处理后碎片的销售收入、政府补...针对电子废弃物逆向物流网络特点,从整体逆向物流选址优化角度,分析并确定了网络成本最优化混合整数线性规划(Mixed-Integer Linear Programming,MILP)模型.考虑废弃物的回收成本、处理成本、处理规模、经处理后碎片的销售收入、政府补贴,以及由于专业分工所带来的在不同拆解处理厂间及不同粉碎处理厂间的物料流动,可以灵活支持子网络内各个企业间物流活动.此外模型支持多种类型的电子废弃物的输入,以及经处理后产生的多种不同的物料碎片的输出,帮助优化电子废弃物逆向物流网络中的选址和物料分配等问题.展开更多
基金Project(2011ZK2030)supported by the Soft Science Research Plan of Hunan Province,ChinaProject(2010ZDB42)supported by the Social Science Foundation of Hunan Province,China+1 种基金Projects(09A048,11B070)supported by the Science Research Foundation of Education Bureau of Hunan Province,ChinaProjects(2010GK3036,2011FJ6049)supported by the Science and Technology Plan of Hunan Province,China
文摘As the huge computation and easily trapped local optimum in remanufacturing closed-loop supply chain network (RCSCN) design considered, a genetic particle swarm optimization algorithm was proposed. The total cost of closed-loop supply chain was selected as fitness function, and a unique and tidy coding mode was adopted in the proposed algorithm. Then, some mutation and crossover operators were introduced to achieve discrete optimization of RCSCN structure. The simulation results show that the proposed algorithm can gain global optimal solution with good convergent performance and rapidity. The computing speed is only 22.16 s, which is shorter than those of the other optimization algorithms.
文摘针对电子废弃物逆向物流网络特点,从整体逆向物流选址优化角度,分析并确定了网络成本最优化混合整数线性规划(Mixed-Integer Linear Programming,MILP)模型.考虑废弃物的回收成本、处理成本、处理规模、经处理后碎片的销售收入、政府补贴,以及由于专业分工所带来的在不同拆解处理厂间及不同粉碎处理厂间的物料流动,可以灵活支持子网络内各个企业间物流活动.此外模型支持多种类型的电子废弃物的输入,以及经处理后产生的多种不同的物料碎片的输出,帮助优化电子废弃物逆向物流网络中的选址和物料分配等问题.
