Coordinated controller tuning of the boiler turbine unit is a challenging task due to the nonlinear and coupling characteristics of the system.In this paper,a new variant of binary particle swarm optimization （PSO） ...Coordinated controller tuning of the boiler turbine unit is a challenging task due to the nonlinear and coupling characteristics of the system.In this paper,a new variant of binary particle swarm optimization （PSO） algorithm,called probability based binary PSO （PBPSO）,is presented to tune the parameters of a coordinated controller.The simulation results show that PBPSO can effectively optimize the control parameters and achieves better control performance than those based on standard discrete binary PSO,modified binary PSO,and standard continuous PSO.展开更多
The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,deve...The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,developing secure steganography is formulated as solving a constrained IP(Integer Programming) problem,which takes the relative entropy of cover and stego distributions as the objective function.Furthermore,a novel method is introduced based on BPSO(Binary Particle Swarm Optimization) for achieving the optimal solution of this programming problem.Experimental results show that the proposed method can achieve excellent performance on preserving neighboring co-occurrence features for JPEG steganography.展开更多
The minimum weight dominating set problem （MWDSP） is an NP-hard problem with a lot of real-world applications. Several heuristic algorithms have been presented to produce good quality solutions. However, the solutio...The minimum weight dominating set problem （MWDSP） is an NP-hard problem with a lot of real-world applications. Several heuristic algorithms have been presented to produce good quality solutions. However, the solution time of them grows very quickly as the size of the instance increases. In this paper, we propose a binary particle swarm optimization （FBPSO） for solving the MWDSP approximately. Based on the characteristic of MWDSP, this approach designs a new position updating rule to guide the search to a promising area. An iterated greedy tabu search is used to enhance the solution quality quickly. In addition, several stochastic strategies are employed to diversify the search and prevent premature convergence. These methods maintain a good balance between the exploration and the exploitation. Experimental studies on 106 groups of 1 060 instances show that FBPSO is able to identify near optimal solutions in a short running time. The average deviation between the solutions obtained by FBPSO and the best known solutions is 0.441%. Moreover, the average solution time of FBPSO is much less than that of other existing algorithms. In particular, with the increasing of instance size, the solution time of FBPSO grows much more slowly than that of other existing algorithms.展开更多
The set-union knapsack problem(SUKP)is proved to be a strongly NP-hard problem,and it is an extension of the classic NP-hard problem:the 0-1 knapsack problem(KP).Solving the SUKP through exact approaches is computatio...The set-union knapsack problem(SUKP)is proved to be a strongly NP-hard problem,and it is an extension of the classic NP-hard problem:the 0-1 knapsack problem(KP).Solving the SUKP through exact approaches is computationally expensive.Therefore,several swarm intelligent algorithms have been proposed in order to solve the SUKP.Hyper-heuristics have received notable attention by researchers in recent years,and they are successfully applied to solve the combinatorial optimization problems.In this article,we propose a binary particle swarm optimization(BPSO)based hyper-heuristic for solving the SUKP,in which the BPSO is employed as a search methodology.The proposed approach has been evaluated on three sets of SUKP instances.The results are compared with 6 approaches:BABC,EMS,gPSO,DHJaya,b WSA,and HBPSO/TS,and demonstrate that the proposed approach for the SUKP outperforms other approaches.展开更多
This paper presents a binary gravitational search algorithm (BGSA) is applied to solve the problem of optimal allotment of DG sets and Shunt capacitors in radial distribution systems. The problem is formulated as a no...This paper presents a binary gravitational search algorithm (BGSA) is applied to solve the problem of optimal allotment of DG sets and Shunt capacitors in radial distribution systems. The problem is formulated as a nonlinear constrained single-objective optimization problem where the total line loss (TLL) and the total voltage deviations (TVD) are to be minimized separately by incorporating optimal placement of DG units and shunt capacitors with constraints which include limits on voltage, sizes of installed capacitors and DG. This BGSA is applied on the balanced IEEE 10 Bus distribution network and the results are compared with conventional binary particle swarm optimization.展开更多
Due to the size and complexity of power network and the cost of monitoring and telecommunication equipment, it is unfeasible to monitor the whole system variables. All system analyzers use voltages and currents of the...Due to the size and complexity of power network and the cost of monitoring and telecommunication equipment, it is unfeasible to monitor the whole system variables. All system analyzers use voltages and currents of the network. Thus, monitoring scheme plays a main role in system analysis, control, and protection. To monitor the whole system using distributed measurements, strategic placement of them is needed. This paper improves a topological circuit observation method to minimize essential monitors. Besides the observability under normal condition of power networks, the observability of abnormal network is considered. Consequently, a high level of system reliability is carried out. In terms of reliability constraint, identification of bad measurement data in a given measurement system by making theme sure to be detectable is well done. Furthermore, it is maintained by a certain level of reliability against the single-line outages. Thus, observability is satisfied if all possible single line outages are plausible. Consideration of these limitations clears the role of utilizing an optimization algorithm. Hence, particle swarm optimization （PSO） is used to minimize monitoring cost and removing unobser-vable states under abnormal condition, simultaneously. The algorithm is tested in IEEE 14 and 30-bus test systems and Iranian （Mazandaran） Regional Electric Company.展开更多
基金supported by Projects of Shanghai Science and Technology Community (No. 10ZR1411800,No. 08160705900,No. 08160512100)Shanghai University "the 11th Five-Year Plan"+1 种基金211 Construction ProjectMechatronics Engineering Innovation Group Project from Shanghai Education Commission
文摘Coordinated controller tuning of the boiler turbine unit is a challenging task due to the nonlinear and coupling characteristics of the system.In this paper,a new variant of binary particle swarm optimization （PSO） algorithm,called probability based binary PSO （PBPSO）,is presented to tune the parameters of a coordinated controller.The simulation results show that PBPSO can effectively optimize the control parameters and achieves better control performance than those based on standard discrete binary PSO,modified binary PSO,and standard continuous PSO.
基金Supported by the National Natural Science Foundation of China (No.60572111)
文摘The objective of steganography is to hide message securely in cover objects for secret communication.How to design a secure steganographic algorithm is still major challenge in this re-search field.In this letter,developing secure steganography is formulated as solving a constrained IP(Integer Programming) problem,which takes the relative entropy of cover and stego distributions as the objective function.Furthermore,a novel method is introduced based on BPSO(Binary Particle Swarm Optimization) for achieving the optimal solution of this programming problem.Experimental results show that the proposed method can achieve excellent performance on preserving neighboring co-occurrence features for JPEG steganography.
基金This work is supported partially by the National Natural Science Foundation of China under Grant No. 11301255, the Natural Science Foundation of Fujian Province of China under Grant No. 2016J01025, and the Program for New Century Excellent Talents in Fujian Province University.
文摘The minimum weight dominating set problem （MWDSP） is an NP-hard problem with a lot of real-world applications. Several heuristic algorithms have been presented to produce good quality solutions. However, the solution time of them grows very quickly as the size of the instance increases. In this paper, we propose a binary particle swarm optimization （FBPSO） for solving the MWDSP approximately. Based on the characteristic of MWDSP, this approach designs a new position updating rule to guide the search to a promising area. An iterated greedy tabu search is used to enhance the solution quality quickly. In addition, several stochastic strategies are employed to diversify the search and prevent premature convergence. These methods maintain a good balance between the exploration and the exploitation. Experimental studies on 106 groups of 1 060 instances show that FBPSO is able to identify near optimal solutions in a short running time. The average deviation between the solutions obtained by FBPSO and the best known solutions is 0.441%. Moreover, the average solution time of FBPSO is much less than that of other existing algorithms. In particular, with the increasing of instance size, the solution time of FBPSO grows much more slowly than that of other existing algorithms.
基金Supported partly by the Natural Science Foundation of Fujian Province(2020J01843)the Science and Technology Project of the Education Bureau of Fujian(JAT200403)
文摘The set-union knapsack problem(SUKP)is proved to be a strongly NP-hard problem,and it is an extension of the classic NP-hard problem:the 0-1 knapsack problem(KP).Solving the SUKP through exact approaches is computationally expensive.Therefore,several swarm intelligent algorithms have been proposed in order to solve the SUKP.Hyper-heuristics have received notable attention by researchers in recent years,and they are successfully applied to solve the combinatorial optimization problems.In this article,we propose a binary particle swarm optimization(BPSO)based hyper-heuristic for solving the SUKP,in which the BPSO is employed as a search methodology.The proposed approach has been evaluated on three sets of SUKP instances.The results are compared with 6 approaches:BABC,EMS,gPSO,DHJaya,b WSA,and HBPSO/TS,and demonstrate that the proposed approach for the SUKP outperforms other approaches.
文摘This paper presents a binary gravitational search algorithm (BGSA) is applied to solve the problem of optimal allotment of DG sets and Shunt capacitors in radial distribution systems. The problem is formulated as a nonlinear constrained single-objective optimization problem where the total line loss (TLL) and the total voltage deviations (TVD) are to be minimized separately by incorporating optimal placement of DG units and shunt capacitors with constraints which include limits on voltage, sizes of installed capacitors and DG. This BGSA is applied on the balanced IEEE 10 Bus distribution network and the results are compared with conventional binary particle swarm optimization.
文摘Due to the size and complexity of power network and the cost of monitoring and telecommunication equipment, it is unfeasible to monitor the whole system variables. All system analyzers use voltages and currents of the network. Thus, monitoring scheme plays a main role in system analysis, control, and protection. To monitor the whole system using distributed measurements, strategic placement of them is needed. This paper improves a topological circuit observation method to minimize essential monitors. Besides the observability under normal condition of power networks, the observability of abnormal network is considered. Consequently, a high level of system reliability is carried out. In terms of reliability constraint, identification of bad measurement data in a given measurement system by making theme sure to be detectable is well done. Furthermore, it is maintained by a certain level of reliability against the single-line outages. Thus, observability is satisfied if all possible single line outages are plausible. Consideration of these limitations clears the role of utilizing an optimization algorithm. Hence, particle swarm optimization （PSO） is used to minimize monitoring cost and removing unobser-vable states under abnormal condition, simultaneously. The algorithm is tested in IEEE 14 and 30-bus test systems and Iranian （Mazandaran） Regional Electric Company.
