Updating of Travel Behavior Model Parameters and Estimation of Vehicle Trip Chain Based on Plate Scanning

This article proposes a maximum-likelihood method to update travel behavior model parameters and estimate vehicle trip chain based on plate scanning. The information from plate scanning consists of the vehicle passing time and sequence of scanned vehicles along a series of plate scanning locations (sensor locations installed on road network). The article adopts the hierarchical travel behavior decision model, in which the upper tier is an activity pattern generation model, and the lower tier is a destination and route choice model. The activity pattern is an individual profile of daily performed activities. To obtain reliable estimation results, the sensor location schemes for predicting trip chaining are proposed. The maximum-likelihood estimation problem based on plate scanning is formulated to update model parameters. This problem is solved by the expectation-maximization (EM) algorithm. The model and algorithm are then tested with simulated plate scanning data in a modified Sioux Falls network. The results illustrate the efficiency of the model and its potential for an application to large and complex network cases.     

Bicriterion shortest path problem with a general nonadditive cost

A bicriterion shortest path problem with a general nonadditive cost seeks to optimize a combination of two path costs, one of which is evaluated by a nonlinear function. This paper first identifies a number of emerging transportation applications for which such a shortest path problem might be considered a core subproblem. We propose to first approximate the general nonlinear cost function with a piecewise linear counterpart, and then solve each linear subproblem sequentially. A specialized algorithm is developed to solve the subproblems, which makes use of the efficient path set (or the convex hull) to update upper and lower bounds of the original problem. Conditions under which the solution to a subproblem must belong to the efficient path set are specified. Accordingly, we show that the optimal path must be efficient if the nonlinear cost function is concave. If the optimal path to a subproblem is not efficient, partial path enumeration, implemented using a simple K-shortest path ranking procedure, is conducted to close the gap. The proposed algorithm includes strategies aiming to expedite path enumeration by using upper bounds derived from the efficient path set. Numerical experiments are conducted to demonstrate correctness and effectiveness of the proposed algorithm.     

Automated driving recognition technologies for adverse weather conditions

During automated driving in urban areas, decisions must be made while recognizing the surrounding environment using sensors such as camera, Light Detection and Ranging (LiDAR), millimeter-wave radar (MWR), and the global navigation satellite system (GNSS). The ability to drive under various environmental conditions is an important issue for automated driving on any road. In order to introduce the automated vehicles into the markets, the ability to evaluate various traffic conditions and navigate safely presents serious challenges. Another important challenge is the development of a robust recognition system can account for adverse weather conditions. Sun glare, rain, fog, and snow are adverse weather conditions that can occur in the driving environment. This paper summarizes research focused on automated driving technologies and discuss challenges to identifying adverse weather and other situations that make driving difficult, thus complicating the introduction of automated vehicles to the market.     

路网容量及最大流算法研究

对城市道路网的现有路网容量理论和模型进行了研究,在国内外现有较成熟的路网研究方法的基础上,分析了各种模型的假设条件、模型特点以及模型应用范围,并基于最大流、最小割理论分析了国内外现有的最大流算法及其缺陷,提出了改进的算法和在Matlab中的实现方式。     

基于产品数据管理系统的汽车制动系统优化设计平台研究

采用B/S模式在产品数据管理(PDM)系统之上构建基于网络的汽车制动系统设计平台。应用PDM的版本控制与流程管理技术实现设计的全过程协同管理与数据共享;通过设计知识自动解析和更新、设计参量匹配、设计同类产品数据借用等方法实现智能化和自动化设计。重点研究设计算法的更新和维护,以及基于案例知识自动扩展的实现策略问题,系统地解决了知识自更新、自学习以及扩展等难题。     

交通管制条件下城市道路网络模型及分配算法研究

城市道路网络模型及其算法是城市道路网络分析和分配的基础。本文首先分析了交通管制条件下原有城市道路网络模型和算法的不足,在此基础上提出一种改进模型和算法,并给出算例。这种改进的模型和算法能较好地满足实际分配的要求,在交通规划、交通管理和交通流模拟中都有着十分广阔的应用前景,且已经被成功地应用于郑州市综合交通规划中。     

基于自适应蚁群算法的图像分割

蚁群算法良好的离散性，并行性，正反馈性和鲁棒性，非常适合于图像分割。但基本蚁群算法蚂蚁的搜索是随机的，计算量大，不利于算法的收敛，为此，本文提出了设置初始聚类中心的设想，并以小窗口为对象实施算法，由此大大减小了计算量。另外基本蚁群算法中挥发系数固定，会导致算法可能过早收敛或停滞，针对这一不足，本文将其修改为随蚂蚁通过可行路径个数动态变化，使其收敛性和稳定性有了一定提高。实验证明了方法的有效性。     

改进原对偶遗传算法在搜索边坡最危险滑动面中的应用

文章基于janbu条分法,提出一种改进的原对偶遗传算法,并开发出相应的计算程序,自由搜索边坡任意形状最危险滑动面,求解其最小安全系数。通过工程实例验算证明,改进原对偶遗传算法是一种值得推广的边坡稳定性分析方法。     

基于北斗救援和ISPS规则的船舶人员安保管理系统研究

研究了基于北斗短报文通信方式的船用ISPS人员管理及救援管理的系统,具体包含天地海北斗卫星网络、船舶通信网络、低功耗高可靠性的BDS北斗通信基站,提出了基于模糊集合和贝叶斯的多对多Super-Bluetooth算法,设计了手环检索和定位的BR通信基站方案,提升和实现了基于北斗救援的ISPS人员管理。     

基于GSA-IPM算法的船舶电力系统无功优化

提出GSA-IPM(万有引力-内点)算法求解船舶电力系统无功优化问题,以降低船舶电力系统的有功损耗,提高电压质量,改善安全经济运行水平。将算法应用于某实际船舶电力系统进行仿真测试,结果与万有引力搜索算法(GSA)、遗传算法(GA)及粒子群算法(PSO)作比较,证明了算法能够使有功网损更低,电压质量更佳,从而验证了方法的有效性。