初始信息素筛选的蚁群优化算法在HDFS副本选择中的研究

随着社会信息化程度的不断提高,各种形式的数据急剧膨胀.HDFS成为解决海量数据存储问题的一个分布式文件系统,而副本技术是云存储系统的关键.提出了一种基于初始信息素筛选的蚁群优化算法(InitPh_ACO)的副本选择策略,通过将遗传算法(GA)与蚁群优化算法(ACO)算法相结合,将它们进行动态衔接.提出基于初始信息素筛选的ACO算法,既克服了ACO算法初始搜索速度慢,又充分利用GA的快速随机全局搜索能力.利用云计算仿真工具CloudSim来验证此策略的效果,结果表明:InitPh_ACO策略在作业执行时间、副本读取响应时间和副本负载均衡性三个方面的性能均优于基于ACO算法的副本选择策略和基于GA的副本选择策略.     

D2D异构网络节能模式选择和资源分配

为合理分配蜂窝网络的频谱资源,提升蜂窝网络能源效率,降低用户间的干扰,提出一种基于深度强化学习的设备到设备(D2D)异构网络节能模式选择和资源分配方法。构建系统模型并对节能模式选择和资源分配进行优化;将优化问题转化为马尔可夫决策过程(MDP),采用深度确定性策略梯度算法(DDPG)找到最优问题的最优策略,实现最大化长期能效。通过仿真分析与其它4种方法进行性能对比,实验结果表明,所提方法在D2D异构网络中具有更高的能源效率,表现出更好的收敛性,可有效提升系统吞吐量和频谱资源利用率。     

基于自适应蚁群优化算法的认知决策引擎

认知决策引擎的设计是认知无线电系统中的一项关键技术,它的主要功能是依据通信环境的变化和用户需求动态地配置无线电工作参数。提出了一种基于自适应蚁群算法的认知决策引擎来实现工作参数的最优化配置。该算法在基本蚁群算法的基础上加入了路径选择机制和信息素挥发因子自适应调整机制,保证了算法的全局搜索能力和收敛速度,有效地避免了容易陷入局部最优解的缺陷。仿真结果表明,在不同的环境下基于该算法的认知引擎比GA和ACO算法具有更好的性能。     

基于家庭基站密度的自适应无线资源分配策略

针对飞蜂窝(又叫家庭基站)中干扰严重、资源利用率低等问题,提出一种基于家庭基站密度的自适应无线资源分配策略。通过频率分割抑制宏蜂窝与飞蜂窝间的干扰,依托资源复用和功率控制抑制飞蜂窝之间的干扰,并基于自组织网络技术实现家庭基站接入点(FAP)的自动配置。仿真和性能分析表明,策略在最大限度提高无线资源利用率的同时,基本实现了零干扰,并将系统总吞吐量提高了20%;尤其适用于家庭基站密集或无线资源紧张的应用场合。     

基于分解优化的多星合成观测调度算法

某些卫星的侧摆性能较差, 必须进行合成观测以提高观测效率. 研究了多星联合对地观测中的任务合成观测调度问题. 提出了将原问题分解为任务分配与任务合成的分解优化思路. 任务分配为任务选择卫星资源及时间窗口; 任务合成则针对该分配方案,将分配到各卫星的任务按照轨道圈次分组, 分别进行最优合成. 采用蚁群优化算法(Ant colony optimization, ACO)求解任务分配问题, 通过自适应参数调整及信息素平滑策略, 实现全局搜索和快速收敛间的平衡.提出了基于动态规划的最优合成算法, 求解任务合成子问题,能够在多项式时间内求得最优合成方案. 依据分配方案的合成结果, 得到优化方案的特征信息, 反馈并引导蚁群优化算法对任务分配方案的搜索过程. 大规模测试算例验证了本文算法的效率.     

基于BP算法和ACO算法的故障诊断推理研究

BP算法在故障诊断领域已取得广泛应用,但其存在收敛速度慢且容易陷入局部最小值的缺陷,限制了其进一步的发展;ACO(Ant colony optimization)算法是一种模拟进化算法,已很好地应用于解决旅行商和资源两次分配等经典的优化问题,具有启发式收敛、正反馈以及分布式计算等优点;为此,将ACO算法引入BP算法故障诊断方法中,使用ACO算法对BP网络中的参数即权值、阈值以及学习率等进行优化,定义了一种结合ACO算法和BP算法能对故障进行诊断的新算法,并将其应用于具体的故障诊断实例中,最后,通过100组样本中的95组进行训练,并对剩余5组进行故障诊断,实验证明结合ACO算法和BP算法的新算法较传统的仅使用BP算法的诊断方法具有收敛速度快、诊断精确高以及训练性能好的优点。     

