检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王佳冬 袁振洲[1] Wang Jiadong;Yuan Zhenzhou(Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport of Ministry of Transport, Beijing Jiaotong University, Beijing 100044, China)
机构地区:[1]北京交通大学综合交通运输大数据应用技术交通运输行业重点实验室,北京100044
出 处:《东南大学学报(自然科学版)》2021年第1期161-170,共10页Journal of Southeast University:Natural Science Edition
基 金:国家重点基础研究发展计划资助项目(2012CB725403).
摘 要:针对突发运营中断下城市轨道交通与应急接运公交的换乘接续问题,考虑换乘客流的脉冲性特征,提出应急接运公交时刻表和行车计划综合优化模型.首先,分析城市轨道交通与应急接运公交的换乘接续关系,引入乘客容忍度判断接续是否有效.然后,建立双层规划模型,上层为时刻表优化模型,以换乘等车时间和换乘失败人数最小为目标,下层为行车计划优化模型,以公交运营成本最小为目标,并设计改进的模拟退火算法进行求解.最后,以上海轨道交通10号线进行算例分析.结果表明:与等间隔时刻表相比,提出的模型使总成本减少13.7%,乘客等车时间减少14.1%,换乘失败人数减少54.9%.To solve the problem of transfer coordination between urban rail transit(URT)and emergency feeder bus under metro disruption,considering the impulse characteristics of transfer passengers,an integrated optimization model of emergency feeder bus timetable and vehicle scheduling is proposed.First,the transfer connection between URT and emergency feeder bus is analyzed,and the effectiveness of the connection is determined according to the passenger tolerance.Then,the problem is formulated as a bi-level programming model.The upper model is to optimize bus timetable minimizing transfer waiting time and the number of failed transfers;the lower model is to optimize vehicle scheduling with the goal of minimum operation cost.A simulated-annealing(SA)-based heuristic algorithm is employed to solve the proposed model and generate approximate optimal solutions.In the case study of Line10 of Shanghai Metro,compared with the even-headway timetable,the proposed model can reduce total cost by 13.7%,passenger waiting time by 14.1%,and the number of failed transfers by 54.9%.
分 类 号:U492[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229