检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李珍萍[1] 杨光 Li Zhenping;Yang Guang(School of Information,Beijing Wuzi University,Beijing 101149,China)
出 处:《物流技术》2019年第1期68-71,119,共5页Logistics Technology
基 金:国家自然科学基金项目(71771028);北京市属高校高水平创新团队建设计划项目(IDHT20180510);北京市智能物流协同创新中心
摘 要:研究了成品油中转油库选址问题,以中转油库位置坐标为决策变量、总成本极小化为目标函数,建立了混合整数规划模型,并设计了求解模型的两阶段算法。第一阶段根据各个加油站的需求量及油库的平均服务能力确定拟建中转油库数量,并设计聚类算法对加油站进行分组,使得每组加油站恰好由一个中转油库提供服务;第二阶段确定每组加油站对应的中转油库最佳位置,将该问题转化为一个无约束优化问题并利用Matlab优化工具箱进行求解。最后利用炼油厂和北京地区100个加油站的基础数据构造具体算例,验证了模型和算法的有效性。该模型和算法可以为解决成品油中转油库选址问题提供决策依据。This paper studies the location problem of a refined oil transfer depot. With the positional coordinates of the oil transfer depot as the decision variables and the minimization of the total cost as the objective function, a mixed integer programming model is established and a two-stage algorithm designed for its solution. In the first stage, the number of the proposed depots is determined according to the demand volume of each gas station and the average service capacity of the depots, and a clustering algorithm is designed to group the gas stations so that each group is served by one depot. The second stage determines the optimal position of the corresponding oil depot in each group, transforms the problem into an unconstrained optimization problem and solves it with the Matlab toolkit. Finally, using the basic data of a refinery and 100 gas stations in the Beijing area, a specific numerical example is constructed to verify the validity of the model and algorithm. The model and algorithm are proven to be able to provide the decision-making basis for solving the location problem of the refined oil transfer depot.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3