基于Stackelberg对策的高速公路路网收费标准的研究-计算机应用技术专业论文.docxVIP

的遗传算法和模拟退火算法得到的求解结果以及程序运算时间表明，混合优化策 的遗传算法和模拟退火算法得到的求解结果以及程序运算时间表明，混合优化策 略在求解取层规划模型方面更为可靠、有效。 关键词：路网收费，用户均衡模型，管理者，经营者，用户，Stackelberg对策 双层规划模型，遗传一模拟退化混合优化策略 ABSTRACTThis ABSTRACT This dissertation determine toll standard for based Staekclberg game Optimal toil standard is key induce trafile flows distribute well improve the utilities of and its service quality and control the environmental pollution， which is essential network Decision toil for expressway network is different from congestion toll in view of the fact that financial of of the tolled road must be taken into besides the goal the manager(government)Generally，the manager aims of tile network and maximum of social welfare through the regularization of appropriate toll charge while the operator 。hopes the toll payment of principal and interest fulfillment of expected investment income is also important take choice ill toll seriously their travel little possible We propose four equilibrium models with toiled roads the network describe choices of users，namely equilibrium model with fixed elastic demand，system optimal distribution model and stochastic equilibrium model The generalized travel function presented in this considers things about users’travel it unifies deal of factors which have impact decisions of choice，such operating Cost，link tolls，link length，individual preference，link flows Furthermore，We divide the entire population of into several classes based vehicle types，then it is convenient for get link traffic and toll for various vehicle which toll charge expressway network is fare and reasonable That formulation of these models is equivalent with equilibrium condition is strictly proved， and algorithms for them given after discussion of uniqueness of their solutions Tile problem of decision toll standard for expressway network fits within the framework of Stackelberg game regarding and players the Consequently， snch game be expressed mathematically by bilevel programming The upper-level problem the