Identification of nonlinear systems using modified particle swarm optimisation: a hydraulic suspension system

This paper presents a novel modified particle swarm optimisation (MPSO) algorithm to identify nonlinear systems. The case of study is a hydraulic suspension system with a complicated nonlinear model. One of the main goals of system identification is to design a model-based controller such as a nonlinear controller using the feedback linearisation. Once the model is identified, the found parameters may be used to design or tune the controller. We introduce a novel mutation mechanism to enhance the global search ability and increase the convergence speed. The MPSO is used to find the optimum values of parameters by minimising the fitness function. The performance of MPSO is compared with genetic algorithm and alternative particle swarm optimisation algorithms in parameter identification. The presented comparisons confirm the superiority of MPSO algorithm in terms of the convergence speed and the accuracy without the premature convergence problem. Furthermore, MPSO is improved to detect any changes of system parameters, which can be used for designing an adaptive controller. Simulation results show the success of the proposed algorithm in tracking time-varying parameters.     

Maximizing net benefits for conventional and flexible bus services

Transit ridership is usually sensitive to fares, travel times, waiting times, and access times, among other factors. Therefore, the elasticities of demand with respect to such factors should be considered in modeling bus transit services and must be considered when maximizing net benefits (i.e. “system welfare” = consumer surplus + producer surplus) rather just minimizing costs. In this paper welfare is maximized with elastic demand relations for both conventional (fixed route) and flexible-route services in systems with multiple dissimilar regions and periods. As maximum welfare formulations are usually too complex for exact solutions, they have only been used in a few studies focused on conventional transit services. This limitation is overcome here for both conventional and flexible transit services by using a Real Coded Genetic Algorithm to solve such mixed integer nonlinear welfare maximization problems with constraints on capacities and subsidies. The optimized variables include service type, zone sizes, headways and fares. We also determine the maximum welfare threshold between optimized conventional and flexible services) and explore the effects of subsidies. The proposed planning models should be useful in selecting the service type and optimizing other service characteristics based on local geographic characteristics and financial constraints.     

潜水器载人舱的不确定性测度计算方法研究

本文研究状态函数中存在概率数和证据数的混合状态下的系统不确定性分析方法问题,用于解决在产品实现过程中部分信息的认知不足。传统概率分析方法无法建立认知不确定信息模型,无法反映产品在实现过程中不确定性影响的问题。本文将证据理论不确定度分析方法融入传统JC算法,在计算随机变量迭代时开展认知变量极值计算,进而可以处理随机和认知不确定性变量同时存在时的混合不确定性问题。本文建立了4500 m载人潜水器载人舱不确定度分析模型,基于改进JC算法计算得到载人舱失效似然性测度和失效可信性测度值,同时采用实验设计法对影响载人舱不确定性测度的因素进行分析,分析表明测度影响较大的因素是真球度和极限拉伸强度,测度对真球度和厚度两个因素的单位数量变化比较敏感。     

基于遗传算法的盾构隧道管片接头刚度反演研究北大核心CSCD

梁-弹簧模型在管片衬砌结构计算中应用较广泛,目前接头刚度取值方法主要有模型试验法及经验取值法,模型试验法耗时长、成本高昂,而依据经验取值难免存在一定主观性。鉴于此,利用C++编程语言,基于遗传算法开发了盾构隧道管片结构位移反分析程序,首先通过弹性模量值反演算例,得出反演值与理论值误差为1.4%,验证了算法和程序的可行性。利用程序将反演接头刚度值与实际设计案例管片接头刚度值进行对比,反演计算结果表明:正弯矩下管片环向接头转动刚度值反演误差为2.6%,负弯矩下管片环向接头转动刚度值反演误差为4.3%。     

数据采集算法的研究

介绍利用C#编程制作数据采集软件的方法,讨论该软件在工程中的应用情况.数据采集软件利用以太网协议读取PLC中的数据,并将现场设备信息存储到数据库中,以实现对PLC采集数据的自动计算,节省人力,缩短项目开发周期.     

基于SOC自适应分阶的动力锂电池两步优化快速充电策略

快速高效的充电方式对于推动汽车电动化,加快以石油为主导的传统交通能源向绿色低碳能源转型,实现中国"双碳战略"的目标具有重要意义。针对充电时间和充电损失的平衡优化问题,提出了一种基于SOC自适应分阶的两步优化多阶恒流充电策略。为实现充电过程的优化分阶,利用改进的二分K-means算法对基于内阻曲线的采样点集进行聚类,实现了充电区间关于内阻变化和分布特征的自适应划分。基于分阶优化结果,采用改进的非支配排序哈里斯鹰优化算法(INSHHO)求解优化电流对应帕累托前沿。利用Logistic混沌初始化及自适应t分布突变算子对哈里斯鹰模型(HHO)进行改进,进一步提升算法的全局寻优能力。最后通过充电对比试验,将优化多阶恒流充电策略与恒流恒压策略(CC-CV)和均分多阶恒流充电策略在不同充电时间条件下进行充电性能对比。结果表明:在充电时间保持一致的条件下,提出的优化多阶恒流充电策略较恒流恒压策略和均分多阶恒流充电策略的充电欧姆损失最大分别减少1.03%和0.3%;在温升表现上,优化多阶恒流充电策略较均分多阶恒流充电策略的充电温升最多降低了0.82℃。     

