期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Tidal Turbine Array Optimization Based on the Discrete Particle Swarm Algorithm 被引量:3
1
作者 WU Guo-wei WU He +2 位作者 WANG Xiao-yong ZHOU Qing-wei LIU Xiao-man 《China Ocean Engineering》 SCIE EI CSCD 2018年第3期358-364,共7页
In consideration of the resource wasted by unreasonable layout scheme of tidal current turbines, which would influence the ratio of cost and power output, particle swarm optimization algorithm is introduced and improv... In consideration of the resource wasted by unreasonable layout scheme of tidal current turbines, which would influence the ratio of cost and power output, particle swarm optimization algorithm is introduced and improved in the paper. In order to solve the problem of optimal array of tidal turbines, the discrete particle swarm optimization(DPSO) algorithm has been performed by re-defining the updating strategies of particles’ velocity and position. This paper analyzes the optimization problem of micrositing of tidal current turbines by adjusting each turbine’s position,where the maximum value of total electric power is obtained at the maximum speed in the flood tide and ebb tide.Firstly, the best installed turbine number is generated by maximizing the output energy in the given tidal farm by the Farm/Flux and empirical method. Secondly, considering the wake effect, the reasonable distance between turbines,and the tidal velocities influencing factors in the tidal farm, Jensen wake model and elliptic distribution model are selected for the turbines’ total generating capacity calculation at the maximum speed in the flood tide and ebb tide.Finally, the total generating capacity, regarded as objective function, is calculated in the final simulation, thus the DPSO could guide the individuals to the feasible area and optimal position. The results have been concluded that the optimization algorithm, which increased 6.19% more recourse output than experience method, can be thought as a good tool for engineering design of tidal energy demonstration. 展开更多
关键词 tidal power wake model turbine layout discrete particle swarm algorithm
在线阅读 下载PDF
Dynamic Weapon Target Assignment Based on Intuitionistic Fuzzy Entropy of Discrete Particle Swarm 被引量:18
2
作者 Yi Wang Jin Li +1 位作者 Wenlong Huang Tong Wen 《China Communications》 SCIE CSCD 2017年第1期169-179,共11页
Aiming at the problems of convergence-slow and convergence-free of Discrete Particle Swarm Optimization Algorithm(DPSO) in solving large scale or complicated discrete problem, this article proposes Intuitionistic Fuzz... Aiming at the problems of convergence-slow and convergence-free of Discrete Particle Swarm Optimization Algorithm(DPSO) in solving large scale or complicated discrete problem, this article proposes Intuitionistic Fuzzy Entropy of Discrete Particle Swarm Optimization(IFDPSO) and makes it applied to Dynamic Weapon Target Assignment(WTA). First, the strategy of choosing intuitionistic fuzzy parameters of particle swarm is defined, making intuitionistic fuzzy entropy as a basic parameter for measure and velocity mutation. Second, through analyzing the defects of DPSO, an adjusting parameter for balancing two cognition, velocity mutation mechanism and position mutation strategy are designed, and then two sets of improved and derivative algorithms for IFDPSO are put forward, which ensures the IFDPSO possibly search as much as possible sub-optimal positions and its neighborhood and the algorithm ability of searching global optimal value in solving large scale 0-1 knapsack problem is intensified. Third, focusing on the problem of WTA, some parameters including dynamic parameter for shifting firepower and constraints are designed to solve the problems of weapon target assignment. In addition, WTA Optimization Model with time and resource constraints is finally set up, which also intensifies the algorithm ability of searching global and local best value in the solution of WTA problem. Finally, the superiority of IFDPSO is proved by several simulation experiments. Particularly, IFDPSO, IFDPSO1~IFDPSO3 are respectively effective in solving large scale, medium scale or strict constraint problems such as 0-1 knapsack problem and WTA problem. 展开更多
关键词 intuitionistic fuzzy entropy discrete particle swarm optimization algorithm 0-1 knapsack problem weapon target assignment
在线阅读 下载PDF
Smart Clothing Fabric Color Matching with Reference to Popular Colors
3
作者 ZHANG Yani ZHUANG Jianqiang +2 位作者 HUANG Rong DONG Aihua YUAN Haodong 《Journal of Donghua University(English Edition)》 CAS 2022年第4期317-324,共8页
Color economy and market fashion trend have an increasing impact on clothing fabric color matching.Therefore,a smart clothing fabric color matching system with reference to popular colors is designed to realize the di... Color economy and market fashion trend have an increasing impact on clothing fabric color matching.Therefore,a smart clothing fabric color matching system with reference to popular colors is designed to realize the diversification of clothing color matching,which includes a palette generation module and a clothing fabrics-palette color matching network(CF-PCN).Firstly,palette generation module generates palettes referring popular colors while maintains color styles of clothing fabrics.Secondly,CF-PCN generates color matching images containing color information of palettes.The experimental results show that the color matching system has a higher average pixel ratio of palette colors and contains more palette color information.It demonstrates that the system achieves color matching innovation referring popular colors while retaining color style of clothing brands and provides designers with appropriate color matching solutions. 展开更多
关键词 popular color clothing fabric color matching support vector machine(SVM) discrete particle swarm optimization algorithm generative adversarial network
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部