A context aware system for driving style evaluation by an ensemble learning on smartphone sensors data

There are many systems to evaluate driving style based on smartphone sensors without enough awareness from the context. To cover this gap, we propose a new system namely CADSE system to consider the effects of traffic levels and car types on driving evaluation. CADSE system includes three subsystems to calibrate smartphone, to classify the maneuvers, and to evaluate driving styles. For each maneuver, the smartphone sensors data are gathered in three successive time intervals referred as pre-maneuver, in-maneuver, and post-maneuver times. Then, we extract some important mathematical and experimental features from these data. Afterwards, we propose an ensemble learning method on these features to classify the maneuvers. This ensemble method includes decision tree, support vector machine, multi-layer perceptron, and k-nearest neighbors. Finally, we develop a rule-based fuzzy inference system to integrate the outputs of these algorithms and to recognize dangerous and safe maneuvers. CADSE saves this result in driver’s profile to consider more for dangerous driving recognition. The experimental results show that accuracy, precision, recall, and F-measure of CADSE system are greater than 94%, 92%, 92%, and 93%, respectively that prove the system efficiency.     

基于遗传算法的UUV快速性和能源系统综合优化分析

水下无人航行器(UUV)的总体优化设计一般由快速性、操纵性、结构强度、能源系统等系统构成,各个系统之间耦合,综合考虑各系统间的耦合作用对于UUV的设计至关重要,本文针对UUV快速性和能源系统综合优化的问题进行研究,主要工作有:根据艇型特点选择了19个相关设计变量,构建了约束条件,综合考虑各性能指标,建立了UUV快速性和能源系统综合目标函数;利用VC++语言,编制了基于遗传算法的UUV快速性和能源系统综合优化程序,从UUV快速性和能源系统的角度选取7个较敏感的设计变量进行了敏感度分析。通过计算表明,该优化系统准确可靠,平行中体长度、回转体直径和3 kn航速航行时间对优化系统较为敏感。     

���й���ϵͳ��������Ż������о�

采用混合整数优化方法,研究城市公交系统宏观网络优化整合问题. 根据区域间服务水平要求、公交供给能力以及满足一定乘客出行要求,构造公交系统宏观网络优化整合多目标模型,该多目标函数考虑乘客总出行时间成本、各公交方式的建设总费用、各公交方式的能耗和污染物排放总费用、枢纽建设总费用最优;并给出最优解的多方案求解步骤;针对多节点采用Branch-Cut算法进行求解,提高求解效率;通过算例对模型和算法的可行性和有效性进行了验证,说明该算法可得出不同发展阶段下的公交宏观网络最优布局方案;结果表明,提出的模型与算法能对城市公交宏观网络布局提供辅助决策支持.     

基于量子遗传算法的光电干扰资源优化分配研究

结合光电信息系统作战运筹中目标分配原则,建立了干扰资源优化分配模型。给出了基于量子遗传算法的模型求解方法及步骤,并进行了实例仿真,得出了最佳干扰资源分配方案。仿真结果表明,该方法优于遗传算法,对于求解干扰资源优化分配模型是有效、可行的。     

基于遗传算法的地铁列车自动驾驶控制算法研究

轨道交通列车运行曲线的控制是轨道交通列车自动化的核心技术。通过提出改进的遗传算法来设计列车ATO（列车自动驾驶）控制算法，使用某城市地铁列车参数建模，编制实用的遗传算法生成列车时分控制曲线的程序，并进行计算机仿真，仿真的结果达到了：输出时间与给定的定时值完全一致；能耗比节时模式降低56%；停车点精度｜x｜=14cm，小于规定值（25cm）；最大速度小于规定值；具有较高的全局适应度。表明算法效果良好、性能优越。     

Generating complete all-day activity plans with genetic algorithms

Activity-based demand generation contructs complete all-day activity plans for each member of a population, and derives transportation demand from the fact that consecutive activities at different locations need to be connected by travel. Besides many other advantages, activity-based demand generation also fits well into the paradigm of multi-agent simulation, where each traveler is kept as an individual throughout the whole modeling process. In this paper, we present a new approach to the problem, which uses genetic algorithms (GA). Our GA keeps, for each member of the population, several instances of possible all-day activity plans in memory. Those plans are modified by mutation and crossover, while bad instances are eventually discarded. Any GA needs a fitness function to evaluate the performance of each instance. For all-day activity plans, it makes sense to use a utility function to obtain such a fitness. In consequence, a significant part of the paper is spent discussing such a utility function. In addition, the paper shows the performance of the algorithm to a few selected problems, including very busy and rather non-busy days.     

基于模拟退火算法的运梁车转向机构优化设计

建立了运梁车液压连杆转向机构优化数学模型。考虑车辆在转向时的各种影响因素,以转向机构转向的平稳性、传动性能、利用效率为多优化目标。利用快速的模拟退火算法进行优化求解,以避免陷入局部极值,加快收敛速度。仿真结果显示它使转向机构的综合性能得到了较大的改善。     

基于遗传算法的操舵仪控制参数在线优化

采用遗传算法对航向保持自动操作仪控制参数进行在线优化,计算机仿真表明,遗传算法可以方便地得到全局最优解,故控制器可以快速稳定地跟踪预定航向,且系统具有较好的鲁棒性。     

广义Gauss模型及其模拟退火算法

研究了求解优化问题全局解的随机神经网络方法，将Gauss模型拓展为广义Gauss模型，使之能求解一般优化问题的全局解。进而引入全局性较好的模拟退火算法的思想，提出了广义Gauss模型的模拟退火算法。通过算例比较了几种计算智能算法的全局性。广义Gauss模型的模拟退火运行全局性最好，但它付出了时间的代价；广义Gauss模型兼顾了计算效率和全局性；广义Hopfield网络的全局性最不理想。     

区段站阶段计划的优化模型和算法

以区段站阶段内准点满轴发车为目标,建立混合０－１规划模型,并根据大系统理论将系统分解为４个有序的子系统,同时给出分解算法,为阶段计划的计算机自动编制提供了一个优化决策基础。