编组站进路调度优化算法

分析编组站作业进路选排问题的本质,以各任务的延误时间加权值总和最小为最优目标,以任务的前后工序选择路径为动态约束,建立编组站作业进路调度数学模型,采用遗传算法求解。编码采用定长染色体,长度为任务的工序数,每个工序采用2段制,编码中的顺序唯一地确定了每工序对指定进路占用的起讫时间和指标递推,设计基于优先规则的编码算法步骤。为保证解的可行性,将编码合法化,对工序进行拓扑排序。递推计算工序开始时间和结束时间,进而计算编码的目标值,并将其转化为适应值。采用轮盘赌与最优性相结合的方法进行选择,设计基于位置成组移位的杂交算子和随机交换的变异算子。以某编组站为例进行模拟计算,结果证明该算法满足编组站进路调度工作的要求。     

城市轨道交通乘务排班计划方案评价方法

城市轨道交通乘务排班计划是在给定运行图的基础上制定乘务人员的工作计划,其优劣程度对城市轨道交通的运营效率和成本具有显著影响。目前有关乘务排班计划的评价方法方面还缺少深入细致的研究。在借鉴国内外研究成果的基础上,选取相关标准的符合程度、班次间的均衡程度和方案的费用大小这三个方面对城市轨道交通乘务排班计划进行评价,之后采用熵权法确定综合权重来进行综合评价。最后对三个实际方案进行了案例分析,验证了乘务排班计划方案评价方法的可行性。     

广州现代有轨电车综合运营调度系统建设方案研究

基于现代有轨电车自身建设特点,对广州市海珠区环岛新型有轨电车试验段工程运营调度相关弱电系统建设现状进行分析。结合现代有轨电车运营部门对调度系统的实际使用需求,阐述基于现代有轨电车应采用弱电各子系统核心功能相对独立性的集成原则,构建综合运营调度系统平台的集成思路和总体架构研究。提出可对弱电系统的传输网络、硬件设备、软件等方面进行资源整合,并总结综合运营调度系统平台的功能和特点,为广州市后续有轨电车线路建设提供重要的参考,同时也为国内现代城市交通体系的建设提供借鉴。     

Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling

Multi-state supernetworks have been advanced recently for modeling individual activity-travel scheduling decisions. The main advantage is that multi-dimensional choice facets are modeled simultaneously within an integral framework, supporting systematic assessments of a large spectrum of policies and emerging modalities. However, duration choice of activities and home-stay has not been incorporated in this formalism yet. This study models duration choice in the state-of-the-art multi-state supernetworks. An activity link with flexible duration is transformed into a time-expanded bipartite network; a home location is transformed into multiple time-expanded locations. Along with these extensions, multi-state supernetworks can also be coherently expanded in space–time. The derived properties are that any path through a space–time supernetwork still represents a consistent activity-travel pattern, duration choice are explicitly associated with activity timing, duration and chain, and home-based tours are generated endogenously. A forward recursive formulation is proposed to find the optimal patterns with the optimal worst-case run-time complexity. Consequently, the trade-off between travel and time allocation to activities and home-stay can be systematically captured.     

An optimization model for integrated planning of railway traffic and network maintenance

Railway transportation systems are important for society and have many challenging and important planning problems. Train services as well as maintenance of a railway network need to be scheduled efficiently, but have mostly been treated as two separate planning problems. Since these activities are mutually exclusive they must be coordinated and should ideally be planned together. In this paper we present a mixed integer programming model for solving an integrated railway traffic and network maintenance problem. The aim is to find a long term tactical plan that optimally schedules train free windows sufficient for a given volume of regular maintenance together with the wanted train traffic. A spatial and temporal aggregation is used for controlling the available network capacity. The properties of the proposed model are analyzed and computational experiments on various synthetic problem instances are reported. Model extensions and possible modifications are discussed as well as future research directions.     

基于多旅行商问题的应急设施服务区划分模型

