检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵新标 刘心雨 夏晓梅[1] 项俊平 赵靖[1] ZHAO Xinbiao;LIU Xinyu;XIA Xiaomei;XIANG Junping;ZHAO Jing(Business School,University of Shanghai for Science and Technology,Shanghai 200093,China;Lianyungang JARI Electronics Co.,Ltd,Lianyungang Jiangsu 222006,China)
机构地区:[1]上海理工大学管理学院,上海200093 [2]连云港杰瑞电子有限公司,江苏连云港222006
出 处:《智能计算机与应用》2023年第11期202-207,共6页Intelligent Computer and Applications
基 金:上海市科技创新行动计划项目(23692112200);上海市浦江人才计划(21PJC085);上海市曙光计划(22SG45)。
摘 要:城市公交运行过程中,当在同一站点的多条线路之间相互换乘的需求都较大时,常规调度方式无法满足此需求。因此本研究提出对公交车辆在换乘站点的驻站时间进行控制,延长先到站车辆在换乘站点的驻站时间,促使先到站车辆可在换乘站点等待有换乘关系车辆,从而使得非同时到站车辆依然可以实现多线路乘客相互换乘。本研究首先以乘客平均行程时间最小为优化目标,考虑发车间隔以及驻站时间的限制,提出非线性规划模型,对多线路公交的发车频率以及在换乘站点的驻站时间进行优化。其次,设计了分步优化算法,考虑发车间隔组合不同时,可行解结构不一致的情况。从约束条件出发,首先生成可行解集,再依据发车间隔组合的不同,将解集分成多个子集,运用邻域搜索算法分别对每个子集进行搜索,从而避免搜索过程中对可行解结构进行重复判断。最后基于算例验证模型与算法的有效性,结果表明,与常规调度策略相比,本研究提出的调度策略可使乘客平均行程时间减少11.23%。During the operation of urban public transportation,when there is a large demand for mutual transfer between multiple lines at the same station,the conventional scheduling method cannot meet this demand.Therefore,this study proposes to control the dwell time of public transportation vehicles at transfer stations.The main approach is to extend the dwell time of first arriving vehicles at the transfer station,so that first arriving vehicles can wait for vehicles with transfer relationships at the transfer station.This makes it possible for non-simultaneously arriving vehicles to enable multi-line passengers to transfer.Firstly,the optimization goal is to minimize the average travel time of passengers.Considering the constraints of departure intervals and dwell time,a nonlinear programming model is proposed to optimize the departure frequency of multi-line buses and the stop time at transfer stations.Secondly,a step-by-step optimization algorithm is designed.When the combinations of departure intervals are different,the feasible solution structures are inconsistent.Therefore,the feasible solution set is firstly generated under the condition of satisfying the constraints.Then,based on the different combinations of departure intervals,the solution set is divided into multiple subsets.And neighborhood search algorithms are used to search each subset separately to avoid repeated judgments on the feasible solution structure during the search process.Finally,the validity of the model and algorithm is verified based on a numerical example.The results show that,compared with the conventional scheduling strategy,the scheduling strategy proposed in this study can reduce the average travel time of passengers by 11.23%.
关 键 词:城市交通 多线路调度 驻站时间控制 分步优化算法
分 类 号:U491.17[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.129.194.130