期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem
1
作者 Zhaolin Lv Yuexia Zhao +2 位作者 Hongyue Kang Zhenyu Gao Yuhang Qin 《Computers, Materials & Continua》 SCIE EI 2024年第2期2337-2360,共24页
Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been... Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms. 展开更多
关键词 Flexible job shop scheduling improved harris hawk optimization algorithm(GNHHO) premature convergence maximum completion time(makespan)
下载PDF
Computing Connected Resolvability of Graphs Using Binary Enhanced Harris Hawks Optimization 被引量:1
2
作者 Basma Mohamed Linda Mohaisen Mohamed Amin 《Intelligent Automation & Soft Computing》 SCIE 2023年第5期2349-2361,共13页
In this paper,we consider the NP-hard problem offinding the minimum connected resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distanc... In this paper,we consider the NP-hard problem offinding the minimum connected resolving set of graphs.A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the ver-tices in B.A resolving set B of G is connected if the subgraph B induced by B is a nontrivial connected subgraph of G.The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G.The problem is solved heuristically by a binary version of an enhanced Harris Hawk Optimization(BEHHO)algorithm.This is thefirst attempt to determine the connected resolving set heuristically.BEHHO combines classical HHO with opposition-based learning,chaotic local search and is equipped with an S-shaped transfer function to convert the contin-uous variable into a binary one.The hawks of BEHHO are binary encoded and are used to represent which one of the vertices of a graph belongs to the connected resolving set.The feasibility is enforced by repairing hawks such that an addi-tional node selected from V\B is added to B up to obtain the connected resolving set.The proposed BEHHO algorithm is compared to binary Harris Hawk Optimi-zation(BHHO),binary opposition-based learning Harris Hawk Optimization(BOHHO),binary chaotic local search Harris Hawk Optimization(BCHHO)algorithms.Computational results confirm the superiority of the BEHHO for determining connected metric dimension. 展开更多
关键词 Connected resolving set binary optimization harris hawks algorithm
下载PDF
An Improved Harris Hawks Optimization Algorithm with Multi-strategy for Community Detection in Social Network 被引量:3
3
作者 Farhad Soleimanian Gharehchopogh 《Journal of Bionic Engineering》 SCIE EI CSCD 2023年第3期1175-1197,共23页
The purpose of community detection in complex networks is to identify the structural location of nodes. Complex network methods are usually graphical, with graph nodes representing objects and edges representing conne... The purpose of community detection in complex networks is to identify the structural location of nodes. Complex network methods are usually graphical, with graph nodes representing objects and edges representing connections between things. Communities are node clusters with many internal links but minimal intergroup connections. Although community detection has attracted much attention in social media research, most face functional weaknesses because the structure of society is unclear or the characteristics of nodes in society are not the same. Also, many existing algorithms have complex and costly calculations. This paper proposes different Harris Hawk Optimization (HHO) algorithm methods (such as Improved HHO Opposition-Based Learning(OBL) (IHHOOBL), Improved HHO Lévy Flight (IHHOLF), and Improved HHO Chaotic Map (IHHOCM)) were designed to balance exploitation and exploration in this algorithm for community detection in the social network. The proposed methods are evaluated on 12 different datasets based on NMI and modularity criteria. The findings reveal that the IHHOOBL method has better detection accuracy than IHHOLF and IHHOCM. Also, to offer the efficiency of the , state-of-the-art algorithms have been used as comparisons. The improvement percentage of IHHOOBL compared to the state-of-the-art algorithm is about 7.18%. 展开更多
关键词 Bionic algorithm Complex network Community detection harris hawk optimization algorithm Opposition-based learning Levy flight Chaotic maps
原文传递
Cascade controller based modeling of a four area thermal:gas AGC system with dependency of wind turbine generator and PEVs under restructured environment
4
作者 Debdeep Saha Lalit Chandra Saikia Asadur Rahman 《Protection and Control of Modern Power Systems》 2022年第1期696-713,共18页
This paper investigates automatic generation control(AGC)of a realistic hybrid four-control area system with a dis-tinct arrangement of thermal units,gas units and additional power generation.A proportional-integral-d... This paper investigates automatic generation control(AGC)of a realistic hybrid four-control area system with a dis-tinct arrangement of thermal units,gas units and additional power generation.A proportional-integral-double deriva-tive cascaded with proportional-integral(PIDD-PI)controller is employed as secondary controller in each control area for robust restructured AGC considering bilateral transactions and contract violations.The Harris Hawks algorithm is used to determine the optimal controller gains and system parameters under several scenarios.Electric vehicle(EV)aggregators are employed in each area to participate fully along with thermal and gas units to compensate for the unscheduled system demand in the local area.A comparison of non-cascaded controllers such as PI-PD,PD-PID and the proposed PIDD-PI proves the superiority of the last.The effect of the decline in inertia is closely examined because of the sudden outage of a generating unit while at the same time considering the change in area frequency response characteristics and area control error.EV fleets make significant contributions to improving the system dynamics dur-ing system inertia loss.The use of EVs in the presence of a wind energy-supported grid can provide a stable efficacy to the power grid.Numerous simulations with higher load demands,stochastic communication delays in presence of the WTG plant,and violations in system loadings and changes in gas turbine time constants in the absence of WTG demonstrate the robustness of the proposed control approach. 展开更多
关键词 Automatic generation control Cascade controller Electric vehicle harris hawks algorithm Wind turbine generator
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部