Power Line Communications Networking Method Based on Hybrid Ant Colony and Genetic Algorithm

When solving the routing problem with traditional ant colony algorithm, there is scarce in initialize pheromone and a slow convergence and stagnation for the complex network topology and the time-varying characteristics of channel in power line carrier communication of low voltage distribution grid. The algorithm is easy to fall into premature and local optimization. Proposed an automatic network algorithm based on improved transmission delay and the load factor as the evaluation factors. With the requirements of QoS, a logical topology of power line communication network is established. By the experiment of MATLAB simulation, verify that the improved Dynamic hybrid ant colony genetic algorithm (DH_ACGA) algorithm has improved the communication performance, which solved the QoS routing problems of power communication to some extent.

Traveling Salesman Problem Using an Enhanced Hybrid Swarm Optimization Algorithm

The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.

A Novel Approach Based on Hybrid Algorithm for Energy Efficient Cluster Head Identification in Wireless Sensor Networks

The Wireless Sensor Networks(WSN)is a self-organizing network with random deployment of wireless nodes that connects each other for effective monitoring and data transmission.The clustering technique employed to group the collection of nodes for data transmission and each node is assigned with a cluster head.The major concern with the identification of the cluster head is the consideration of energy consumption and hence this paper proposes an hybrid model which forms an energy efficient cluster head in the Wireless Sensor Network.The proposed model is a hybridization of Glowworm Swarm Optimization(GSO)and Artificial Bee Colony(ABC)algorithm for the better identification of cluster head.The performance of the proposed model is compared with the existing techniques and an energy analysis is performed and is proved to be more efficient than the existing model with normalized energy of 5.35%better value and reduction of time complexity upto 1.46%.Above all,the proposed model is 16%ahead of alive node count when compared with the existing methodologies.

Hybrid Power Bank Deployment Model for Energy Supply Coverage Optimization in Industrial Wireless Sensor Network

Energy supply is one of the most critical challenges of wireless sensor networks(WSNs)and industrial wireless sensor networks(IWSNs).While research on coverage optimization problem(COP)centers on the network’s monitoring coverage,this research focuses on the power banks’energy supply coverage.The study of 2-D and 3-D spaces is typical in IWSN,with the realistic environment being more complex with obstacles(i.e.,machines).A 3-D surface is the field of interest(FOI)in this work with the established hybrid power bank deployment model for the energy supply COP optimization of IWSN.The hybrid power bank deployment model is highly adaptive and flexible for new or existing plants already using the IWSN system.The model improves the power supply to a more considerable extent with the least number of power bank deployments.The main innovation in this work is the utilization of a more practical surface model with obstacles and training while improving the convergence speed and quality of the heuristic algorithm.An overall probabilistic coverage rate analysis of every point on the FOI is provided,not limiting the scope to target points or areas.Bresenham’s algorithm is extended from 2-D to 3-D surface to enhance the probabilistic covering model for coverage measurement.A dynamic search strategy(DSS)is proposed to modify the artificial bee colony(ABC)and balance the exploration and exploitation ability for better convergence toward eliminating NP-hard deployment problems.Further,the cellular automata(CA)is utilized to enhance the convergence speed.The case study based on two typical FOI in the IWSN shows that the CA scheme effectively speeds up the optimization process.Comparative experiments are conducted on four benchmark functions to validate the effectiveness of the proposed method.The experimental results show that the proposed algorithm outperforms the ABC and gbest-guided ABC(GABC)algorithms.The results show that the proposed energy coverage optimization method based on the hybrid power bank deployment model generates more accurate results than the results obtained by similar algorithms(i.e.,ABC,GABC).The proposed model is,therefore,effective and efficient for optimization in the IWSN.

多约束下矩形件排样问题的混合求解算法研究

