检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《物流技术》2013年第1期101-103,共3页Logistics Technology
基 金:国家社会科学基金西部项目(11XJY027);中央高校基本科研业务费专项资金项目(CHDW2011JC022);长安大学基础研究支持计划专项基金
摘 要:利用博弈论方法对物流运输网络收费道路合理定价问题进行研究。将物流运输网络中道路通行费率制定者和道路使用者看成是博弈的双方,并利用一个两级数学规划模型对博弈过程进行描述,上层是道路管理者基于运输网络效率最大化的收费道路最优定价决策问题,下层是交通均衡问题,利用分枝解法进行模型求解,最后给出了一个简单算例来演示物流运输网络收费道路最优定价过程。结果显示,基于博弈理论的物流运输网络收费道路最优定价方法是可操作的和科学的,为科学设计收费公路最优定价提供了理论支撑。In this paper, we used the game theory to study the reasonable pricing problem of the toll way in logistics transportation network. We first saw the policy maker of the toll way and the user of the toll way as the two parties in a game, then used a two-echelon mathematical programming model to describe the game process, the upper echelon being the optimal price decision problem of the toll way administrator based on maximization of transportation network efficiency and the lower one being a problem of traffic equilibrium and finally employed the branching method to solve the model. At the end we presented a simple numerical example to demonstrate the optimal pricing process. The result showed that the pricing method proposed in this paper was feasible and scientific, which offered theoretical support for the scientific design and charge of toll ways.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249