基于Lab VIEW的分体自升式平台水下对接监测系统研制

为了实现分体平台上下箱体水下高效安全对接,对分体平台水下对接监控关键技术进行分析。运用虚拟仪器技术,采用MEMS三轴加速度传感器设计对接过程监测系统。实验结果表明,该系统具有监测精度高,响应速度快,抗干扰性能强等特点,满足平台对接监控技术要求。     

无锡市高铁商务区综合管廊设计

综合管廊作为一种新型的市政管线敷设形式,可以有效地避免道路的重复开挖,预留宝贵的地下空间,具有广阔的发展前景。该文从系统方案、标准断面、管廊节点、结构设计及附属系统五个方面简要介绍了无锡市高铁商务区综合管廊的设计理念,并总结了设计与建设过程中的经验。     

MIDAS/Civil分体式小箱梁湿接缝模拟方法

以由3片分体式组合箱梁组成的30 m三跨连续梁桥为研究对象,利用大型有限元软件MIDAS/Civil,建立了3种湿接缝模拟方法的梁单元模型,分别为湿接缝换算法、刚接梁法、横向虚拟梁法。对比分析3种计算模型在3种荷载工况下各片箱梁的边跨跨中与中跨跨中位移解。计算结果表明:实体模型计算结果准确但建模复杂,与之相比,湿接缝换算法、刚接梁法、横向虚拟梁法模型建模较简单,最大误差为6.4%;湿接缝换算法、刚接梁法、横向虚拟梁法是分体式组合小箱梁桥的较合适建模方法,可用于分体式组合小箱梁桥结构分析。     

水泥混凝土路面加铺沥青面层结构抗裂缝扩展性能研究

该文介绍了水泥混凝土路面加铺沥青面层结构抗裂缝扩展性能的研究。为了解不同措施延缓水泥混凝土路面加铺沥青层结构反射裂缝的效果,建立了考虑接缝传荷能力的水泥混凝土路面加铺沥青面层结构三维有限元分析模型,以Paris裂缝扩展寿命描述反射裂缝扩展。研究发现各种措施扩展寿命大小差异与接缝弯沉差有关。防裂贴与应力吸收层组合结构的扩展寿命最大,土工布与防裂贴扩展寿命接近。不同防反措施扩展寿命随接缝弯沉差的衰减速率大小为:防裂贴加应力吸收层,应力吸收层,玻纤格栅,土工布,直接加铺。     

Analyzing the theoretical capacity of railway networks with a radial-backbone topology

In this work we propose a mechanism to optimize the capacity of the main corridor within a railway network with a radial-backbone or X-tree structure. The radial-backbone (or X-tree) structure is composed of two types of lines: the primary lines that travel exclusively on the common backbone (main corridor) and radial lines which, starting from the common backbone, branch out to individual locations. We define possible line configurations as binary strings and propose operators on them for their analysis, yielding an effective algorithm for generating an optimal design and train frequencies. We test our algorithm on real data for the high speed line Madrid–Seville. A frequency plan consistent with the optimal capacity is then proposed in order to eliminate the number of transfers between lines as well as to minimize the network fleet size, determining the minimum number of vehicles needed to serve all travel demand at maximum occupancy.     

Integrating capacity analysis with high-speed railway timetabling: A minimum cycle time calculation model with flexible overtaking constraints and intelligent enumeration

Compared with most optimization methods for capacity evaluation, integrating capacity analysis with timetabling can reveal the types of train line plans and operating rules that have a positive influence on improving capacity utilization as well as yielding more accurate analyses. For most capacity analyses and cyclic timetabling methods, the cycle time is a constant (e.g., one or two hours). In this paper, we propose a minimum cycle time calculation (MCTC) model based on the periodic event scheduling problem (PESP) for a given train line plan, which is promising for macroscopic train timetabling and capacity analysis. In accordance with train operating rules, a non-collision constraint and a series of flexible overtaking constraints (FOCs) are constructed based on variations of the original binary variables in the PESP. Because of the complexity of the PESP, an iterative approximation (IA) method for integration with the CPLEX solver is proposed. Finally, two hypothetical cases are considered to analyze railway capacity, and several influencing factors are studied, including train regularity, train speed, line plan specifications (train stops), overtaking and train heterogeneity. The MCTC model and IA method are used to test a real-world case involving the timetable of the Beijing–Shanghai high-speed railway in China.     

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.     

Containership scheduling with transit-time-sensitive container shipment demand

This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of the problem structure, a branch-and-bound based holistic solution method is developed. It is rigorously demonstrated that this solution method can obtain an ε-optimal solution in a finite number of iterations for general forms of transit-time-sensitive demand. Computational results based on a trans-Pacific liner ship route demonstrate the applicability and efficiency of the solution method.     

Innovative systems for the transportation disadvantaged: Toward more efficient and operationally usable planning tools

When considering innovative forms of public transport for specific groups, such as demand responsive services, the challenge is to find a good balance between operational efficiency and 'user friendliness' of the scheduling algorithm even when specialized skills are not available. Regret insertion-based processes have shown their effectiveness in addressing this specific concern. We introduce a new class of hybrid regret measures to understand better why the behaviour of this kind of heuristic is superior to that of other insertion rules. Our analyses show the importance of keeping a good balance between short- and long-term strategies during the solution process. We also use this methodology to investigate the relationship between the number of vehicles needed and total distance covered - the key point of any cost analysis striving for greater efficiency. Against expectations, in most cases decreasing fleet size leads to savings in vehicle mileage, since the heuristic solution is still far from optimality.     

Energy-aware control for automated container terminals using integrated flow shop scheduling and optimal control

The performance of container terminals needs to be improved to handle the growth of transported containers and maintain port sustainability. This paper provides a methodology for improving the handling capacity of an automated container terminal in an energy-efficient way. The behavior of a container terminal is considered as consisting of a higher level and a lower level represented by discrete-event dynamics and continuous-time dynamics, respectively. These dynamics represent the behavior of a large number of terminal equipment. The dynamics need to be controlled. For controlling the higher level dynamics, a minimal makespan problem is solved. For this, the minimal time required by equipment for performing an operation at the lower level is needed. The minimal time for performing an operation at the lower level is obtained using Pontryagin’s Minimum Principle. The actual operation time allowed by the higher level for processing an operation at the lower level is subsequently determined by a scheduling algorithm at the higher level. Given an actual operation time, the lower level dynamics are controlled using optimal control to achieve minimal energy consumption while respecting the time constraint. Simulation studies illustrate how energy-efficient management of equipment for the minimal makespan could be obtained using the proposed methodology.