检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输与物流学院,成都610031
出 处:《交通运输工程与信息学报》2017年第1期28-33,共6页Journal of Transportation Engineering and Information
摘 要:单一城际客运专线开行方案优化问题本质上是一个给定客流O-D的最优列车停站组合方案问题。为了更好的满足城际旅客出行需要,将列车分为站站停列车、中途不停站直达列车、交错停站列车三类。以所有旅客的候车集结时间与中途停站时间之和最小为目标,满足车站的服务频率,所有客流均送至目的地等为约束条件,建立了城际列车开行方案优化模型。根据模型的约束是线性、目标函数非线性的特点,设计了求解该问题的混合遗传算法,仿真算例表明,算法的运行时间不超过300 s。The essence of the optimization of an intercity dedicated passenger railway line's operation plan is to determine the optimal train stop plan under a given passenger OD flow. In order to satisfy the travel demand of the intercity passengers, the trains were divided into three categories in this paper: all stop trains, through trains and skip-stop trains. Taking the minimization of the waiting time and dwell time in the intermediate stations of all the passengers as a target with the constraints of meeting the need of station service frequency and transiting all the passengers to their destinations, an optimization model was established. According to the objective function, a hybrid genet linearity of the ic algorithm for constraints and non-linearity this problem was designed. It i in the simulation result that the running time of the algorithm is not more than of the s shown 300 s.
分 类 号:U292.9[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43