检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李超婷 李敏 吴中明 LI Chao-ting;LI Min;WU Zhong-ming(School of Economics and Management, Southeast University, Nanjing 210096, China;School of Management and Engineering, Nanjing University, Nanjing 210093, China;School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing 210044, China)
机构地区:[1]东南大学经济管理学院,江苏南京210096 [2]南京大学工程管理学院,江苏南京210093 [3]南京信息工程大学管理工程学院,江苏南京210044
出 处:《运筹与管理》2021年第2期68-74,109,共8页Operations Research and Management Science
基 金:国家自然科学基金资助项目(11771078,71661147004);江苏省基础研究计划(自然科学基金)资助项目(BK20181258);江苏省研究生科研与实践创新计划项目(KYCX18_0200)。
摘 要:针对一次连续出行中两个路段各存在一个瓶颈的双瓶颈路段,研究了家庭出行者早高峰期间先后经过双瓶颈到达学校和工作地的出行行为。首先建立了无收费下的用户均衡模型,接着考虑了拥挤收费模型,并就学校工作地开始时间差值大小的不同展开讨论,分析得出对应系统总出行成本最优时的收费值和收费时窗。研究发现收费管理能够有效降低系统总成本,并且学校和工作地开始时间差较小时的系统总成本更低,最后,通过数值算例验证了高峰时长保持不变,且得出了使得系统出行成本最优时的收费方案。For the double bottlenecks traffic network containing one bottleneck in both of the two consecutive road part,the travel behavior of the household which needs to go through double bottlenecks to reach two destinations:the school and then the company are investigated.This paper firstly proposes the user equilibrium model under no-toll situation.Then,we study the congestion charge model,and according to the discussion on the difference of starting time between school and work,the optimal toll scheme and charging time window that minimize the system total cost are obtained.We find that congestion charge can effectively reduce the system cost,and that a lower system cost can be obtained when the difference between the two desired arrival times is small.Finally,the numerical results verify that the peak time length remains unchanged,and achieve the charging plan based on which the system cost is optimal.
分 类 号:U491[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.217.166.126