基于多媒体时钟的定时控制

由于Windows平台图形界面的易操作，使得在各行各业得到迅速的普及。这在工业控制领域也不例外，但是由于Windows操作系统在大部分情况下是以队列形式工作的，使得在Windows下实现实时控制成为了难题。利用多媒体时钟可以很好地实现Windows实时控制。     

可拓知识库的构建

提出采用关系数据库构建可拓知识库，利用可拓学中物元、事元来描述知识中的信息单元及其联系，对信息单元相关性进行评级，利用关系数据库的特点能对可拓知识库进行查询、插入、删除、更新操作，采用程序推理式的语言描述知识，使计算机能自学习，实现人工智能构建可拓知识库。     

与既有地铁线路接轨道岔施工方案研究

研究目的：以上海地铁M8线与既有的上海地铁1号线在人民广场站接轨的工程为例，对地铁接轨道岔的施工方法、施工工艺进行分析研究。 研究方法：搜集既有线轨道设计标准、调查研究接轨道岔现场情况及工作环境，制定施工设计原则，选择合理的施工方案并结合实际情况选用新材料。 研究结果：与既有地铁线路接轨道岔施工方案，最终采用间隔抽换正线与道岔共用短轨枕和扣件。 研究结论：施工前应做好既有线无缝线路的放散，施工全部结束后恢复道岔两端的无缝线路，并加强两端线路的锁定；FFU合成轨枕侧面应做出凹凸或花纹，新老道床混凝土接触面涂刷界面剂；道岔道床始、终端及道岔道床内设置伸缩缝，排杂散电流钢筋总截面积应满足要求并保证电气连接，尤其注意侧股道床钢筋与直股钢筋的绑扎或焊接。     

城市轨道交通大小交路模式列车开行方案的优化

列车开行方案是城市轨道交通运输组织的基础.大小交路模式列车开行方案规定各时间段内各交路上开行列车对数.分析大小交路模式乘客出行成本和企业运营成本的计算方法,以乘客出行成本及运输企业运营成本最小化为目标,以列车追踪间隔时间、乘客需求和最大可用车底数量为约束,构建城市轨道交通大小交路模式列车开行方案双目标混合整数非线性规划模型.采用理想点法将原模型转化为单目标模型,借助Lingo11.0求解.通过算例验证模型的合理性,并对折返站和小交路区段客流比重进行成本的灵敏度分析,结果表明:小交路折返站的选取对成本影响显著,且小交路区段客流比重越高,开行大小交路模式越有利于降低运输成本.     

地铁公安无线通信引入系统解决方案

介绍了公安无线通信系统现状和发展趋势,提出地铁公安无线通信引入系统设计考虑因素及地铁公安无线通信引入系统主流方案。     

汽车电子稳定系统ESP的工作原理及应用

介绍汽车电子稳定系统ESP的工作原理、组成部件及其功能。ESP系统基于汽车翻转角速度、横向线加速度和偏转力矩等的测量值,不但能够纠正诸如翻转或者打滑等各种汽车不稳定行驶状态,而且能够显著提高汽车线内行驶的稳定性,缩短在弯道或湿滑路面上紧急制动时的制动距离等。     

Liner shipping network design with emission control areas: A genetic algorithm-based approach

To curb emissions, containerized shipping lines face the traditional trade-off between cost and emissions (CO₂ and SO_x) reduction. This paper considers this element in the context of liner service design and proposes a mixed integer linear programming (MILP) model based on a multi-commodity pickup and delivery arc-flow formulation. The objective is to maximize the profit by selecting the ports to be visited, the sequence of port visit, the cargo flows between ports, as well as the number/operating speeds of vessels on each arc of the selected route. The problem also considers that Emission Control Areas (ECAs) exist in the liner network and accounts for the vessel carrying capacity. In addition to using the MILP solver of CPLEX, we develop in the paper a specific genetic algorithm (GA) based heuristic and show that it gives the possibility to reach an optimal solution when solving large size instances.     

Dynamic traffic metering in urban street networks: Formulation and solution algorithm

Traffic metering offers great potential to reduce congestion and enhance network performance in oversaturated urban street networks. This paper presents an optimization program for dynamic traffic metering in urban street networks based on the Cell Transmission Model (CTM). We have formulated the problem as a Mixed-Integer Linear Program (MILP) capable of metering traffic at network gates with given signal timing parameters at signalized intersections. Due to the complexities of the MILP model, we have developed a novel and efficient solution approach that solves the problem by converting the MILP to a linear program and several CTM simulation runs. The solution algorithm is applied to two case studies under different conditions. The proposed solution technique finds solutions that have a maximum gap of 1% of the true optimal solution and guarantee the maximum throughput by keeping some vehicles at network gates and only allowing enough vehicles to enter the network to prevent gridlocks. This is confirmed by comparing the case studies with and without traffic metering. The results in an adapted real-world case study network show that traffic metering can increase network throughput by 4.9–38.9% and enhance network performance.     

Optimal joint distance and time toll for cordon-based congestion pricing

This paper addresses the optimal toll design problem for the cordon-based congestion pricing scheme, where both a time-toll and a nonlinear distance-toll (i.e., joint distance and time toll) are levied for each network user’s trip in a pricing cordon. The users’ route choice behaviour is assumed to follow the Logit-based stochastic user equilibrium (SUE). We first propose a link-based convex programming model for the Logit-based SUE problem with a joint distance and time toll pattern. A mathematical program with equilibrium constraints (MPEC) is developed to formulate the optimal joint distance and time toll design problem. The developed MPEC model is equivalently transformed into a semi-infinite programming (SIP) model. A global optimization method named Incremental Constraint Method (ICM) is designed for solving the SIP model. Finally, two numerical examples are used to assess the proposed methodology.