基于GA的网络最短路径多目标优化算法研究

针对现有基于遗传算法(GA)优化的网络最短路径算法存在优化目标单一、遗传编码质量低、搜索策略间平衡性差、适应度分配效率与灵活性较低等问题,建立一种多目标优化最短路径自适应GA模型,提出了优先级编码和优先级索引交叉算子,引入了遗传算子参数的模糊控制机制和基于自适应加权的适应度分配方法.实验结果表明,该算法的准确性和稳定性高、复杂度合理,实现了对网络设计优化中多目标最短路径问题的高质量求解.     

LTE-A飞蜂窝系统干扰协调智能优化算法

在同频组网的LTE-A飞蜂窝系统中,飞蜂窝基站的密集部署会造成较为严重的同频干扰,导致网络吞吐量和用户的服务质量(Quality of Service,QoS)降低。部分频率复用(Fractional Frequency Reuse,FFR)作为常用的干扰协调方案,可以有效地提高边缘用户的服务质量。在FFR方案的基础上,通过结合遗传算法和基于模拟退火的图着色算法,提出了一种智能优化部分频率复用(Intelligence-FFR,I-FFR)算法。该算法能够动态地调整中心区域所占比例和边缘区域的频率复用因子,以增加宏小区吞吐量,降低小区边缘区域用户的中断概率。仿真结果表明,与FFR-3干扰协调算法相比,提出的I-FFR算法可使宏小区吞吐量提升15%,同时边缘区域平均用户的中断概率从85%降低到40%。     

基于量子粒子群和SARSA算法的蜂窝网络信道分配

为了对蜂窝网络的信道进行在线、实时和动态的分配,设计了一种基于量子粒子群算法和SARSA算法的蜂窝网络信道分配方法。首先,采用分配方案表示量子粒子的位置,通过粒子群在粒子空间中不断寻优,将寻求的最优粒子位置作为信道分配方案的初始解。然后,根据得到的初始解的目标值来计算各状态动作对处的初始Q值,在此基础上,通过加入资格迹的SARSA(λ)算法和ε-greedy策略得到改进的SARSA(λ)算法,执行算法直到各状态动作对的Q值不发生变化为止,此时最终解为信道分配方案。为了验证文中方法的优越性,采用具有30个小区的移动蜂窝网络进行实验,仿真实验结果表明文中方法能实现蜂窝通信网络中信道的在线分配,且与其它方法比较,具有信道分配合理和收敛速度快的优点,是一种有效的信道分配方法。     

蜂窝网络中基于双层博弈的吞吐量最大化研究

如何提升系统的吞吐量是蜂窝网络中研究的热点。利用设备到设备通信(D2D)技术为蜂窝边缘用户设备提供中继支持，进而提升系统的吞吐量。描述一种中继节点选择和频谱分配的联合问题，帮助蜂窝边缘用户设备寻找合适的中继节点，并为D2D链路分配频谱，在满足D2D和传统蜂窝用户设备干扰约束的条件下使系统吞吐量最大化。为此，提出一种基于双层博弈模型的分布式算法，对上述问题进行求解。该博弈模型分为内层和外层；内层通过Stackelberg博弈理论为蜂窝边缘用户设备选择中继节点，并将其作为主节点，蜂窝边缘用户设备作为从节点；外层采用联合博弈理论为蜂窝边缘用户设备及其中继节点间的链路分配合适的频谱。仿真结果表明本文算法在能耗、吞吐量等方面的性能要优于其他典型算法。     

On Enforced Convergence of ACO and its Implementation on the Reconfigurable Mesh Architecture Using Size Reduction Tasks

In this paper we show that size reduction tasks can be used for executing iterative randomized metaheuristics on runtime reconfigurable architectures so that an improved throughput and better solution qualities are obtained compared to conventional architectures that do not allow runtime reconfiguration. In particular, the problem of executing ant colony optimization (ACO) algorithms on a dynamically reconfigurable mesh architecture is studied. It is shown how ACO can be implemented such that the convergence behavior of the algorithm can be used to dynamically reduce the size of the submesh that is needed for execution. Furthermore we propose a method to enforce the convergence of ACO leading to a faster reduction process. This increases the throughput of ACO algorithms on runtime reconfigurable meshes. The increased throughput is used for repeated runs of ACO algorithms on a given set of problem instances which significantly improves the obtained solution quality.     