针对板材和玻璃下料过程中存在的矩形件排样问题,提出了一种基于分割匹配算法与改进蚁群算法的混合算法进行求解。建立了以最大化均方利用率和剩余加工时间为目标的排样优化模型;利用蚁群算法作为排样顺序算法确定部分零件的排样顺序以满足零件的加工时间限制,为了提高蚁群算法搜索效率,提出了自适应信息素更新策略,引入基于遗传变异和2-opt变异的混合变异策略来增强局部搜索能力。针对于零件在毛坯上位置的排布问题,为提高毛坯的均方利用率同时又满足一刀切约束条件,提出分割匹配算法进行矩形件排布优化。将改后的算法与其他优化算法用国际标准测试案例和企业实际案例进行对比分析,验证了所提混合算法的有效性。

基于混合遗传算法的堆垛机路径优化研究

针对自动化立体仓库中堆垛机运行路径杂乱的问题,研究了一种基于遗传算法和蚁群算法相结合的混合遗传算法。设计和构建了立体仓库的整体运行模型,并对仓库中的运行区域进行了划分,实现了区域的合理分配。通过新的混合遗传算法,实现了对堆垛机控制算法的优化。通过实验计算,证明了在利用混合遗传算法控制堆垛机存取货物时,堆垛机行走的路程要比使用遗传算法时更加优秀,混合遗传算法能够将路径优化7%左右,因此混合遗传算法满足优化条件。

基于粒子-蚁群混合算法的截割头形状优化设计

针对EBH-150型横轴式掘进机截割头在截割过程中遇到的载荷波动问题,采用粒子-蚁群混合算法对现有抛物线形截割头进行优化设计。利用Matlab数值模拟软件,对截齿的排列参数进行多目标优化,以期减少载荷波动并提升掘进机的工作稳定性。优化结果显示,截割头的截线间距经过调整后,从外向内逐渐减小,使得单个截齿受力更为均匀。横向载荷波动降低了约62%,其他方向的载荷波动也显著降低,均超过50%。这些改进有效提高了掘进机横摆进刀的稳定性,并有助于延长截割头的使用寿命。尽管优化后的截割头在某些方向上的载荷均值有所增加,但载荷峰值降低,避免了单个截齿的过载现象。总体而言,优化设计取得了理想的效果,但仍需通过实际应用进行验证。本研究为掘进机截割头的优化设计提供了一种有效的算法支持,对于提高掘进机的工作效率和安全性能具有重要意义。

Solving algorithm for TA optimization model based on ACO-SA

An ant colony optimization （ACO）-simulated annealing （SA）-based algorithm is developed for the target assignment problem （TAP） in the air defense （AD） command and control （C2） system of surface to air missile （SAM） tactical unit. The accomplishment process of target assignment （TA） task is analyzed. A firing advantage degree （FAD） concept of fire unit （FU） intercepting targets is put forward and its evaluation model is established by using a linear weighted synthetic method. A TA optimization model is presented and its solving algorithms are designed respectively based on ACO and SA. A hybrid optimization strategy is presented and developed synthesizing the merits of ACO and SA. The simulation examples show that the model and algorithms can meet the solving requirement of TAP in AD combat.

Improved algorithms to plan missions for agile earth observation satellites

This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.

考虑碳排放的两阶段选址-路径问题及其算法

为减少物流车辆的碳排放,基于以排放因子为主要参数的碳排放计算方法,建立以碳排放最小化为目标的两阶段选址-路线问题(2E-LRP)模型,并设计了一种可用于快速求解大规模问题的两阶段混合算法(TSHA).算法第一阶段将2E-LRP转化成不考虑车辆路径的两阶段设施选址问题,调用Cplex直接求解得到配送中心选址和客户分配方案;在此基础上,算法第二阶段中,物流园区到被选用的配送中心以及配送中心到所分配客户的车辆路径问题被进一步转化成若干个独立的VRP(vehicle routing problem)问题,再运用改进的蚁群算法进行求解;最后,对Prodhon标准算例集中全部6个最大规模的算例进行测试.研究结果表明:与TSHA具有相同算法思想的TSHA-Ⅱ算法能够在求解质量下降2.3%的情况下将计算时长大大缩短至25 s左右;TSHA算法在求解考虑碳排放的2E-LRP算例时表现非常稳定,可以作为一种求解考虑碳排放2E-LRP的有效算法.