基于多旅行商问题，增设集散中心需求及应急服务设施资源容量约束条件，以最小化遍历区域内全部集散中心的综合旅行时间成本为优化目标，构建一种应急设施服务区划分模型，确定各应急设施的服务区范围.设计一种复合算法求解模型，首先基于P-中值选址模型的优化理念，形成初始方案；继而加入禁忌搜索算法，结合LKH求解器对模型进行迭代优化求得最优解.基于宁波市北仑区实际拓扑网络进行案例分析，验证了模型和求解方法的有效性.     

中压直流综合电力系统燃油经济性调度策略

由于研究对象、运行要求和调控手段存在差异,陆用电力系统和传统船用电力系统的燃油经济性策略无法直接应用到中压直流综合电力系统中。针对中压直流综合电力系统的能量优化调控需求,建立综合电力系统燃油经济性调度模型,提出基于分层优化方法的系统燃油经济性调度优化算法,实现对整流发电机组出力的优化。同时,提出适用于中压直流综合电力系统燃油经济性优化调度的方法,实现对发电机出力的优化调度,并通过仿真试验验证该方法的有效性。     

变邻域搜索求解公共交通乘务调度问题

公共交通乘务调度问题是一个将车辆工作切分为一组合法班次的过程,它是NP难问题,许多求解方法的效率都与班次评价密不可分,本文通过裁剪TOPSIS方法(Technique for Order Preference by Similarity to an Ideal Solution)设计了TOPSIS班次评价方法.此外,通过裁剪变邻域搜索算法使之适合求解乘务调度问题,提出了基于变邻域搜索的乘务调度方法(Crew Scheduling Approach Based on Variable Neighbourhood Search,VNS),其中,并入了TOPSIS班次评价方法在调度过程中进行班次评价,设计了两种带概率的复合邻域结构以增加搜索的多样性,帮助跳出局部最优,在VNS中利用模拟退火算法进行局部搜索.利用中国公共交通中的11组实例进行了测试,测试结果表明,VNS优于两种新近提出的乘务调度方法,且其结果关于班次数接近于下界.     

A new approach for improving the performance of freight train timetabling of a single-track railway system

A new approach for improving the performance of freight train timetabling for single-track railways is proposed. Using the idea of a fixed-block signaling system, we develop a matrix representation to express the occupation of inter- and intra-station tracks by trains illustrating the train blocking time diagram in its entirety. Train departure times, dwell times, and unnecessary stopping are adjusted to reduce average train travel time and single train travel time. Conflicts between successive stations and within stations are identified and solved. A fuzzy logic system is further used to adjust the range of train departure times and checks are made to determine whether dwell times and time intervals can be adjusted for passenger and freight trains at congested stations to minimize train waiting times. By combining manual scheduling expertise with the fuzzy inference method, timetable efficiency is significantly improved and becomes more flexible.     

Capturing correlation with a mixed recursive logit model for activity-travel scheduling

Representing activity-travel scheduling decisions as path choices in a time–space network is an emerging approach in the literature. In this paper, we model choices of activity, location, timing and transport mode using such an approach and seek to estimate utility parameters of recursive logit models. Relaxing the independence from irrelevant alternatives (IIA) property of the logit model in this setting raises a number of challenges. First, overlap in the network may not fully characterize perceptual correlation between paths, due to their interpretation as activity schedules. Second, the large number of states that are needed to represent all possible locations, times and activity combinations imposes major computational challenges to estimate the model. We combine recent methodological developments to build on previous work by Blom Västberg et al. (2016) and allow to model complex and realistic correlation patterns in this type of network. We use sampled choices sets in order to estimate a mixed recursive logit model in reasonable time for large-scale, dense time-space networks. Importantly, the model retains the advantage of fast predictions without sampling choice sets. In addition to estimation results, we present an extensive empirical analysis which highlights the different substitution patterns when the IIA property is relaxed, and a cross-validation study which confirms improved out-of-sample fit.