基于多面体不确定性需求的鲁棒枢纽选址研究
发布时间：2018-10-22 15:29
【摘要】：针对枢纽选址问题中的P枢纽中值问题,枢纽决策往往会受到外界因素的干扰。如何解决检验枢纽网络在面对干扰时的调节能力,即枢纽网络的鲁棒性研究,对外界因素造成流量需求的不确定性进行建模,不确定性以不确定性集的形式表现,对不确定性集通过2种方式建模:一是软管模型,对经过所有枢纽总流量的上限进行建模;二是混合模型,对经过所有OD(运输网络中流量的起始点和目的地点)流量的上限和下限进行建模。模型求解方面,运用极大极小准则和Benders分解算法解决混合整数规划问题。算例分析建立在对比标准模型和多面体需求不确定性模型的计算结果上,在不同规模参数和不确定性集参数下设置算法试验,模型更直观、有效的研究枢纽位置在外界干扰下的鲁棒性。Benders算法通过仅分解枢纽变量解决问题,更有效的实现了模型的应用;运用CPLEX求解器实现算法实验。
[Abstract]:In order to solve the P-hub median problem, the decision-making of the hub is often interfered by external factors. How to solve the problem of how to test the adjustment ability of the hub network in the face of interference, that is, the robustness of the hub network, and to model the uncertainty caused by external factors, which is expressed in the form of uncertainty set. The uncertainty set is modeled in two ways: one is the hose model, which models the upper limit of the total flow through all the hubs, the other is the mixed model. The upper and lower limits of flow through all OD (starting and destination points of traffic in transport networks) are modeled. In solving the model, the Benders decomposition algorithm and the minimax criterion are used to solve the mixed integer programming problem. The example analysis is based on comparing the calculation results of standard model and polyhedron demand uncertainty model, and sets up algorithm experiment under different parameters of scale and uncertainty set, the model is more intuitionistic. The Benders algorithm solves the problem only by decomposing the hinge variables, and realizes the application of the model more effectively. The CPLEX solver is used to realize the algorithm experiment.
【作者单位】： 上海海事大学物流科学与工程研究中心物流研究中心;
【基金】：国家自然科学基金青年资助项目(71601114) 上海海事大学顶级期刊论文培养基金
【分类号】：U115
，
本文编号：2287549
[Abstract]:In order to solve the P-hub median problem, the decision-making of the hub is often interfered by external factors. How to solve the problem of how to test the adjustment ability of the hub network in the face of interference, that is, the robustness of the hub network, and to model the uncertainty caused by external factors, which is expressed in the form of uncertainty set. The uncertainty set is modeled in two ways: one is the hose model, which models the upper limit of the total flow through all the hubs, the other is the mixed model. The upper and lower limits of flow through all OD (starting and destination points of traffic in transport networks) are modeled. In solving the model, the Benders decomposition algorithm and the minimax criterion are used to solve the mixed integer programming problem. The example analysis is based on comparing the calculation results of standard model and polyhedron demand uncertainty model, and sets up algorithm experiment under different parameters of scale and uncertainty set, the model is more intuitionistic. The Benders algorithm solves the problem only by decomposing the hinge variables, and realizes the application of the model more effectively. The CPLEX solver is used to realize the algorithm experiment.
【作者单位】： 上海海事大学物流科学与工程研究中心物流研究中心;
【基金】：国家自然科学基金青年资助项目(71601114) 上海海事大学顶级期刊论文培养基金
【分类号】：U115
，
本文编号：2287549
本文链接：https://www.wllwen.com/kejilunwen/daoluqiaoliang/2287549.html
