With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reductio...With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reduction measure,lack of economy,and practicality in existing research,this paper proposes an optimization method of distribution network loss reduction based on tabu search algorithm and optimizes the combination and parameter configuration of loss reduction measure.The optimization model is developed with the goal of maximizing comprehensive benefits,incorporating both economic and environmental factors,and accounting for investment costs,including the loss of power reduction.Additionally,the model ensures that constraint conditions such as power flow equations,voltage deviations,and line transmission capacities are satisfied.The solution is obtained through a tabu search algorithm,which is well-suited for solving nonlinear problems with multiple constraints.Combined with the example of 10kV25 node construction,the simulation results show that the method can significantly reduce the network loss on the basis of ensuring the economy and environmental protection of the system,which provides a theoretical basis for distribution network planning.展开更多
For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search ...For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.展开更多
Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the...Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.展开更多
Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS)...Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.展开更多
This paper describes a case study of 3D protein structure prediction of six sequences from protein data bank （PDB） by genetic algorithm and tabu search （GATS）, where off-lattice AB model is considered as a simplif...This paper describes a case study of 3D protein structure prediction of six sequences from protein data bank （PDB） by genetic algorithm and tabu search （GATS）, where off-lattice AB model is considered as a simplified model of protein structure. The lowest-energy values required for forming the native conformation of proteins are searched by GATS, and then the coarse structures （i.e., simplified structure） of the proteins are obtained according to the multiple angle parameters corresponding to the lowest energies. All the coarse structures form single hydrophobic cores surrounded by hydrophilic residues, which stay on the right side of the actual characteristic of protein structure. It demonstrates that this approach can predict the 3D protein structure effectively.展开更多
This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment （TUC） problem in power plant optimization. The mathematical model of the TUC problem is established by a...This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment （TUC） problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modem power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies, which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm （IA） is used as the initial solution of the tabu search （TS） algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry.展开更多
In this paper, refusal of operation and the degree of constraint violation are considered as one part of the objective function for optimizing the protection relay setting coordination of over current relays in power ...In this paper, refusal of operation and the degree of constraint violation are considered as one part of the objective function for optimizing the protection relay setting coordination of over current relays in power systems; a new expression of objective function in this optimization problem is proposed. To combine the advantages of both Tabu search （TS） and evolutionary algorithms （EAs）, a new niche-based evolutionary Tabu search algorithm （named NETS） is presented to solve this optimization problem. Moreover, in two cases of power networks, comparisons between NETS and two published algorithms are given. Experimental results show the expression of the objective function for protection relay setting is feasible and reasonable, and the proposed algorithm NETS exhibits a good performance.展开更多
The optimal allocation of regulators banks in distribution systems is a merely combinatorial problem in which the best points of installation correspond to the best benefit, considering the admitted objective function...The optimal allocation of regulators banks in distribution systems is a merely combinatorial problem in which the best points of installation correspond to the best benefit, considering the admitted objective function, without violating and operating limits. The objective function must be chosen so that its value represents the operation state of the system. As the problem possesses combinatorial nature, its complexity will increase exponentially with the number of possibilities. Systems with large numbers of nodes and / or with the possibility of installing more than one bank require a large number of calculations to find the solution. An additional issue is the fact that the problem does not have a continuous nature, presenting discontinuity points in the objective function, limiting the application of optimization methods based on gradients. Based on the nature of the problem two optimization methods were used to solve the problem: Genetic Algorithm (GA) and modified Tabu Search (TS). The GA function will scour the search space and find regions with local minima that are candidates to be the solution. On the other hand the TS provides local search in the regions defined by GA so that the overall optimum is achieved.展开更多
文摘With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reduction measure,lack of economy,and practicality in existing research,this paper proposes an optimization method of distribution network loss reduction based on tabu search algorithm and optimizes the combination and parameter configuration of loss reduction measure.The optimization model is developed with the goal of maximizing comprehensive benefits,incorporating both economic and environmental factors,and accounting for investment costs,including the loss of power reduction.Additionally,the model ensures that constraint conditions such as power flow equations,voltage deviations,and line transmission capacities are satisfied.The solution is obtained through a tabu search algorithm,which is well-suited for solving nonlinear problems with multiple constraints.Combined with the example of 10kV25 node construction,the simulation results show that the method can significantly reduce the network loss on the basis of ensuring the economy and environmental protection of the system,which provides a theoretical basis for distribution network planning.
基金National Science Fund for Distinguished Young Scholars (10425208)Programme of Introducing Talents of Discipline to Universities (B07009)
文摘For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.
基金the National Key Research and Development Program of China(Grant No.2016YFB0500801)sponsored by Qing Lan Project.
文摘Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.
文摘Three heuristic algorithms for optimal polygonal approximation of digital planar curves is presented. With Genetic Algorithm (GA), improved Genetic Algorithm (IGA) based on Pareto optimal solution and Tabu Search (TS), a near optimal polygonal approximation was obtained. Compared to the famous Teh chin algorithm, our algorithms have obtained the approximated polygons with less number of vertices and less approximation error. Compared to the dynamic programming algorithm, the processing time of our algorithms are much less expensive.
基金Supported by the National Natural Science Foundation of China (60975031)the Scientific Research Foundation for the Returned Overseas Chinese Scholars of Ministry of Education of China, the Open Foundation of State Key Laboratory of Bioelectronics of Southeast University, China, and the Natural Science Foundation of Hubei Province, China (2008CDB344 and 2009CDA034)
文摘This paper describes a case study of 3D protein structure prediction of six sequences from protein data bank （PDB） by genetic algorithm and tabu search （GATS）, where off-lattice AB model is considered as a simplified model of protein structure. The lowest-energy values required for forming the native conformation of proteins are searched by GATS, and then the coarse structures （i.e., simplified structure） of the proteins are obtained according to the multiple angle parameters corresponding to the lowest energies. All the coarse structures form single hydrophobic cores surrounded by hydrophilic residues, which stay on the right side of the actual characteristic of protein structure. It demonstrates that this approach can predict the 3D protein structure effectively.
基金Project partially supported by the Lamar Research Enhancement Grant and the National Science Foundation Grant (No. DUE-0737173) to Dr. W. Zhu at Lamar University
文摘This paper presents a new method based on an immune-tabu hybrid algorithm to solve the thermal unit commitment （TUC） problem in power plant optimization. The mathematical model of the TUC problem is established by analyzing the generating units in modem power plants. A novel immune-tabu hybrid algorithm is proposed to solve this complex problem. In the algorithm, the objective function of the TUC problem is considered as an antigen and the solutions are considered as antibodies, which are determined by the affinity computation. The code length of an antibody is shortened by encoding the continuous operating time, and the optimum searching speed is improved. Each feasible individual in the immune algorithm （IA） is used as the initial solution of the tabu search （TS） algorithm after certain generations of IA iteration. As examples, the proposed method has been applied to several thermal unit systems for a period of 24 h. The computation results demonstrate the good global optimum searching performance of the proposed immune-tabu hybrid algorithm. The presented algorithm can also be used to solve other optimization problems in fields such as the chemical industry and the power industry.
基金Supported by the National Natural Science Foundation of China (50677046, 60573168)
文摘In this paper, refusal of operation and the degree of constraint violation are considered as one part of the objective function for optimizing the protection relay setting coordination of over current relays in power systems; a new expression of objective function in this optimization problem is proposed. To combine the advantages of both Tabu search （TS） and evolutionary algorithms （EAs）, a new niche-based evolutionary Tabu search algorithm （named NETS） is presented to solve this optimization problem. Moreover, in two cases of power networks, comparisons between NETS and two published algorithms are given. Experimental results show the expression of the objective function for protection relay setting is feasible and reasonable, and the proposed algorithm NETS exhibits a good performance.
文摘The optimal allocation of regulators banks in distribution systems is a merely combinatorial problem in which the best points of installation correspond to the best benefit, considering the admitted objective function, without violating and operating limits. The objective function must be chosen so that its value represents the operation state of the system. As the problem possesses combinatorial nature, its complexity will increase exponentially with the number of possibilities. Systems with large numbers of nodes and / or with the possibility of installing more than one bank require a large number of calculations to find the solution. An additional issue is the fact that the problem does not have a continuous nature, presenting discontinuity points in the objective function, limiting the application of optimization methods based on gradients. Based on the nature of the problem two optimization methods were used to solve the problem: Genetic Algorithm (GA) and modified Tabu Search (TS). The GA function will scour the search space and find regions with local minima that are candidates to be the solution. On the other hand the TS provides local search in the regions defined by GA so that the overall optimum is achieved.
