The train platforming problem: The infrastructure management company perspective

If railway companies ask for station capacity numbers, their underlying question is in fact one about the platformability of extra trains. Train platformability depends not only on the infrastructure, buffer times, and the desired departure and arrival times of the trains, but also on route durations, which depend on train speeds and lengths, as well as on conflicts between routes at any given time. We consider all these factors in this paper. We assume a current train set and a future one, where the second is based on the expected traffic increase through the station considered. The platforming problem is about assigning a platform to each train, together with suitable in- and out-routes. Route choices lead to different route durations and imply different in-route-begin and out-route-end times. Our module platforms the maximum possible weighted sum of trains in the current and future train set. The resulting number of trains can be seen as the realistic capacity consumption of the schedule. Our goal function allows for current trains to be preferably allocated to their current platforms.Our module is able to deal with real stations and train sets in a few seconds and has been fully integrated by Infrabel, the Belgian Infrastructure Management Company, in their application called Ocapi, which is now used to platform existing and projected train sets and to determine the capacity consumption.     

Flexible feeder transit route design to enhance service accessibility in urban area

To improve the accessibility of transit system in urban areas, this paper presents a flexible feeder transit routing model that can serve irregular‐shaped networks. By integrating the cost efficiency of fixed‐route transit system and the flexibility of demand responsive transit system, the proposed model is capable of letting operating feeder busses temporarily deviate from their current route so as to serve the reported demand locations. With an objective of minimizing total bus travel time, a new operational mode is then proposed to allow busses to serve passengers on both street sides. In addition, when multiple feeder busses are operating in the target service area, the proposed model can provide an optimal plan to locate the nearest one to response to the demands. A three‐stage solution algorithm is also developed to yield meta‐optimal solutions to the problem in a reasonable amount of time by transforming the problem into a traveling salesman problem. Numerical studies have demonstrated the effectiveness of the proposed model as well as the heuristic solution approach. Copyright © 2015 John Wiley & Sons, Ltd.     

公路桥梁技术状况评定方法分析

根据实际工作经验详细分析了桥梁的技术状况评定方法,对计算过程进行了详细说明,并列举了在评定过程中需要注意的问题,提出了公路桥梁技术状况评定的建议。     

An inverse finite element method for the analysis of VIV data

This paper presents an algorithm for the frequency domain solution of dynamic linear “inverse” problems, that is for the processing of measurement data (strain, acceleration etc.) acquired on a mechanical structure, in order to estimate the loads acting on the structure and its corresponding response. The problem is formulated as a constrained (force equilibrium) optimization (small deviations from measurements, small loads) problem, which is transformed into an unconstrained problem, then into differential equations. The algorithm is applied to the estimation of hydrodynamic forces induced by the shedding of vortices from an offshore oil riser.     

奇摄动三阶非线性边值问题

利用微分不等式技巧和Volterra型积分算子，研究了三阶非线性奇摄动边值问题εx^(3)=f(t,x,x′,w(ε）x^(3)，ε），g（x′（0），x″（0）=0，x（1）=A，x′（1）=B的存在性及渐近估计。     

加快工程建设规范化、法制化,促进防洪、排涝工程监理的健康发展

本文主要介绍了日前福州市防洪、排涝工程监理存在的问题 ,面对二十一世纪 ,针对防洪、排涝工程监理事业的发展战略谈了看法。     

一种防欺骗的广义多秘密分享方案

秘密分享是信息安全和密码学的重要研究课题,对通信密钥管理和计算机网络安全具有重要意义。本文针对现有的多秘密分享方案不能有效地防止分发者和分享者的欺骗,以及子秘密恢复时计算复杂量大等问题,在基于离散对数与因式分解难题上,提出一种具有广义接入结构的高效的多秘密分享方案。该方案具有如下特点：可高效地检测秘密管理者与分享者的欺诈行为;秘密管理者只需公开少量数据就可动态地增加一个新子秘密;采用并行算法恢复子秘密;可高效地增加或删除成员,无需重新计算其他成员的秘密份额。该方案可在分布式会议秘密分配、安全分布式计算、电子商务等领域应用。     

一类运输工具带双重能力约束的LRP问题

分析了一类运输工具受双重能力约束的LRP问题，即在物流网络节点最大单批处理能力及运输工具总运输能力双重约束的情况下,如何进行物流中心选址和运输路线安排，使总的费用最小,模型假设网络系统满足如下条件：①节点的最大单批处理能力是逐层变化的，②货物只能用不同运输工具经过某一物流中心进行中转运输．文中建立了混合整数规划模型，提出了一种优化算法，并用优化算法对实例进行求解．     

A capacity restraint transit assignment with elastic line frequency

This paper proposes a new formulation for the capacity restraint transit assignment problem with elastic line frequency, in which the line frequency is related to the passenger flows on transit lines. A stochastic user equilibrium transit assignment model with congestion and elastic line frequency is proposed and the equivalent mathematical programming problem is also formulated. Since the passenger waiting time and the line capacity are dependent on the line frequency, a fixed point problem with respect to the line frequency is devised accordingly. The existence of the fixed point problem has been proved. A solution algorithm for the proposed model is presented. Finally, a numerical example is used to illustrate the application of the proposed model and solution algorithm.     

铁路轨枕现状及发展

研究目的:本文对轨枕的主要功能和分类方法加以论述,同时简述我国铁路轨枕的发展过程及存在的问题。研究方法:通过搜集资料了解我国铁路轨枕及城市轨道交通轨枕的发展历程;总结轨枕分类方法;介绍木枕、混凝土枕及城轨交通用特殊轨枕的主要特点,并调查研究了各类轨枕在设计、制造、使用、养护维修中存在的问题。研究结果:提供了先进国家适用于高速铁路轨枕的发展动态,以及我国已运营4年的秦沈客运专线用轨道板和正处于设计招标阶段的京津城际轨道交通用轨道板等信息。研究结论:我国铁路轨枕及城市轨道交通轨枕的发展应遵循:增加混凝土枕类型以满足不同铺设条件的需要;提高混凝土枕的使用寿命,并开发研制轨枕新品种,适应我国铁路高速、重载以及城市轨道交通迅猛发展的需求。