混合人工蜂群算法在船舶通信网络优化中的应用

混合人工蜂群算法是一种基于仿生学的智能算法,该算法通过模拟蜂群中的分工行为进行局部寻优,能够实现优化问题的快速收敛。船舶无线通信网络由网络节点、网络链路、船舶终端等构成,通信网络的性能关系到船舶导航、AIS系统运行等。本文结合混合人工蜂群算法,进行船舶无线通信网络的覆盖率提升等优化研究,有助于改善当前船舶无线通信网络的性能。

混合蚁群算法的实况路网低碳冷链路径优化

针对市区内交通车速变化频繁、备选路径多的特点,传统算法选择路径时计算量大导致无法有效收敛,提出一种蚁群与Dijkstra混合算法进行求解。首先利用高德地图API获取市区主要交通道路及其在不同时刻的车速,并运用BP神经网络对车速进行预测。在此基础上,综合考虑固定成本、时间变动成本、路程变动成本、时间窗惩罚成本及碳成本,以总成本最低为目标函数,利用贪心规则的Dijkstra算法搜索路径,通过不断调整蚁群算法留下的信息素来调整道路运输成本,建立修正成本地图,在路况发生变动时通过调用地图提高二次搜索速度,并使用Python编程进行验证。实例证明,混合算法结合了蚁群算法正反馈的特性以及Dijkstra算法全局搜索能力强的特点,缩短了应对路况变化所需的时间,并能有效根据当前交通实况规划出合理路径。

基于混合蚁群算法的核应急车辆疏散路径规划

核事故的发生具有不可预测性和破坏性,为应急车辆制定合理的疏散计划将危险区域的人员撤离至安置点,可以有效减少人员所受到的伤害。针对核事故下应急车辆路径规划问题,以累积辐射剂量为评价指标,提出了一种基于混合蚁群算法(Hybrid ant colony algorithm,HACO)的车辆路径规划方法。首先,利用模糊网络建立了时间窗内疏散路径平均通行时间期望模型,同时结合累积辐射剂量计算模型,建立了能够随时间变化的动态累积辐射剂量计算模型。然后在蚁群算法迭代过程中引入模拟退火算法,并且在邻域搜索中引入A*算法启发式思想,提高了算法全局寻优能力。为进一步提高算法的局部搜索能力,引入帕累托排序方式,在蚁群算法信息素更新方式中加入距离对信息素增量的影响。仿真结果表明:HACO算法相较于蚁群算法平均收敛值提高了31%,稳定性提高了30%,能够为核事故下疏散路径规划预案的制定提供技术支持。

基于改进人工蜂群算法的家庭储能容量优化配置

家庭能源系统中的储能设备初始投资成本高,限制其实际应用。针对此问题,文章对混合储能的容量配置进行了研究。分别构建了刚性负荷、柔性负荷和储能类设备负荷模型;在此基础上搭建以用户每天用电费用最低为目标的家庭能源管理系统模型;提出一种改进的人工蜂群算法对模型求解。实验结果表明,通过和单储能的系统相比,在满足用户用电需求的同时,配置混合储能的家庭能源系统能有效减小用户每天用电费用。对文中算法与人工蜂群算法和粒子群算法优化结果进行比对,证实所提算法优化时长短、收敛速度快且不易于陷入局部最优。

基于改进蚁群算法的两栖无人飞行器陆空混合路径规划

