用振动试验最优修正振型矩阵与柔度矩阵

由有限元模型得到的计算值与通过试验获得的测量值之间往往存在偏差。为了能够精确预测结构的动力响应，依据测量信息修正存在的动力模型是非常必要的。本文运用代数特征值反问题的理论和方法，研究了满足正交性条件的振型矩阵及柔度矩阵的修正问题，得到了加权Frobenius范数意义下的最优修正矩阵。     

Time-dependent fuzzy random location-scheduling programming for hazardous materials transportation

The tremendous use of hazardous materials has promoted the economic development, which also brings about a growing risk causing a widespread concern. In this work, we consider a location-scheduling problem on hazardous materials transportation under the assumption that transportation risks are time-dependent fuzzy random variables. First, we formulate a scheduling optimization model and design a fuzzy random simulation based genetic algorithm to optimize the departure time and dwell times for each depot–customer pair. Then we establish an expected value model and design a modified particle swarm optimization algorithm to minimize the en route risks and site risks. Finally, numerical examples are given to illustrate the effectiveness of the proposed models and algorithms.     

Plan-based flexible bus bridging operation strategy

Bus bridging has been widely used to connect stations affected by metro disruptions such that stranded passengers could resume their journeys. Previous studies generally assumed that a bus operates exclusively on one bridging route with given frequency, which limits the service flexibility and reduce the operational efficiency. We propose a strategy to instruct buses to operate on predefined bridging routes once they are dispatched from depots. Buses are allowed to flexibly serve different bridging routes. Each bus operates based on a bridging plan that lists the stations to serve in sequence instead of route frequencies. A two-stage model is developed to optimize the bridging plans and their assignments to buses with the objectives that balance the operational priorities between minimizing bus bridging time and reducing passenger delay. A Weight Shortest Processing Time first (WSPT) rule based heuristic algorithm is developed to solve the proposed model. The developed model is further incorporated in a rolling horizon framework to handle dynamic passenger arrivals during the disruption period. The effectiveness of the proposed strategy is demonstrated in comparison with alternative strategies in real-world case studies.     

论员工的绩效薪酬与正向激励

谋求最高劳动生产率是科学管理的根本目的,为了充分调动员工创造价值的主动性和积极性,绩效薪酬管理的重要性在企业管理中日益凸显。为了最大限度地激发员工积极性,科学、可行、合理、公正的绩效考核是有效的管理手段和管理模式。但目前,在相当多的企业中,绩效考核并未达到预期效果,不合理的考核方案甚至可能激起劳资双方的对立情绪或引发员工之间的不当竞争。本文针对此类情况,分析普遍存在的问题并提出了优化对策及非物质激励的改进方案。     

A model and optimization-based heuristic for the operational aircraft maintenance routing problem

This paper investigates the Operational Aircraft Maintenance Routing Problem (OAMRP). Given a set of flights for a specific homogeneous fleet type, this short-term planning problem requires building feasible aircraft routes that cover each flight exactly once and that satisfy maintenance requirements. Basically, these requirements enforce an aircraft to undergo a planned maintenance at a specified station before accumulating a maximum number of flying hours. This stage is significant to airline companies as it directly impacts the fleet availability, safety, and profitability. The contribution of this paper is twofold. First, we elucidate the complexity status of the OAMRP and we propose an exact mixed-integer programming model that includes a polynomial number of variables and constraints. Furthermore, we propose a graph reduction procedure and valid inequalities that aim at improving the model solvability. Second, we propose a very large-scale neighborhood search algorithm along with a procedure for computing tight lower bounds. We present the results of extensive computational experiments that were carried out on real-world flight networks and attest to the efficacy of the proposed exact and heuristic approaches. In particular, we provide evidence that the exact model delivers optimal solutions for instances with up to 354 flights and 8 aircraft, and that the heuristic approach consistently delivers high-quality solutions while requiring short CPU times.     

Reliable route guidance: A case study from Chicago

Reliable route guidance can be obtained by solving the reliable a priori shortest path problem, which finds paths that maximize the probability of arriving on time. The goal of this paper is to demonstrate the benefits and applicability of such route guidance using a case study. An adaptive discretization scheme is first proposed to improve the efficiency in computing convolution, a time-consuming step used in the reliable routing algorithm to obtain path travel time distributions. Methods to construct link travel time distributions from real data in the case study are then discussed. Particularly, the travel time distributions on arterial streets are estimated from linear regression models calibrated from expressway data. Numerical experiments demonstrate that optimal paths are substantially affected by the reliability requirement in rush hours, and that reliable route guidance could generate up to 5-15% of travel time savings. The study also verifies that existing algorithms can solve large-scale problems within a reasonable amount of time.     

黔桂线改扩建工程几处典型的地质选线

研究目的:黔桂铁路改扩建工程地处西南山区,穿越贵州、广西两省区,沿线地形地质十分复杂,线路方案选择往往受到地质条件的严重制约,因此,在该线改扩建工程初测阶段大力开展区域地质选线工作对节约工程投资、减少地质灾害和工程病害、消除运营隐患是很有必要的。研究方法:在充分收集区域地质资料基础上,通过地质调绘、钻探、静力触探等综合勘探方法,查明选线段重大工程地质问题,从地质角度确定线路方案。研究结果:通过不同方案地质条件必选,最终确定了地质条件好的线路方案。研究结论:西南山区地形地质复杂,线路方案比选中应充分研究沿线地质条件,绕避复杂、严重地质不良地段。本文系统介绍了黔桂线改扩建工程初测阶段几处典型的、成功的地质选线,概括性地总结了地质选线应绕避的重大地质问题,其选线思路、比选条件及评价意见等可作为其它山区铁路勘察设计参考和借鉴。     

一种基于椭圆曲线的多重数字签名方案

对基本的椭圆曲线数字签名算法（ECDSA）进行了改进，提出了一种新的基于椭圆曲线的多重数字签名方案．该方案能够允许多个用户按顺序地对一份文件进行签名，最后形成一个群体签名．并提出一种新的签名验证方案，可以有效地防止成员的欺诈行为．签名者可以通过验证操作发现伪签名，同时签名中心可以及时通过签名者提供的失败信息查找原因并进行处理，签名中心还可验证签名者公钥的有效性以防止成员内部的欺诈行为．方案充分利用椭圆曲线密码体制密钥小、速度快等优点，降低了通信成本，因而更具有安全性和实用性．     

客车制动系统过热问题的试验研究

简述解决客车制动系统过热的试验方法。     

D38型钳夹车运输中存在的问题及对策

分析了D38型钳夹车在运输中存在的问题,提出了相应的对策和建议。