基于误码率与中断概率约束的femtocell网络分布式功率控制

家庭基站(femtocell)网络可有效改善无线通信业务的室内覆盖性能,提高信道容量.然而,复杂的动态通信环境导致信道的不确定性,影响用户服务质量.基于此,研究双层femtocell网络在快衰落信道环境下基于误码率约束的功率控制问题;考虑信号传输的中断概率,以及服务质量指标–误码率等方面的要求,构造在此约束下的优化问题;最大化双层femtocell网络的净收益,使得网络系统的通信性能最优;通过对概率约束进行数学处理,将其转化为确定性形式,并提出分布式鲁棒优化算法对等价的确定性优化问题进行求解,从而获得最优功率分配策略.最后,通过仿真验证了所提出算法的收敛性和有效性.     

蚁群算法的收敛速度分析

蚁群算法(ACO)作为一类新型的机器学习技术,已经广泛用于组合优化问题的求解,同时也应用于工业工程的优化设计.相对于遗传算法(GA),蚁群算法的理论研究在国内外均起步较晚,特别是收敛速度的分析理论是该领域急待解决的第一大公开问题.文中的研究内容主要是针对这一公开问题而开展的.根据蚁群算法的特性,该研究基于吸收态Markov过程的数学模型,提出了蚁群算法的收敛速度分析理论.作者给出了估算蚁群算法期望收敛时间的几个理论方法,以分析蚁群算法的收敛速度,并结合著名的ACS算法作了具体的案例研究.基于该文提出的收敛速度分析理论,作者还提出ACO-难和ACO-易两类问题的界定方法;最后,利用ACS算法求解TSP问题的实验数据,验证了文中提出的分析结论,得出了初步的算法设计指导原则.     

Ant colony optimization for dynamic routing and wavelength assignment in WDM networks with sparse wavelength conversion

Since optical WDM networks are becoming one of the alternatives for building up backbones, dynamic routing, and wavelength assignment with delay constraints (DRWA-DC) in WDM networks with sparse wavelength conversions is important for a communication model to route requests subject to delay bounds. Since the NP-hard minimum Steiner tree problem can be reduced to the DRWA-DC problem, it is very unlikely to derive optimal solutions in a reasonable time for the DRWA-DC problem. In this paper, we circumvent to apply a meta-heuristic based upon the ant colony optimization (ACO) approach to produce approximate solutions in a timely manner. In the literature, the ACO approach has been successfully applied to several well-known combinatorial optimization problems whose solutions might be in the form of paths on the associated graphs. The ACO algorithm proposed in this paper incorporates several new features so as to select wavelength links for which the communication cost and the transmission delay of routing the request can be minimized as much as possible subject to the specified delay bound. Computational experiments are designed and conducted to study the performance of the proposed algorithm. Comparing with the optimal solutions found by an ILP formulation, numerical results evince that the ACO algorithm is effective and robust in providing quality approximate solutions to the DRWA-DC problem.     

基于蚁群遗传算法的氨基酸序列比对方法

蚁群遗传算法是在蚁群算法的基础上用遗传算法对其参数进行优化而产生的一种改进算法。把蚁群遗传算法应用于生物信息学中的氨基酸序列比对上，从而提出了一种新颖的蚁群遗传序列比对算法，实验结果表明这种新颖的序列比对算法是非常有效的。     

密集家庭基站网络中基于分簇的资源分配方案

针对家庭基站密集部署情况下的下行干扰问题,提出一种基于分簇的资源分配方案。首先,采用部分频率复用（FFR）技术将网络中所有小区划分成不同的空间,既能抑制宏基站之间的同层干扰,又能降低边缘区域宏基站与家庭基站间的跨层干扰;然后,结合图论的知识及凸优化理论对家庭基站进行分簇,并采用基于用户速率公平的信道分配算法对家庭基站进行子信道分配,抑制家庭基站间的同层干扰;最后,采用分布式功率控制算法对家庭基站功率进行动态调整,进一步提升系统的性能。仿真结果表明：相比传统未分组算法,所提算法的信干噪比（SINR）和吞吐量有明显提高,其中,系统吞吐量低于4 Mb/s的概率降低为30%;同时,与未分组算法相比,所提算法公平性提高了12%,使用户获得更高的满意度。     

