检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]东北大学,辽宁沈阳110189 [2]华北理工大学,河北唐山063000
出 处:《华北理工大学学报(社会科学版)》2018年第1期40-52,共13页Journal of North China University of Science and Technology(Social Science Edition)
基 金:河北省钢铁联合基金项目号E2016209304课题
摘 要:随着全球经济的不断恶化,钢铁企业面临越来越不景气的业态。物流管理是人们寻找钢铁企业可能挖潜的"第三利润源"。钢铁企业要能优化配置原料资源,降低物流成本,提高物流效率。用列生成的方法解决该大规模整数规划问题。对0-1变量的线性松弛采用了启发式的分支和深度优先搜索策略来尽可能快地获得可行解。在分支结点上,通过求解最短路子问题获得限制主问题需要的列,分支树上的根结点提供了体现可行解质量的下界。从而得到球团、焦化、石灰、烧结、炼铁最合适的装卸搬运费、汽运费和临时用车费。With the worsening of the global economy,iron and steel enterprises face more and more weak forms.Logistics management is that people looking for iron and steel enterprises may be potential in "the third profit source".Iron and steel enterprises to optimize the raw material resources,reduce logistics cost,improve logistics efficiency.Use column generation method to solve the large integer programming problems.Linear relaxation of 0-1 variables using the heuristic branch and depth first search strategy to get the feasible solution as soon as possible.On the branch node,obtained by solving the shortest path problem limits the main issues that need to be listed,the branches of the tree root node provides a feasible solution of lower quality.Resulting in pellets,coking,lime,sintering,iron making,the most appropriate handling fees,trucks and makeshift fare.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117