编组站进路调度优化算法

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

The design of bus route systems — An interactive location-allocation approach

An interactive modelling approach is developed to solve the practical problem of bus route network design. Possible bus routes are identified with facilities which can be located. Zones or pairs of zones in the urban area are identified with customers who will be allocated to the established facilities. It is shown that the classical Set Covering Problem is useful under the assumption of fixed demand; the Simple Plant Location Problem is effective under the assumption of demand which is sensitive to the level of bus service provided.     

2020年世界船舶市场评述与2021年展望

回顾了2020年世界经济、航运、造船市场,并对2021年船舶市场进行展望。2020年新冠肺炎疫情席卷全球,全球经济整体呈现负增长,导致航运各细分市场情况迥异,除集运市场年底火热外,其他市场均处于低迷状态。新船交付量整体大幅回落,与去年同比减少约31%,市场出现大面积撤单现象,仅海工市场基本面向好。新船建造市场受疫情影响,与2019年同期相比下跌约11%,散货船是今年交付量中唯一呈现增长的船型。2021年预计世界经济同比大幅反弹,航运市场需求将强于供给,市场形势总体将优于2020年;同时,考虑到疫情对市场的影响效应短期持续,预计世界船舶市场将逐步趋于理性,主要船型的新船订单量将朝着长期均衡方向逐步恢复增长,并且绿色和智能依旧是未来的大方向。     

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

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

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

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

试论铁路职业卫生管理与技术服务支持

广州铁路集团公司是我国第一家铁路运输企业集团,职业卫生工作一直是企业卫生工作的重点,职业卫生管理和职业卫生技术服务也是企业履行社会责任、建立＂以人为本＂的现代企业制度的重要组成。通过分析铁路行业职业危害特点和职业卫生管理方面存在的问题,结合长期从事职业卫生技术服务工作的实践,提出加强与改进铁路企业职业卫生工作的对策,旨在助于促进《职业病防治法》在企业的全面贯彻落实。     

既有铁路扩能改造若干问题探讨

研究目的:根据新的技术政策、新的标准规范等要求,通过对既有线扩能改造中出现的与新的标准规范不相适应的若干问题的分析研究、对既有线通行双层集装箱的合理性及增建二线后改变维修体制的探讨,提出了觖决既有线扩能改造工程若干问题的基本思路。研究结论:对于既有线扩能改造工程的一些问题,应根据项目的特点,在本着避免既有线大拆大改、节省工程投资的原则下,结合铁路新的技术发展方向、新的标准规范要求,采取具体问题具体分析,对于新建线路应不折不扣地执行新的标准规范,对既有线改建则应充分考虑到既有线的现状特点,在满足项目功能需求的情况下,应尽可能地与新的标准、规范相适应,并应考虑未来的发展需要。     

多货物品种集装化运输的优化调度问题

用数学模型描述了供应商根据某一用户在各个不同时间段内对不同货物的需求量情况,利用各种不同型号的箱体进行分时段货物发送的问题。其最终目的是为了求得能够使运输成本和存储成本达到最小的货物发送方案,该问题是一个由批量问题和拼箱问题所组成的复合问题。就此问题,提出了一种三阶段算法。通过理论分析,该算法可以有效地解决此类问题。     

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.