WFRFT modulation recognition based on HOC and optimal order searching algorithm

A hybrid carrier（HC） scheme based on weighted-type fractional Fourier transform（WFRFT） has been proposed recently.While most of the works focus on HC scheme＇s inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants（HOC）. First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_（42）. Then, a combinatorial searching algorithm is designed to minimize C_（42）.Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable.

Taboo Search Algorithm for Item Assignment in Synchronized Zone Automated Order Picking System

The idle time which is part of the order fulfillment time is decided by the number of items in the zone; therefore the item assignment method affects the picking efficiency. Whereas previous studies only focus on the balance of number of kinds of items between different zones but not the number of items and the idle time in each zone. In this paper, an idle factor is proposed to measure the idle time exactly. The idle factor is proven to obey the same vary trend with the idle time, so the object of this problem can be simplified from minimizing idle time to minimizing idle factor. Based on this, the model of item assignment problem in synchronized zone automated order picking system is built. The model is a form of relaxation of parallel machine scheduling problem which had been proven to be NP-complete. To solve the model, a taboo search algorithm is proposed. The main idea of the algorithm is minimizing the greatest idle factor of zones with the 2-exchange algorithm. Finally, the simulation which applies the data collected from a tobacco distribution center is conducted to evaluate the performance of the algorithm. The result verifies the model and shows the algorithm can do a steady work to reduce idle time and the idle time can be reduced by 45.63% on average. This research proposed an approach to measure the idle time in synchronized zone automated order picking system. The approach can improve the picking efficiency significantly and can be seen as theoretical basis when optimizing the synchronized automated order picking systems.

基于“车-路-站-网”信息耦合的电动汽车有序充电策略

为了消解规模化电动汽车(electrical vehicle,EV)无序充电对交通路网、充电站和配电网运行稳定性带来的负面影响,提出一种基于“车-路-站-网”信息耦合的电动汽车有序充电策略。首先,构建“车-路-站-网”信息耦合模型和动态Floyd最短时间路径搜索模型,为EV用户搜寻最短耗时路径。其次,基于“车-路-站-网”实时状态预测EV用户选择不同路径前往各充电站快充产生的充电决策因素,通过层次分析法和改进CRITIC法综合EV用户充电决策因素的主客观权重,利用Topsis方法决策EV用户的最优充电路径。最后,提出EV用户慢充优化策略,对返程EV用户的慢充负荷进行优化,结合EV慢充和快充负荷,进一步实现配电网负荷的削峰填谷。仿真结果表明,所提出的EV有序充电策略能够同时提升“车-路-站-网”多方运行水平。

双区型仓库订单分批与拣选协同优化研究

针对订单分拣效率低下导致商品出库缓慢的问题,提出一种基于双区型仓库订单分批与拣选的协同优化模型,设计求解模型的CWDP-BSA(clarke-wright and dynamic programming&backtracking search algorithm)协同优化算法。在节约算法中引入快速排序法对订单组合的距离节约值排序,考虑AGV承载量,运用多阶段决策过程最优策略得出状态转移方程求解订单分批模型,确定初始分批方案;并采取多因子选择的回溯搜索算法求解拣选路径模型,以此确定初始拣选方案。再以以上两方案为基础,建立新的基于订单时间窗的订单分批和拣选协同优化模型并求解,进一步优化订单分批和拣选方案。最后通过对比实验得出,平均每批次订单的拣选距离减少了约24.56%,优化后的拣选时间比优化前缩短了约11.4%,在求解不同规模算例时,CWDP-BSA算法的求解结果优于CPLEX软件和其他算法,验证了模型与算法的稳定性和有效性。实验表明,协同优化后的订单分批与物品拣选策略能够有效提升订单出库效率。

基于改进的禁忌搜索算法在有序用电中的应用

国家电力系统负荷与日俱增,用户用电数据海量增长,需要高性能优化算法来解决此类复杂的有序用电问题.为了填补有序用电系统调度中的负荷缺口,提高供电效能并合理选择用户,本文提出了一种改进的禁忌搜索算法来求解电力供需平衡的多目标优化调度问题.使用融入了莱维飞行的野狗优化算法对禁忌搜索算法中的初始化阶段进行优化,得到一种改进的禁忌搜索算法.该方案增强了原始算法的搜索能力,加快了算法的收敛速度,提供了一种更优的解决方案.最后通过消融实验以及与5个经典的启发式算法进行对比实验来验证所提出的算法的性能.

