This paper proposes a Hybridized Ant Colony Optimization (HACO) algorithm. It integrates the advantages of Ant System (AS) and Ant Colony System (ACS) of solving optimization problems. The main focus and core of the H...This paper proposes a Hybridized Ant Colony Optimization (HACO) algorithm. It integrates the advantages of Ant System (AS) and Ant Colony System (ACS) of solving optimization problems. The main focus and core of the HACO algorithm are based on annexing the strengths of the AS, ACO and the Max-Min Ant System (MMAS) previously proposed by various researchers at one time or the order. In this paper, the HACO algorithm for solving optimization problems employs new Transition Probability relations with a Jump transition probability relation which indicates the point or path at which the desired optimum value has been met. Also, it brings to play a new pheromone updating rule and introduces the pheromone evaporation residue that calculates the amount of pheromone left after updating which serves as a guide to the successive ant traversing the path and diverse local search approaches. Regarding the computational efficiency of the HACO algorithm, we observe that the HACO algorithm can find very good solutions in a short time, as the algorithm has been tested on a number of combinatorial optimization problems and results shown to compare favourably with analytical results. This strength can be combined with other metaheuristic approaches in the future work to solve complex combinatorial optimization problems.展开更多
为了解决无线传感器网络Qo S(Quality of Service,Qo S)路由在寻找最优路径时要满足时延、抖动、能量等多个约束条件的问题,提出一种新的自适应蚁群优化算法,该算法有两方面的自适应策略。将信息素挥发因子ρ设置为动态自适应,在自适应...为了解决无线传感器网络Qo S(Quality of Service,Qo S)路由在寻找最优路径时要满足时延、抖动、能量等多个约束条件的问题,提出一种新的自适应蚁群优化算法,该算法有两方面的自适应策略。将信息素挥发因子ρ设置为动态自适应,在自适应因子μ作用下动态变化,增强算法的寻优能力,避免算法陷入局部最优;以多约束为条件建立加权的适应度函数,通过适应度函数值与自适应因子μ共同影响路径上的信息素更新,增强算法的收敛速度。通过仿真实验表明,该算法在满足多约束条件方面具有良好的效果。展开更多
文摘This paper proposes a Hybridized Ant Colony Optimization (HACO) algorithm. It integrates the advantages of Ant System (AS) and Ant Colony System (ACS) of solving optimization problems. The main focus and core of the HACO algorithm are based on annexing the strengths of the AS, ACO and the Max-Min Ant System (MMAS) previously proposed by various researchers at one time or the order. In this paper, the HACO algorithm for solving optimization problems employs new Transition Probability relations with a Jump transition probability relation which indicates the point or path at which the desired optimum value has been met. Also, it brings to play a new pheromone updating rule and introduces the pheromone evaporation residue that calculates the amount of pheromone left after updating which serves as a guide to the successive ant traversing the path and diverse local search approaches. Regarding the computational efficiency of the HACO algorithm, we observe that the HACO algorithm can find very good solutions in a short time, as the algorithm has been tested on a number of combinatorial optimization problems and results shown to compare favourably with analytical results. This strength can be combined with other metaheuristic approaches in the future work to solve complex combinatorial optimization problems.
文摘为了解决无线传感器网络Qo S(Quality of Service,Qo S)路由在寻找最优路径时要满足时延、抖动、能量等多个约束条件的问题,提出一种新的自适应蚁群优化算法,该算法有两方面的自适应策略。将信息素挥发因子ρ设置为动态自适应,在自适应因子μ作用下动态变化,增强算法的寻优能力,避免算法陷入局部最优;以多约束为条件建立加权的适应度函数,通过适应度函数值与自适应因子μ共同影响路径上的信息素更新,增强算法的收敛速度。通过仿真实验表明,该算法在满足多约束条件方面具有良好的效果。