利用残余力概念进行结构损伤识别

提出一种利用残余力进行结构损伤识别方法。用刚度损伤系数将有限元模型参数化来描述结构的损伤。用特征值和特征向量预测算法构造目标函数,利用两点交叉算子的二进制代码的遗传算法反复迭代优化刚度损伤系数,获得待测结构的损伤系数、损伤位置与损伤程度的信息。通过一个平面桁架对该方法进行验证,结果表明:利用残余力概念进行损伤识别所得结构的损伤系数与理论值很接近。该方法能够较准确地判断结构的损伤位置和损伤程度。     

编组站进路调度优化算法

分析编组站作业进路选排问题的本质,以各任务的延误时间加权值总和最小为最优目标,以任务的前后工序选择路径为动态约束,建立编组站作业进路调度数学模型,采用遗传算法求解。编码采用定长染色体,长度为任务的工序数,每个工序采用2段制,编码中的顺序唯一地确定了每工序对指定进路占用的起讫时间和指标递推,设计基于优先规则的编码算法步骤。为保证解的可行性,将编码合法化,对工序进行拓扑排序。递推计算工序开始时间和结束时间,进而计算编码的目标值,并将其转化为适应值。采用轮盘赌与最优性相结合的方法进行选择,设计基于位置成组移位的杂交算子和随机交换的变异算子。以某编组站为例进行模拟计算,结果证明该算法满足编组站进路调度工作的要求。     

基于实数遗传算法的列车优化操纵曲线研究

列车优化操纵是列车节能控制的关键问题，以列车运行动力学方程和牵引计算理论为基础，结合列车运行过程中的要求，构建以能耗、时分误差、限速等为目标的列车节能控制模型，采用实数遗传算法，通过Visual Basic编程对此问题进行求解。在已知列车编组的条件下，以DF4型内燃机车牵引客车、空气制动和燃油量曲线为基础，得到给定运行时间、距离条件下的优化操纵曲线，从而对司机操纵给出指导性意见。     

基于GA-GM(1,N,α)幂模型的铁路客运量预测

针对在铁路客运量预测领域传统的灰色预测模型不能反映真实系统的非线性结构特点及其背景值的赋值不合理的问题,提出使用对系统相关因素引入幂指数且经过背景值优化的GM(1,N,)幂模型进行客运量预测。背景值优化时设置待定参数,利用线性组合结构重新计算背景值。对此模型产生的较多的待定参数,采用能够并行运算、全局寻优的遗传算法进行一次性求解。最后使用此模型对甘肃省铁路客运量进行建模预测,并与传统GM(1,N)模型、GM(1,N)幂模型进行对比分析。结果证明,GM(1,N,)幂模型具有更高的预测精度,对铁路客运量预测有一定的应用和研究价值。     

遗传算法在五连杆悬架优化中的应用

针对五连杆悬架的特点，运用多体系统动力学的理论建立了悬架的运动学分析模型，基于遗传算法开发了优化器的核心单元，并解决了它们之间的通讯和协调问题以实现在车轮上下跳动过程中车轮外倾角的运动学特性变化量与目标值之间的偏差最小作为优化设计的目标，说明了遗传算法在五连杆悬架优化中的应用。应用这种优化体系对某型轿车五连杆悬架进行了实例优化分析。     

小波变换在管道泄漏点定位中的应用

当管道发生泄漏时，泄漏诱发的负压波传播到管道上下游监测点时会使该点压力信号幅值产生瞬态下降，利用小波变换模极大值检测压力信号的突变点，从而计算出管道泄漏诱发的负压波传播到上下游监测点的时间差。在MATLAB6．1软件环境下，以某次实验数据为例进行管道泄漏点定位研究。在计算过程中小波基函数选取为Haar小波，尺度水平为6，计算结果表明该方法可以计算出管道泄漏点处诱发的负压波传播到管道上游监测点的时间差，从而为准确定位泄漏点提供了基础。     

Large-scale evacuation network optimization: a bi-level control method with uncertain arterial demand

To improve the efficiency of large-scale evacuations, a network aggregation method and a bi-level optimization control method are proposed in this paper. The network aggregation method indicates the uncertain evacuation demand on the arterial sub-network and balances accuracy and efficiency by refining local road sub-networks. The bi-level optimization control method is developed to reconfigure the aggregated network from both supply and demand sides with contraflow and conflict elimination. The main purpose of this control method is to make the arterial sub-network to be served without congestion and interruption. Then, a corresponding bi-objective network flow model is presented in a static manner for an oversaturated network, and a Genetic Algorithm-based solution method is used to solve the evacuation problem. The numerical results from optimizing a city-scale evacuation network for a super typhoon justify the validity and usefulness of the network aggregation and optimization control methods.     

Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach

In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported.     

Methods to reduce dimensionality and identify candidate solutions in multi-objective signal timing problems

Adjusting traffic signal timings is a practical way for agencies to manage urban traffic without the need for significant infrastructure investments. Signal timings are generally selected to minimize the total control delay vehicles experience at an intersection, particularly when the intersection is isolated or undersaturated. However, in practice, there are many other potential objectives that might be considered in signal timing design, including: total passenger delay, pedestrian delays, delay inequity among competing movements, total number of stopping maneuvers, among others. These objectives do not tend to share the same relationships with signal timing plans and some of these objectives may be in direct conflict. The research proposes the use of a new multi-objective optimization (MOO) visualization technique—the mosaic plot—to easily quantify and identify significant tradeoffs between competing objectives using the set of Pareto optimal solutions that are normally provided by MOO algorithms. Using this tool, methods are also proposed to identify and remove potentially redundant or unnecessary objectives that do not have any significant tradeoffs with others in an effort to reduce problem dimensionality. Since MOO procedures will still be needed if more than one objective remains and MOO algorithms generally provide a set of candidate solutions instead of a single final solution, two methods are proposed to rank the set of Pareto optimal solutions based on how well they balance between the competing objectives to provide a final recommendation. These methods rely on converting the objectives to dimensionless values based on the optimal value for each specific objectives, which allows for direct comparison between and weighting of each. The proposed methods are demonstrated using a simple numerical example of an undersaturated intersection where all objectives can be analytically obtained. However, they can be readily applied to other signal timing problems where objectives can be obtained using simulation outputs to help identify the signal timing plan that provides the most reasonable tradeoff between competing objectives.     

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.