基于梯度关联规则的老年行人交通事故风险识别

为构建老年行人交通事故严重程度风险关联因素识别方法体系，本文应用极限梯度提升关联规则挖掘算法(Extreme Gradient Boost-Apriori，XGB-Apriori)识别城市道路老年行人交通事故风险因子。运用机器学习优化关联规则算法结构，通过机器学习库 scikit-learn 中 XGBoost (Extreme Gradient Boost)算法与SFM(Select From Model)特征选择类功能实现变量特征值的选择。进而，对Apriori算法设置有序定向约束，得到适用于交通事故致因分析的数据挖掘技术。通过逐层迭代识别关联项，选取频繁项集，总结高置信度、高提升度的关联规则。关联因素模型评估结果表明，本文采用的SFM功能准确度可达78.31%，关联规则XGB-Apriori算法较传统算法精度提升了91%。挖掘结果显示，驾驶员与行人的自身特征、车辆特征、碰撞状态以及道路特征均对老年行人交通事故的严重程度具有重要影响。其中，男性驾驶员造成的行人死亡事故频次较高，女性驾驶员造成的受伤事故频次较高；大型、重型车辆(SUV、卡车、施工车)发生死亡事故频次相对小轿车更高；位于匝道等道路线型弯曲的坡道中，老年行人发生致死交通事故的频次相对线型缓和路段更高。本文对老年行人交通事故耦合因素全面识别并针对性提出风险防控精准预判方法，为有效保护道路弱势群体提供必要的理论支持。     

考虑用户偏好的共享汽车混合运营模式优化

针对共享汽车运营商的油车和电车混合车队调度问题，本文将自由流动式和站点借还式两种运营模式相结合，提出考虑用户用车类型偏好的共享汽车系统优化模型。模型为油车和电车车队分别设置了自由流动式和站点借还式的运营模式，并进行运营范围决策、站点选址和车辆调度优化；运营商优先满足用户的用车类型偏好选择，对无法满足偏好的用户进行补贴。根据优化模型基本特征，设计基于梯度的启发式求解方法，对大规模非线性混合整数规划模型进行求解；针对案例区域，比较有无补贴的混合车队模式和单一车队模式的优化结果。结果表明：相比无补贴模式，有补贴模式能够鼓励偏好燃油汽车的用户更多地使用电动汽车，需求满足率从73.4%提高到78.2%，运营商利润提高了46.4%；相比单一类型车队，混合车队能够吸引更多用户使用共享汽车，用户需求数提高了40.6%。     

A hybrid heuristic strategy for liquefied natural gas inventory routing

As liquefied natural gas (LNG) steadily grows to be a common mode for commercializing natural gas, LNG supply chain optimization is becoming a key technology for gas companies to maintain competitiveness. This paper develops methods for improving the solutions for a previously stated form of an LNG inventory routing problem (LNG-IRP). Motivated by the poor performance of a Dantzig-Wolfe-based decomposition approach for exact solutions, we develop a suite of advanced heuristic techniques and propose a hybrid heuristic strategy aiming to achieve improved solutions in shorter computational time. The heuristics include two phases: the advanced construction phase is based on a rolling time algorithm and a greedy randomized adaptive search procedure (GRASP); and the solution improvement phase is a series of novel MIP-based neighborhood search techniques. The proposed algorithms are evaluated based on a set of realistic large-scale instances seen in recent literature. Extensive computational results indicate that the hybrid heuristic strategy is able to obtain optimal or near optimal feasible solutions substantially faster than commercial optimization software and also the previously proposed heuristic methods.     

Dynamic airspace sectorisation for flight-centric operations

Today’s air traffic operations follow the paradigm of ‘flow follows structure’, which already limits the operational efficiency and punctuality of current air traffic movements. Therefore, we introduce the dynamic airspace sectorisation and consequently change this paradigm to the more appropriate approach of ‘structure follows flow’. The dynamic airspace sectorisation allows an efficient allocation of scarce resources considering operational, economic and ecological constraints in both nominal and variable air traffic conditions. Our approach clusters traffic patterns and uses evolutionary algorithms for optimisation of the airspace, focusing on high capacity utilisation through flexible use of airspace, appropriate distribution of task load for air traffic controllers and fast adaptation to changed operational constraints. We thereby offer a solution for handling non-convex airspace boundaries and provide a proof of concept using current operational airspace structures and enabling a flight-centric air traffic management. We are confident that our developed dynamic airspace sectorisation significantly contributes to the challenges of future airspace by providing appropriate structures for future 4D aircraft trajectories taking into account various operational aspects of air traffic such as temporally restricted areas, limited capacities, zones of convective weather or urban air mobility. Dynamic sectorisation is a key enabling technology in the achievement of the ambitious goals of Single European Sky and Flightpath 2050 through a reduction in coordination efforts, efficient resource allocation, reduced aircraft emissions, fewer detours, and minimisation of air traffic delays.