节点文献
不确定环境下基于第三方回收再制造逆向物流网络设计
Remanufacturing Reverse Logistics Network Design Based on the Third-party Recovery under Uncertain Environment
【作者】 刘军;
【导师】 高阳;
【作者基本信息】 中南大学 , 管理科学与工程, 2013, 硕士
【摘要】 摘要:当前大部分关于逆向物流网络研究的文献,均集中在对确定环境下的逆向物流网络进行设计。大多由原始设备制造商回收,目标多是逆向物流总成本最小化,很少考虑不同主体各自收益的最大化。论文以导师承担的国家自然科学基金项目为选题背景,拟对不确定环境下基于第三方回收再制造逆向物流网络进行研究。论文的主要工作及成果如下:(1)针对废旧品回收量和消费区域需求量的不确定性,构建了多周期多目标再制造逆向物流网络静态选址模型。将网络中不确定参数用三角模糊数表示,利用模糊机会约束规划方法对模糊规划模型进行处理,将不确定模型转化为确定性模型。通过算例,分析了置信度水平a的变化对最优选址决策以及制造商总收益产生的影响,并利用目标规划法分析了第三方物流企业收益与制造商收益之间的关系。(2)在多周期多目标再制造逆向物流网络静态选址模型的基础上,将单个制造商参与扩展为多个制造商参与,将静态选址模型扩展为动态选址模型,建立了多个制造商参与下再制造逆向物流网络动态选址模型。将网络中不确定参数用随机参数表示,通过算例验证了该模型的有效性,利用约束法分析了各个目标之间的关系。并将动态选址模型与静态选址模型进行了比较。(3)在再制造逆向物流网络动态选址模型的基础上,考虑到检测/拆卸中心和再制造工厂处理能力可扩展的问题,构建了设施处理能力可扩展的再制造逆向物流网络模型,用加权法得出了整个系统的最大收益。通过确定各周期设施的开闭状态以及各设施处理能力的扩展模块,来最大化第三方物流企业和各制造商的总收益。用算例验证了模型的有效性,并将设施处理能力可扩展模型与设施处理能力不可扩展模型的求解结果进行了比较。(4)针对较复杂模型的求解问题,设计了将遗传算法与模拟退火算法相结合的混合智能算法,通过算例验证了算法的有效性。图12幅,表30个,参考文献104篇。
【Abstract】 Currently, most studies of reverse logistics network focused on the design of reverse logistics network under certain environment. The waste products are mostly recycled by original equipment manufacturers. The objective is usually minimizing the total cost of reverse logistics, with little consideration of maximizing the profit of each subject. The background of this paper is the National Natural Science Foundation which my tutor undertakes. The design of the remanufacturing reverse logistics network based on the third-party recovery under uncertain environment was studied.Main work and results of this paper are as follows:(1) To deal with uncertain quantities of products recovery and the demand of consumer markets, a static located model of multi-period and multi-objective was built. The uncertainty parameters were denoted by the triangular fuzzy numbers. With fuzzy chance constrained programming methods, the network model in the uncertain environment can be transferred into a certain equivalent model. The effect of changes of confidential level on both of the optimal location decisions and total revenue of the manufacturer was analyzed by a numerical example. The relationship between the benefit of both the third-party logistics supplier and the manufacturer was analyzed by goal programming method.(2) Based on the static located model of multi-period and multi-objective, the network was designed from a single manufacturer involved to multiple manufacturers participating in, and from the design of static network to dynamic network. A dynamic located model of multi-period remanufacturing reverse logistics network was established. The uncertainty parameters were denoted by the random parameters. The validity of the model was illustrated by a numerical example, and the relationship between each goal was analyzed by constraint method. The result of the dynamic located model was compared with the static located model.(3) Based on the dynamic located model of multi-period remanufacturing reverse logistics network, and considering the capacity expansion of inspection/disassembly centers and remanufacturing plants, the remanufacturing reverse logistics network that the capacity of facilities can be expanded was built. The maximum benefit of the entire system was gain by weighted method. The total benefit of the third-party logistics supplier and each manufacturer was maximized by the opening or closing state of facilities and numbers of modules that the capacity of each facility can be expanded every period. The utility of the model was illustrated by a numerical example, and solution results of the model of facility capacity can be expanded and the model of facility capacity cannot be expanded were compared.(4) To deal with the solution of more complex model, a hybrid intelligent algorithm consisting of genetic algorithm and simulated annealing algorithm has been designed. The utility of the algorithm was illustrated by the numerical example.
【Key words】 reverse logistics network; remanufacturing; thethird-party logistics supplier; dynamic location; hybrid intelligentalgorithm;