针对两栖无人飞行器在三维环境中存在过多的能源消耗、收敛速度慢以及算法运行时间较长的情况,提出了一种基于改进蚁群算法的三维陆空混合路径规划方法。采用分层与栅格平面法相结合的方法建立三维环境模型,在该模型中每只蚂蚁采用概率选点的搜索模式搜索路径,在概率选点公式中,结合能源的消耗,更好地筛选优质路线;同时,考虑蚁群在搜索路径时需向终点靠近,引入前进角这一概念,规定范围优化蚂蚁的搜索方向,减少了不必要的蚂蚁浪费;引入影响因子,加快算法的收敛速度,减少算法的运行时间,优化全局信息素的更新方式;创建一个以能源消耗为考量的评价函数进行适应度值的选择,最终生成陆空混合路径轨迹。仿真结果表明,改进后的蚁群算法较传统蚁群算法相比路径规划的速度更快,能够更高质量地生成陆空混合路径,具有一定的实用价值和工程意义。

反向人工蜂群算法求解混合流水车间调度问题

针对以最小化最大完工时间为优化目标的混合流水车间调度问题,提出一种融合反向学习策略的反向人工蜂群算法求解该问题。首先,根据混合流水车间调度问题的特点,建立了对应的数学模型和仿真优化模型;其次,在寻优过程中为了避免陷入局部最优,分别在种群初始化、雇佣蜂和观察蜂三个阶段引入了反向学习策略,采用两点间逆序策略和元素交换策略加快寻优速度,并采用精英保优策略保留最优解;最后,选取2个实例和21个不同规模的benchmark算例进行仿真实验,通过与相关算法的实验结果进行对比分析,验证了所提算法能有效求解此类问题。

基于混合蚁群算法的无人船航行路径自主规划

路径规划是无人船自主导航的核心问题。由于无人船当前位置以及目标位置的确定受到障碍物影响,最佳航行路径的获取难度较大。为此,提出基于混合蚁群算法的无人船航行路径自主规划方法。采用栅格法构建无人船工作环境模型,由上至下、由左至右的对栅格完成编号处理,划分安全区域与障碍物区域。构建无人船航行路径自主规划数学模型,设定地形与威胁、航程上限以及路径平滑度等约束条件。针对蚁群算法初始搜索效率差等问题,将其与粒子群算法相结合,提出混合蚁群算法。利用该算法求解无人船航行路径自主规划数学模型。实验结果显示,研究方法具有较高的路径规划准确性,路径长度、平均能耗及路径规划时间指标均较优。

融合蚁群算法MMSE准则在MMW混合波束形成中的应用

波束形成预编码技术是毫米波通信的核心技术,其中模拟和数字混合波束形成技术可以很好地平衡模拟预编码技术和数字预编码技术的优缺点,既可以得到足够的波束形成增益、减少传播损耗,又降低了硬件成本和功耗。均方误差(MSE)是表征毫米波通信传输可靠性的性能指标,利用最小均方误差(MMSE)准则的混合预编码设计可以在毫米波大规模多输入多输出(MIMO)系统中获得较好的频谱效率。将MMSE与广泛应用于解决旅行商问题的蚁群算法相融合,以进一步优化基于流形优化的混合预编码算法。仿真结果表明,融合后的优化算法具有更低的误码率和更好的频谱效率。

基于GWO-ABC的混合算法研究

大多数种群优化算法面临的共同缺陷是全局搜索能力不足,易陷入局部最优解。文章基于灰狼优化算法和人工蜂群算法,引入混沌映射和OBL策略,提出了新型GWO-ABC混合优化算法。通过GWO-ABC算法优化了FOPID控制器的参数,仿真结果表明,该算法性能优于其它算法。

A Novel Hybrid Vortex Search and Artificial Bee Colony Algorithm for Numerical Optimization Problems

Though vortex search（VS） algorithm has good performance in solving global numerical optimization problems, it cannot fully search the whole space occasionally. Combining the vortex search algorithm and the artificial bee colony algorithm（ABC） which has good performance in exploration, we present a HVS（hybrid vortex search） algorithm to solve the numerical optimization problems. We first use the employed bees and onlooker bees of ABC algorithm to find a solution, and then adopt the VS algorithm to find the best solution. In the meantime, we cannot treat the best solution so far as the center of the algorithm all the time. The algorithm is tested by 50 benchmark functions. The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms.