基于时间优化算法的锂离子电池主被动均衡

为避免因单体电池的不一致性而影响锂离子电池组的使用效率与寿命,设计一种主被动均衡相结合的均衡方案,其中主动均衡由单绕组反激变压器实现,且在控制策略中,利用基于区间搜索的时间优化算法得到使均衡时间最短的最优均衡目标值。搭建仿真模型,并运行多组随机数据的对比实验。与传统的将平均值设置为均衡目标相比,所提均衡方案可将均衡时间缩短约23%,该方案的可行性与有效性得到验证。

移动计算环境中数据广播访问时间优化算法

移动计算是近年来新兴的一个研究热点 ,具有极大的市场潜力和需求 .数据广播是提高移动计算系统可伸缩性的一项重要技术 ,本文对无线移动计算环境中数据广播的平均访问时间优化进行了研究和实验 .首先分析了平均访问时间的理论最小值 ,然后提出了向理论最小值逼近的 NASA算法 ,实验表明 NASA算法具有良好的性能 ,优于

基于时间序列优化估计算法的散货码头船舶停留轨迹规划方法

为了降低船舶总停留时间,提升散货码头运营效率,提出基于时间序列优化估计算法的船舶停留轨迹规划方法。通过引入时间序列分析方法,构建船舶停留时间预测模型。在此基础上,以最小化船舶总停留时间为目标,构造船舶停留轨迹规划的目标函数,并确定约束条件。选取遗传算法求解目标函数,通过其迭代优化过程,获取最优的船舶停留轨迹规划方案,从而实现船舶停留轨迹的有效规划。试验结果显示:应用时间序列优化估计算法获得的船舶停留轨迹规划模型求解迭代次数最小值为7次,船舶总停留时间降低至28 min。以上结果表明,该方法的船舶停留轨迹规划合理,提升了散货码头运营效率。

基于禁止搜索的非线性时间匹配优化算法

动态时间规整算法DTW(Dynamic Time Warping)作为一种非线性时间匹配技术已成功地应用于语音识别系统中。DTW算法使用动态规划技术来搜索两个时间序列的最优规整路径,虽然这种算法计算量小,运算时间较短,但只是一种局部优化算法。禁止搜索TS(Tabu Search)算法是一种具有短期记忆的广义启发式全局搜索技术,适用于解决许多非线性优化问题。本文将该技术用于语音识别系统中,提出了基于禁止搜索的非线性时间规整的优化算法TSTW,使得时间规整函数尽可能逼近全局最优。仿真结果表明,TSTW比DTW有更高的识别率,且运行时间比遗传时间规整算法GTW大大减少。

Improved ant colony optimization for multi-depot heterogeneous vehicle routing problem with soft time windows

Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.

基于DSP环境非特定人命令集语音识别系统

文中主要对TMS320VC5402 DSP硬件实现非特定人命令集语音识别系统进行了讨论。识别算法采用优化动态时间规整算法(DTW dynamic time warping)。

Optimization Route Algorithm Based on the Minimal Transfer Time and Distance

The transfer system,an important subsystem in urban citizen passenger transport system,is a guarantee of public transport priority and is crucial in the whole urban passenger transport traffic.What the majority of bus passengers consider is the convenience and comfort of the bus ride,which reduces the transfer time of bus passengers."Transfer time" is considered to be the first factor by the majority of bus passengers who select the routes.In this paper,according to the needs of passengers,optimization algorithm,with the minimal distance being the first goal,namely,the improved Dijkstra algorithm based on the minimal distance,is put forward on the basis of the optimization algorithm with the minimal transfer time being the first goal.

An Objective-Based Gradient Method for Locating the Pareto Domain

In this paper, an objective-based gradient multi-objective optimization （MOO） technique, the Objective-Based Gradient Algorithm （OBGA）, is proposed with the goal of defining the Pareto domain more precisely and efficiently than current MOO techniques. The performance of the OBGA in locating the Pareto domain was evaluated in terms of precision, computation time and number of objective function calls, and compared to two current MOO algorithms： Dual Population Evolutionary Algorithm （DPEA） and Non-Dominated Sorting Genetic Algorithm I1 （NSGA-II）, using four test problems. For all test problems, the OBGA systematically produced a more precise Pareto domain than DPEA and NSGA-II. With the adequate selection of the OBGA parameters, computation time required for the OBGA can be lower than that required for DPEA and NSGA-II. Results clearly show that the OBGA is a very effective and efficient algorithm for locating the Pareto domain.

An Optimal Online Algorithm for Fractional Scheduling on Uniform Machines with Three Hierarchies

This paper is concerned with the fractional version of online hierarchical scheduling problem on uniform machines.In the problem,the jobs and machines have several different hierarchies and each job can be arbitrarily split between the machines with hierarchies not above the hierarchy of the job.The objective is to minimize the makespan.The authors present an optimal algorithm for the problem with three hierarchies.