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.     

An efficient and exact event-based algorithm for solving simplified first order dynamic network loading problems in continuous time

In this paper a novel solution algorithm is proposed for exactly solving simplified first order dynamic network loading (DNL) problems for any generalised network. This DNL solution algorithm, termed eLTM (event-based Link Transmission Model), is based on the seminal Lighthill–Witham–Richards (LWR) model, adopts a triangular fundamental diagram and includes a generalised first order node model formulation. Unlike virtually all DNL solution algorithms, eLTM does not rely on time discretisation, but instead adopts an event based approach. The main advantage of this approach is the possibility of yielding exact results. Furthermore, an approximate version of the same algorithm is introduced. The user can configure an a-priori threshold that dictates the approximation error (measurable a-posteriori). Using this approximation the computational effort required decreases significantly, making it especially suitable for large scale applications. The computational complexity is investigated and results are demonstrated via theoretical and real world case studies. Fixed periods of stationary demands are included adopting a matrix demand profile to mimic basic departure time demand fluctuations. Finally, the information loss of the approximate solution is assessed under different configurations.     

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.     

关于一类二阶共轭矩阵方程的解

考虑一类二阶共轭矩阵方程 B*X*AXB+B*X*C+C*XB+D=O 其中，B∈Cp×m，A∈n×n，C∈Cn×m，D∈Cm×m，在A＞O及A≥O，C或B为列满秩阵两种情况 下，此方程可解的充分必要条件，并在有解的情况下，给出了通解的显式表示。     

混合下单模式下在线餐饮订单配送优化模型

针对在线餐饮订单量激增及订单到达非均匀分布导致的调度不合理与资源浪费等问题，提出顾客提前下单与动态实时下单相结合的下单模式，研究此模式下订单配送优化. 考虑在线餐饮订单配送优化具有的动态VRP和多回程VRP属性，以最小化配送成本为目标，建立带有软时间窗的整数规划模型. 设计基于插入算法和2-opt 邻域搜索的混合启发式算法求解模型. 通过算例，分析提前下单顾客比例、提前下单时长等因素的影响. 结果表明，单个因素的增加会降低配送成本，当两者同时增加，因系统达到饱和使配送成本不升反降，因此要调整措施使顾客下单情况与系统配送能力相适应.     

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

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

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

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