数值模拟在土钉支护公路边坡工程设计的应用

采用岩土工程分析软件，结合某公路边坡开挖的具体实例，对土钉支护进行数值模拟，对边坡开挖和土钉支护过程中的土体位移场、应力场及土钉的受力变化等进行了模拟与分析。结果表明计算值与实测值较为接近，建立的计算模型对土钉支护的受力变形分析是适用的。同时，在改变模型参数的基础上初步探讨了土钉长度、土钉倾角对边坡位移与土钉最大轴力的影响，得出了一些在土钉支护工程中可资应用的结论。     

降雨条件下道路边坡地下水渗流分析

降雨是影响道路边坡稳定的主要因素之一,根据岩土饱和-非饱和渗流理论,考虑降雨入渗的影响,利用有限元方法,对强降雨条件下公路边坡地下水渗流场动态进行了数值模拟,得到了降雨过程中边坡地下水压力水头、总水头变化、流速的变化规律,研究结果为道路边坡的稳定性分析和滑坡预测提供重要的分析数据。     

公共交通系统营运可靠性研究

优先发展公共交通是大城市解决交通拥堵,实现城市交通可持续发展的一项重要措施,然而,公交营运水平的低下制约着公交的发展。本文借鉴可靠性理论对公共交通营运可靠性进行定义,并对公交营运时间和乘客服务可靠性分别进行了描述,据此建立起公交系统营运可靠性模型,然后采用随机模拟技术(即Monte Carlo模拟)进行求解,通过算例说明模型的可行性,最后通过分析可靠性模型得出大型活动期间改善公交营运的途径。     

模拟计算法在重型车辆燃油经济性标准中的应用研究

随着节能减排压力的日益严重,世界各国均开始制定重型车辆的燃油经济性标准。在对重型车燃油经济性的测量方面,模拟计算法由于操作简单、可重复性好、成本低的优点越来越受到行业的重视,在日本、中国和美国的标准中都得到了应用。本文在分析模拟计算法测量车辆燃油经济性的原理基础上,对比研究了日本、中国和美国标准中模拟计算法的应用情况,分析了各国在模拟计算法关键环节上策略的异同。     

刚构桥0#块混凝土水化热温度场改值模拟分析

文章结合罗天乐连续刚构桥施工实例，运用有限元模型对该桥0#块混凝土浇筑施工过程中的温度场变化情况进行了数值模拟分析。结果表明，0#块混凝土内部最高温度及最大内外温差计算值与实测值吻合较好。     

鱼雷发动机三组元比例控制器数值模拟

利用计算流体力学软件Pumplinx模拟鱼雷发动机中三组元比例控制器的内部流场,分析计算中不同压差情况下对比例控制器性能的影响,以及叶片与定子间间隙大小对于比例控制器性能的影响,同时对不同叶片数目下性能进行对比。计算结果表明:由于比例控制器为被动旋转马达结构,其转速和流量均随时间呈周期性脉动变化,随着工作压差增大,转速脉动幅度基本保持不变,而流量和扭矩脉动幅值增加;随着间隙增大,泄漏量增大,但流量、扭矩、转速脉动幅值大幅降低,出口流量较为平稳;叶片数目增多后比例控制器转速降低、排量降低。由计算结果推断出目前比例控制器的最优叶片数目为4。本文可为进一步研究比例控制器精度问题提供参考。     

大断面地铁车站隧道软弱围岩渐进破坏规律模型试验研究

以贵阳市地铁2号线阳明祠车站为背景,采用室内模型试验模拟大断面地铁车站施工过程中隧道塌方破坏过程,明确施工期间大断面隧道塌方破坏过程机制,对比分析围岩和路面的变形。结果表明:通过围岩重力作用模拟隧道施工过程中塌方过程,与实际塌方过程基本吻合,弥补了常规加载破坏的不足;围岩渐进破坏过程表现为裂隙出现-裂隙发展-裂隙贯通-围岩塌方,支护渐进破坏过程表现为变形缓慢增加-变形快速增加-裂缝快速发展-支护破坏;围岩渐进破坏与支护渐进破坏相互作用,共同发展;在实际施工过程中,当支护变形大幅增加时,应增加支护强度,同时还应及时注浆、打设长锚杆,以减缓围岩裂隙发展,阻断围岩渐进破坏过程。     

地下工程注浆技术研究新进展

注浆是土木、水利和矿山等工程建设中重要的防渗和加固技术。文章基于国内外注浆技术研究文献,总结了水泥等颗粒性浆液的“渗滤效应”及“黏度时空变异性”等理论研究成果,论述了非水反应高聚物、CW环氧树脂和微生物菌液等注浆新材料的应用现状及发展前景,介绍了细观力学数值模拟研究的突破性进展,可为地下工程注浆技术发展提供借鉴和启发作用。     

Free-floating bike sharing: Solving real-life large-scale static rebalancing problems

Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time.     

A generic data assimilation framework for vehicle trajectory reconstruction on signalized urban arterials using particle filters

With trajectory data, a complete microscopic and macroscopic picture of traffic flow operations can be obtained. However, trajectory data are difficult to observe over large spatiotemporal regions—particularly in urban contexts—due to practical, technical and financial constraints. The next best thing is to estimate plausible trajectories from whatever data are available. This paper presents a generic data assimilation framework to reconstruct such plausible trajectories on signalized urban arterials using microscopic traffic flow models and data from loops (individual vehicle passages and thus vehicle counts); traffic control data; and (sparse) travel time measurements from whatever source available. The key problem we address is that loops suffer from miss- and over-counts, which result in unbounded errors in vehicle accumulations, rendering trajectory reconstruction highly problematic. Our framework solves this problem in two ways. First, we correct the systematic error in vehicle accumulation by fusing the counts with sparsely available travel times. Second, the proposed framework uses particle filtering and an innovative hierarchical resampling scheme, which effectively integrates over the remaining error distribution, resulting in plausible trajectories. The proposed data assimilation framework is tested and validated using simulated data. Experiments and an extensive sensitivity analysis show that the proposed method is robust to errors both in the model and in the measurements, and provides good estimations for vehicle accumulation and vehicle trajectories with moderate sensor quality. The framework does not impose restrictions on the type of microscopic models used and can be naturally extended to include and estimate additional trajectory attributes such as destination and path, given data are available for assimilation.