摘要
在第三方逆向物流企业的参与下,建立了回收利用电子废弃物的逆向物流网络,并基于混合整数规划方法提出一个多产品、多阶段的网络优化模型,目标是使网络总成本最小化。为求解这一复杂问题,利用拉格朗日松弛法将问题分解为简单的子问题,同时为得到问题的可行解,在求解子问题基础上设计了启发式算法,通过迭代更新拉格朗日乘子,可以逐步获得问题的最优解,并在此基础上给出了求解问题的具体算法步骤。
In this paper, we established the reverse logistics network for the reclamation and recycling of electronic wastes and proposed a multi- product multi- stage network optimization model based on hybrid integer programming that was aimed at minimizing total network cost. Then we used the lagrangian relaxation to turn the solution of the model into several simple sub- problems, designed a heuristic algorithm and on such basis provided the procedures of the solution of the model.
出处
《物流技术》
北大核心
2013年第11期217-220,350,共5页
Logistics Technology
基金
国家自然科学基金(70971079)
关键词
第三方逆向物流
混合整数规划
拉格朗日松弛法
启发式算法
third party reverse logistics
hybrid integer programming
lagrangian relaxation
heuristic algorithm