Structure learning on Bayesian networks by finding the optimal ordering with and without priors

Ordering based search methods have advantages over graph based search methods for structure learning of Bayesian networks in terms on the efficiency. With the aim of further increasing the accuracy of ordering based search methods, we first propose to increase the search space, which can facilitate escaping from the local optima. We present our search operators with majorizations, which are easy to implement. Experiments show that the proposed algorithm can obtain significantly more accurate results. With regard to the problem of the decrease on efficiency due to the increase of the search space, we then propose to add path priors as constraints into the swap process. We analyze the coefficient which may influence the performance of the proposed algorithm, the experiments show that the constraints can enhance the efficiency greatly, while has little effect on the accuracy. The final experiments show that, compared to other competitive methods, the proposed algorithm can find better solutions while holding high efficiency at the same time on both synthetic and real data sets.

基于和声搜索的环控通风调控策略优化

针对地铁车站环控通风系统风机定频运行,导致风机无法跟随站台PM2.5的浓度的变化而改变频率,造成能源浪费;根据环控通风系统的运行现状,可将其划分为只送不排模式、不送只排模式和即送又排模式,并考虑到环控通风系统应适应多扰动的影响,选取最小二乘法系统辨识一阶惯性时滞模型,用于描述变量动态变化响应传递函数,采用自抗扰控制器建立环控通风系统控制模型,利用和声搜索算法对环控通风模型PM2.5浓度设定值寻优,结果显示经过策略优化之后,只送不排模式、不送只排模式和即送又排模式站台PM2.5平均浓度分别降低了7%、8%和10%,风机能耗分别降低了19%、19%和30%。

SMOOTHING NEWTON ALGORITHM FOR THE CIRCULAR CONE PROGRAMMING WITH A NONMONOTONE LINE SEARCH

In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.

The New Approximate Calculation Method for the First Order Reliability

The new method is presented for computing engineering structure reliability by direct searching the next checking point and accelerating convergence based on the analysis of errors in the center point method and borrowing ideas form the merits of the other First-Order Second Moment (FOSM) methods. The idea of the direct searching method is constructing a new explicit searching formula to make the new checking point being more closed to the failure surface based on the results of the center point method. The new checking point has steepest descent character because the searching path is the gradient of the approximate surface. An example shows that the method presented in this article has well precision. Although the direct searching formula may not reach the globally optimal point, the error can be controlled owing to the locally optimal plan at each searching step.

改进遗传-狼群对节点序寻优的贝叶斯网络结构算法

贝叶斯网络是数据挖掘领域的一种重要方法。针对贝叶斯网络结构学习算法寻优效率低和易陷入局部最优的问题,提出一种基于改进的混合遗传-狼群对节点序寻优的贝叶斯网络结构学习算法。该算法首先利用深度优先搜索对最大支撑树的节点进行拓扑排序;然后利用动态变异及最优交叉算子构建适用于节点序寻优的改进捕食行为,引入动态参数因子来增强算法局部寻优能力;最后与K2算法结合得到最优的贝叶斯网络结构。用3种不同大小的标准网络数据集中进行实验,结果表明,该算法收敛到较优值,寻优效率高于其它同类优化算法。

一种基于物流机器人的订单拣选排程算法设计与实现

近年来基于物流机器人的智能物流系统逐渐应用于仓库运营中,大幅度提高了订单拣选的效率,减少了人力劳动。为解决电商行业广泛应用的订单拣选问题,以最小化完成所有订单拣选所需的货架搬运次数为目标,建立整数规划模型,并设计订单拣选排程算法。由于该问题属于NP-hard问题,从订单排序和货架排序两个角度,分别设计两种变邻域搜索算法VNS-OS和VNS-RS,进而设计交替求解订单和货架排序的AH算法。在小规模算例下,对比商业求解器CPLEX在指定时间内求得的解,证明了该算法在计算时间和目标函数上的优势。在大规模算例下,验证了两种VNS算法对初始解的优化效果明显,平均优化程度高于10%,而AH算法在计算时间上具有很大优势。利用所提出的算法对储位分配策略的影响进行研究,为基于机器人的仓库运营提供参考。