A dynamic programming approximation for downlink channel allocation in cognitive femtocell networks

Both femtocells and cognitive radio (CR) are envisioned as promising technologies for the NeXt Generation (xG) cellular networks. Cognitive femtocell networks (CogFem) incorporate CR technology into femtocell deployment to reduce its demand for more spectrum bands, thereby improving the spectrum utilization. In this paper, we focus on the channel allocation problem in CogFem, and formulate it as a stochastic dynamic programming (SDP) problem aiming at optimizing the long-term cumulative system throughput of individual femtocells. However, the multi-dimensional state variables resulted from complex exogenous stochastic information make the SDP problem computationally intractable using standard value iteration algorithms. To address this issue, we propose an approximate dynamic programming (ADP) algorithm in pursuit of an approximate solution to the SDP problem. The proposed ADP algorithm relies on an efficient value function approximation (VFA) architecture that we design and a stochastic gradient learning strategy to function, enabling each femtocell to learn and improve its own channel allocation policy. The algorithm is computationally attractive for large-scale downlink channel allocation problems in CogFem since its time complexity does not grow exponentially with the number of femtocells. Simulation results have shown that the proposed ADP algorithm exhibits great advantages: (1) it is feasible for online implementation with a fair rate of convergence and adaptability to both long-term and short-term network dynamics; and (2) it produces high-quality solutions fast, reaching approximately 80% of the upper bounds provided by optimal backward dynamic programming (DP) solutions to a set of deterministic counterparts of the formulated SDP problem.     

A low-complexity hybrid algorithm based on particle swarm and ant colony optimization for large-MIMO detection

With rapid increase in demand for higher data rates, multiple-input multiple-output (MIMO) wireless communication systems are getting increased research attention because of their high capacity achieving capability. However, the practical implementation of MIMO systems rely on the computational complexity incurred in detection of the transmitted information symbols. The minimum bit error rate performance (BER) can be achieved by using maximum likelihood (ML) search based detection, but it is computationally impractical when number of transmit antennas increases. In this paper, we present a low-complexity hybrid algorithm (HA) to solve the symbol vector detection problem in large-MIMO systems. The proposed algorithm is inspired from the two well known bio-inspired optimization algorithms namely, particle swarm optimization (PSO) algorithm and ant colony optimization (ACO) algorithm. In the proposed algorithm, we devise a new probabilistic search approach which combines the distance based search of ants in ACO algorithm and the velocity based search of particles in PSO algorithm. The motivation behind using the hybrid of ACO and PSO is to avoid premature convergence to a local solution and to improve the convergence rate. Simulation results show that the proposed algorithm outperforms the popular minimum mean squared error (MMSE) algorithm and the existing ACO algorithms in terms of BER performance while achieve a near ML performance which makes the algorithm suitable for reliable detection in large-MIMO systems. Furthermore, a faster convergence to achieve a target BER is observed which results in reduction in computational efforts.     

A novel two-stage hybrid swarm intelligence optimization algorithm and application

This paper presents a novel two-stage hybrid swarm intelligence optimization algorithm called GA–PSO–ACO algorithm that combines the evolution ideas of the genetic algorithms, particle swarm optimization and ant colony optimization based on the compensation for solving the traveling salesman problem. In the proposed hybrid algorithm, the whole process is divided into two stages. In the first stage, we make use of the randomicity, rapidity and wholeness of the genetic algorithms and particle swarm optimization to obtain a series of sub-optimal solutions (rough searching) to adjust the initial allocation of pheromone in the ACO. In the second stage, we make use of these advantages of the parallel, positive feedback and high accuracy of solution to implement solving of whole problem (detailed searching). To verify the effectiveness and efficiency of the proposed hybrid algorithm, various scale benchmark problems from TSPLIB are tested to demonstrate the potential of the proposed two-stage hybrid swarm intelligence optimization algorithm. The simulation examples demonstrate that the GA–PSO–ACO algorithm can greatly improve the computing efficiency for solving the TSP and outperforms the Tabu Search, genetic algorithms, particle swarm optimization, ant colony optimization, PS–ACO and other methods in solution quality. And the experimental results demonstrate that convergence is faster and better when the scale of TSP increases.