检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:方春林 刘晓娟[1] 辛营营 罗欢 FANG Chunlin;LIU Xiaojuan;XIN Yingying;LUO Huan(School of Electronic and Information Engineering,Lanzhou Jiaotong University,Lanzhou Gansu 730070,China)
机构地区:[1]兰州交通大学电子与信息工程学院,兰州730070
出 处:《计算机应用》2018年第9期2725-2729,2752,共6页journal of Computer Applications
摘 要:轨道交通运营组织作为轨道交通运营企业管理的核心,在降低企业运营成本、提升服务水平和旅客出行效率方面起着非常重要的作用。提出一种基于人工蜂群(ABC)优化算法的列车行车间隔优化策略,在考虑运营企业和旅客各自利益的基础上,以列车发车间隔为决策变量,建立旅客平均候车时间最小和列车等候时间最大的双目标非线性规划模型。采用ABC算法对模型进行优化求解,结合京津城际铁路某日不同时段客流基础数据进行仿真,实例验证了所提算法和模型的有效性。As the core of the operation and management of a rail transit enterprise,the rail transit operation organization plays a very important role in reducing the operation cost of the enterprise,improving the service level and the travel efficiency of passengers.A strategy based on Artificial Bee Colony(ABC)optimization algorithm was proposed to optimize the train traffic interval.Based on the consideration of the respective interests of operators and passengers,the train departure interval was taken as the decision variable to establish a bi-objective nonlinear programming model for the lowest average passenger waiting time and the largest train waiting time.Artificial Bee Colony(ABC)algorithm was used to optimize the model.The simulation results on Beijing-Tianjin inter-city passenger flow at different times of a day demonstrate the effectiveness of the proposed algorithms and models.
关 键 词:客流特性 人工蜂群算法 行车间隔 规划模型 优化
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.4