A FAST SEARCH METHOD BASED ON THE STATISTICAL PROPERTIES OF SIGNAL

The concepts of ordered code-book and the priority of code-vector are proposedin this paper.The statistical properties of a signal are investigated through its coded sequence.Experimental results are presented which provide some insight into the statistical properties ofvector quantized sequences.Based on the given concepts and experimental results,a fast searchmethod for the vector quantization of correlated information sources,such as Gauss-Markovsources,is proposed and has shown its efficiency in simulation results.

电商RMFS系统订单分配与路径规划联合优化方法

随着电子商务的蓬勃发展,海量客户需求和高频率、多品种、小批量的订单特性为订单拣选业务带来巨大挑战。在物流智能化的趋势下,大量电商企业采用移动机器人拣货系统(Robotic Mobile Fulfillment System,RMFS)进行订单拣选。订单分配和拣选路径规划是影响仓库订单拣选效率的关键决策。为了提高电商RMFS系统拣选效率,降低仓库运营成本,基于电商企业多订单、多货架、多拣选站下的拣选业务场景,以最小化机器人负载距离为目标,构建订单分配与路径规划联合优化模型,设计两阶段的A*算法和自适应大领域搜索算法(Adaptive Large Neighborhood Search,ALNS),在ALNS算法原有框架的基础上提出新的移除和修复算子以适应订单分配问题,并针对30个不同规模算例进行计算分析。计算结果表明,所提出的优化方法收敛快、性能稳定,能够有效缩短机器人行走距离,相比先到先拣选策略最大可缩短47.6%的机器人负载距离。同时,也可在更短时间内获得与CPLEX求解质量相近的解。尤其是当订单数量增长时,相比CPLEX具有突出时间优势,可以实现电商仓储资源的合理调度和配置,从而为电商企业仓储智能化提供有效决策指导。

基于演化序搜索的混合贝叶斯网络结构学习方法

贝叶斯网络是一种不确定性知识表示与推理的有效工具,学习其结构是利用这一工具进行推理的基础。现有的贝叶斯网络结构学习算法,在智能教育等应用场景中往往面临着难以权衡有效性与高效性的问题。一方面,评分搜索类方法能搜索到高质量的解,但面临着算法复杂度高的挑战。另一方面,混合类方法效率高,但所找到的解的质量不尽如人意。针对上述问题,提出了一种基于演化序搜索的混合贝叶斯网络结构学习方法(EvOS)。该方法首先通过约束类算法构建无向图骨架,然后利用演化算法搜索最优节点序,最后使用该节点序指导贪婪搜索得到贝叶斯网络结构。基于常用基准数据集以及教育知识结构发现任务,验证了所提方法的有效性与高效性。实验结果表明,所提方法相较于评分搜索类方法,能够在保持相仿精度的情况下最高加速百倍,且有效性显著高于混合类方法。

基于改进离散型麻雀搜索算法的配电网恢复重构方法

针对传统智能优化算法在恢复重构中搜索空间大、不可行解多,且易早熟收敛、效率低等问题,提出了一种基于改进离散型麻雀搜索算法的配电网恢复重构方法。利用配电网每生成一个环路需断开一个开关来保持其辐射状的思想,采用基于有序环矩阵的整数编码方式对多个环路内的开关状态进行编码。结合Sin混沌映射、Metropolis和扰动机制设计了改进的离散型麻雀搜索算法,并将其应用于配电网恢复重构模型的求解。大量仿真表明所提方法能有效实现恢复重构,使重构后配电网的供电可靠性和供电质量得到改善。

多门店协同下的订单拆分与配送联合优化方法

