Aiming at the problem that the traditional antcolonyalgorithm(ACO) has poor solution quality in the dynamic path planning process, this paper proposes an improved ACO. Firstly, the genetic operator fused with the tr...
详细信息
Aiming at the problem that the traditional antcolonyalgorithm(ACO) has poor solution quality in the dynamic path planning process, this paper proposes an improved ACO. Firstly, the genetic operator fused with the traditional ACO is proposed, and the genetic operation is used to expand the search space of the solution. Secondly, the fitness function is introduced in the traditional ACO and the safety distance is added. The pros and cons of the comprehensive evaluation algorithm planning path. Then, by introducing the optimization operator, the redundant nodes are eliminated and the smoothness is improved. Finally, the path planning simulation experiment is carried out in the grid map. The results show that the proposed algorithm can find a shorter and smoother in the dynamic environment path.
On the basis of fuzzy neural network load forecasting, the weights and thresholds of fuzzy neural network and the number of neurons in hidden layer are optimized by antcolonyalgorithm. A short-term load forecasting ...
详细信息
On the basis of fuzzy neural network load forecasting, the weights and thresholds of fuzzy neural network and the number of neurons in hidden layer are optimized by antcolonyalgorithm. A short-term load forecasting model of fuzzy neural network based on antcolonyoptimization is proposed. Through case analysis, it shows that this algorithm can obtain high accuracy, and it is an effective method for short-term load forecasting.
The Physarum Network with single inlet and multi outlet model (SMPN) exhibits a unique feature that the critical pipelines are reserved with the evolution of network. In addition, ant colony optimization algorithm is ...
详细信息
ISBN:
(纸本)9781479989386
The Physarum Network with single inlet and multi outlet model (SMPN) exhibits a unique feature that the critical pipelines are reserved with the evolution of network. In addition, ant colony optimization algorithm is a classic optimizationalgorithm of simulated evolutionary algorithms, which has been used to solve optimal scheduling problems. In this paper, drawing on this feature, an optimized antcolonyoptimization (ACO) algorithm denoted as SMPNACO algorithm is proposed based on the Physarum Network and ant colony optimization algorithm (ACO) to solve the Vehicle Routing Problem (VRP). Throughout the algorithm, the amount of pheromone flowed in network are related to the customers' requirement. When the pheromone matrix is updated, the SMPNACO algorithm updates both the pheromone released by ants and the flowing pheromone in the Physarum Network. By adding extra pheromones in the Physarum Network improves the convergence performance of ant colony optimization algorithm. The simulative experiments show that the SMPNACO algorithm is less affected by the initial total pheromone, this algorithm is feasible in solving the small scale VRP, and can effectively solve the VRP.
Cooperative routing selection algorithm is based on the limited bandwidth and collaborative remain energy, according to pheromone concentration in ant colony optimization algorithm. The antcolonyoptimization algorit...
详细信息
ISBN:
(纸本)9781510802704
Cooperative routing selection algorithm is based on the limited bandwidth and collaborative remain energy, according to pheromone concentration in ant colony optimization algorithm. The ant colony optimization algorithm is applied to improving collaboration network routing problems to reduce network congestion and reduce node energy consumption. Simulation demonstrate that the algorithm obtains a global optimization and makes an average 60% reduction in end to end delay, increased the utilization of network resources.
The traditional antcolonyoptimization(ACO) had defects in long searching time and convergence in local optima solution. To solve the problem, a hybrid ant colony optimization algorithm(HACO) was proposed in this...
详细信息
The traditional antcolonyoptimization(ACO) had defects in long searching time and convergence in local optima solution. To solve the problem, a hybrid ant colony optimization algorithm(HACO) was proposed in this paper. Two modes in HACO are defined that are Default Model and Elite Model. In order to search the optimum result, the two modes will be automatically switched in this algorithm. It also use the parallel calculation model of Map Reduce to loop iteration part of ACO and deploy it on the Hadoop cloud computing platform. Finally, simulation results validate the proposed approach on the traveling salesman problem.
Aiming at the problem that the traditional antcolonyalgorithm (ACO) has poor solution quality in the dynamic path planning process, this paper proposes an improved ACO. Firstly, the genetic operator fused with the t...
详细信息
ISBN:
(纸本)9781450377027
Aiming at the problem that the traditional antcolonyalgorithm (ACO) has poor solution quality in the dynamic path planning process, this paper proposes an improved ACO. Firstly, the genetic operator fused with the traditional ACO is proposed, and the genetic operation is used to expand the search space of the solution. Secondly, the fitness function is introduced in the traditional ACO and the safety distance is added. The pros and cons of the comprehensive evaluation algorithm planning path. Then, by introducing the optimization operator, the redundant nodes are eliminated and the smoothness is improved. Finally, the path planning simulation experiment is carried out in the grid map. The results show that the proposed algorithm can find a shorter and smoother in the dynamic environment path.
The restoration process for distribution system grid needs the operation of line switching to restore as many loads as possible for the faulted area. In this paper a multi objective, multi constraint combinatorial opt...
详细信息
ISBN:
(纸本)9781479906871;9781479906888
The restoration process for distribution system grid needs the operation of line switching to restore as many loads as possible for the faulted area. In this paper a multi objective, multi constraint combinatorial optimization problem is formulated to solve the self-healing restoration problem. A hybrid Fuzzy Control (FC)-ant colony optimization algorithm (ACOA) is proposed using values for P, Q from a SCADA system. Two case studies without/with distributed generation are carried out to evaluate the effectiveness and speed of the proposed algorithm. The obtained results are compared with the conventional ACO to illustrate the accuracy of the proposed hybrid algorithm. Finally, conclusions are discussed.
To solve the traveling salesman problem (TSP), the application of ant colony optimization algorithm (ACO) based on the web geographical information system (WebGIS) is presented. In order to improve the performance of ...
详细信息
To solve the traveling salesman problem (TSP), the application of ant colony optimization algorithm (ACO) based on the web geographical information system (WebGIS) is presented. In order to improve the performance of optimization, the proposed algorithm adopts a kind of spatial topology structure combined with the ACO and treats 2-opt as a local searching strategy. Given the certain custom number, the algorithm can obtain the preferable global solving result. Compared with other two algorithms-the genetic algorithm and simulated annealing algorithm, the ACO algorithm based on the WebGIS can make the result converge to the global optimum faster and has higher accuracy. The algorithm can also be extended to solve other correlative combination optimization problems. Experimental results indicate the validity of the proposed algorithm.
The stochastic loader problem and the procedure for solutions were proposed in this paper. On the basis of basic ant colony optimization algorithm, the new ant colony optimization algorithm with inner and outer mutati...
详细信息
The stochastic loader problem and the procedure for solutions were proposed in this paper. On the basis of basic ant colony optimization algorithm, the new ant colony optimization algorithm with inner and outer mutation was designed to solve this problem. Two numerical examples were provided to illustrate the efficiency and reliability of this new algorithm.
To improve the finding path accuracy of the antcolonyalgorithm and reduce the number of turns, a jump point search improved antcolonyoptimization hybrid algorithm has been proposed in this article. Firstly, the in...
详细信息
To improve the finding path accuracy of the antcolonyalgorithm and reduce the number of turns, a jump point search improved antcolonyoptimization hybrid algorithm has been proposed in this article. Firstly, the initial pheromone concentration distribution gets from the jump points has been introduced to guide the algorithm in finding the way, thus accelerating the early iteration speed. The turning cost factor in the heuristic function has been designed to improve the smoothness of the path. Finally, the adaptive reward and punishment factor, and the Max-Min ant system have been introduced to improve the iterative speed and global search ability of the algorithm. Simulation through three maps of different scales is carried out. Furthermore, the results prove that the jump point search improved antcolonyoptimization hybrid algorithm performs effectively in finding path accuracy and reducing the number of turns.
暂无评论