新零售带动传统企业转型,加速了以实体门店作为前置仓的线上订单履行模式的发展。针对订单需求不确定导致的就近门店无法满足订单需求的情况,提出多门店协同下的订单拆分与配送的联合优化问题。通过引入拆单数量限制,缩减问题求解空间,同时为了减少单独配送导致的路径重叠,采用协同配送的模式整合路径,并通过订单拆分与配送之间的调整优化降低订单履行成本。集成广度优先搜索和局部搜索算法,构造TNILS(top-N&improved local search)混合启发式算法求解问题。在合成数据集的基础上,通过协同配送与单独配送的结果对比,证明了协同配送的有效性及提出算法的可行性。通过与其他算法的实验结果对比,验证TNILS算法的有效性和稳定性。

一种优化节点序搜索算子的BN结构学习方法

节点序空间下的局部搜索算法是一种性能良好的贝叶斯网络结构学习方法,在学习效率上具有极大的优势。然而,现有的该类算法通常存在节点序优化不足、学习精度低等问题,并容易停止在一个局部最优。为解决这些问题,对节点序空间下的局部搜索算法进行了研究,提出了一种新的通过优化节点序搜索算子来提高贝叶斯网络结构学习精度的IWINOBS算法。将迭代局部搜索算法与窗口算子相结合来搜索节点序空间中给定节点序的邻域,减小了算法陷入局部最优值的概率,从而获得质量更高的网络结构。实验结果表明:与网络结构空间下的贝叶斯网络结构学习算法相比,所提算法的学习效率提升了54.12%;与现有节点序空间下的贝叶斯网络结构学习算法相比,所提算法的学习精度提高了2.33%。

一种极值搜索的齿轮系统振动信号阶次跟踪方法

在变速工况下,齿轮系统的振动信号具有非平稳性,频谱特征模糊,不利于特征提取和故障诊断。阶次跟踪方法作为一种非平稳信号分析方法,将原信号从时间域转换到角度域,有助于抑制变转速导致的频率模糊现象。广泛应用的计算阶次跟踪分析方法在实现等角度重采样过程中,通过提取瞬时转速积分求取瞬时角位移,或者基于相位解调获取角度‑时间关系,受限于积分累计误差或小的转速跟踪范围。利用齿轮系统啮合振动信号峰峰值对应的等角度间隔特征,提出一种基于时域信号极值搜索的无键相阶次跟踪方法。所提方法不需要通过转速积分获取瞬时角位移,同时允许较大转速变化范围,降低了阶次分析域变换过程的误差,抗噪性能良好,使阶次谱能量集中度和特征成分辨识度得到明显提高。理论分析、仿真对比分析和试验测试结果均验证了所提方法的有效性,适用于变转速工况下的齿轮箱非平稳振动信号频谱分析和故障诊断。

基于自适应布谷鸟搜索算法的分数阶PID控制器设计

针对分数阶PID(fractional order PID,FOPID)控制器的设计问题,提出一种基于自适应布谷鸟搜索算法的分数阶PID控制器参数整定算法。为改进经典布谷鸟算法的收敛速度与计算精度,并充分发挥全局搜索和局部挖掘两者各自的优势,采用了基于系统误差的自适应步长策略。为保证布谷鸟搜索算法初始化种群的均匀性,采用佳点集法初始化种群替代经典算法中的随机初始化种群。最后对2类系统进行仿真实验,并将实验结果与现有结果进行对比,验证了基于自适应布谷鸟搜索算法的分数阶PID控制器的设计和参数整定方法的有效性和优良性。

“RMFS”拣选系统的订单分批优化

在全球零售额和当天交货量不断增长的时代,实现订单的快速交付和优质分批是影响移动机器人履行系统(Robotic Mobile Fulfillment Systems,RMFS)拣选效率的关键因素.为构造高质量订单分配批次、提升RMFS系统拣选效率,提出融合大邻域搜索的改进差分进化算法(LNS_DE),引入大邻域搜索的破坏与修复思想及一批基于随机、基于最大代价贡献和基于集中批次的移除算子以及新的插入算子组件,以最小化订单总延迟时间为目标建立订单分批优化模型,并针对不同订单规模算例进行实验仿真.仿真结果表明,所提出的订单分批优化算法较差分进化算法(DE)相比求解质量更优,性能更稳定、收敛速度更快,尤其当订单数量增大时,LNS_DE算法解的平均值优化比例不断扩大,这为提高RMFS系统拣选效率,实现订单快速响应提供有效决策指导.