In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending netw...In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.展开更多
Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In ...Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.展开更多
An improved teaching-learning-based optimization(I-TLBO)algorithm is proposed to adjust the parameters of extreme learning machine with parallel layer perception(PELM),and a well-generalized I-TLBO-PELM model is obtai...An improved teaching-learning-based optimization(I-TLBO)algorithm is proposed to adjust the parameters of extreme learning machine with parallel layer perception(PELM),and a well-generalized I-TLBO-PELM model is obtained to build the model of NOX emissions of a boiler.In the I-TLBO algorithm,there are four major highlights.Firstly,a quantum initialized population by using the qubits on Bloch sphere replaces a randomly initialized population.Secondly,two kinds of angles in Bloch sphere are generated by using cube chaos mapping.Thirdly,an adaptive control parameter is added into the teacher phase to speed up the convergent speed.And then,according to actual teaching-learning phenomenon of a classroom,students learn some knowledge not only by their teacher and classmates,but also by themselves.Therefore,a self-study strategy by using Gauss mutation is introduced after the learning phase to improve the exploration ability.Finally,we test the performance of the I-TLBO-PELM model.The experiment results show that the proposed model has better regression precision and generalization ability than eight other models.展开更多
This study presents an autoencoder-embedded optimization(AEO)algorithm which involves a bi-population cooperative strategy for medium-scale expensive problems(MEPs).A huge search space can be compressed to an informat...This study presents an autoencoder-embedded optimization(AEO)algorithm which involves a bi-population cooperative strategy for medium-scale expensive problems(MEPs).A huge search space can be compressed to an informative lowdimensional space by using an autoencoder as a dimension reduction tool.The search operation conducted in this low space facilitates the population with fast convergence towards the optima.To strike the balance between exploration and exploitation during optimization,two phases of a tailored teaching-learning-based optimization(TTLBO)are adopted to coevolve solutions in a distributed fashion,wherein one is assisted by an autoencoder and the other undergoes a regular evolutionary process.Also,a dynamic size adjustment scheme according to problem dimension and evolutionary progress is proposed to promote information exchange between these two phases and accelerate evolutionary convergence speed.The proposed algorithm is validated by testing benchmark functions with dimensions varying from 50 to 200.As indicated in our experiments,TTLBO is suitable for dealing with medium-scale problems and thus incorporated into the AEO framework as a base optimizer.Compared with the state-of-the-art algorithms for MEPs,AEO shows extraordinarily high efficiency for these challenging problems,t hus opening new directions for various evolutionary algorithms under AEO to tackle MEPs and greatly advancing the field of medium-scale computationally expensive optimization.展开更多
<span style="font-family:Verdana;">In the present deregulated electricity market, power system congestion is the main complication that an independent system operator (ISO) faces on a regular basis. Tr...<span style="font-family:Verdana;">In the present deregulated electricity market, power system congestion is the main complication that an independent system operator (ISO) faces on a regular basis. Transmission line congestion trigger serious problems for smooth functioning in restructured power system causing an increase in the cost of transmission hence affecting market efficiency. Thus, it is of utmost importance for the investigation of various techniques in order to relieve congestion in the transmission network. Generation rescheduling is one of the most efficacious techniques to do away with the problem of congestion. For optimiz</span><span style="font-family:Verdana;">ing the congestion cost, this work suggests a hybrid optimization based on</span><span style="font-family:Verdana;"> two effective algorithms viz Teaching learning-based optimization (TLBO) algorithm and Particle swarm optimization (PSO) algorithm. For binding the constraints, the traditional penalty function technique is incorporated. Modified IEEE 30-bus test system and modified IEEE 57-bus test system are used to inspect the usefulness of the suggested methodology.</span>展开更多
提出了一种基于协同进化教与学优化(Co-evolutionary Teaching-and-Learning based Optimization,CTLBO)算法的二维最大熵多阈值分割方法。首先,给出了二维熵多阈值分割的最优化模型。然后,针对教与学优化(Teaching-and-Learning based ...提出了一种基于协同进化教与学优化(Co-evolutionary Teaching-and-Learning based Optimization,CTLBO)算法的二维最大熵多阈值分割方法。首先,给出了二维熵多阈值分割的最优化模型。然后,针对教与学优化(Teaching-and-Learning based Optimization,TLBO)算法存在的早熟收敛和停滞问题,提出了一种CTLBO算法,并将该算法应用于二维熵多阈值分割最优化模型的求解。该算法将整个班级分为多个子班级,每个子班级的学员同时向所有子班级的老师学习,从而提高种群多样性。此外,每隔一定的代数,各子班级的老师组成新的班级进行信息交流,从而提高收敛速度。最后,应用仿真实验对所提方法的有效性和可行性进行了验证。实验结果表明:与基于传统TLBO算法及其相关改进算法、粒子群算法的图像分割方法相比,所提方法具有更好的优化能力和分割性能。展开更多
文摘In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.
基金Supported by National Natural Science Foundation of China(Grant Nos.51275366,50875190,51305311)Specialized Research Fund for the Doctoral Program of Higher Education of China(Grant No.20134219110002)
文摘Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.
基金The authors would also like to acknowledge the valuable comments and suggestions from the Editors and Reviewers,which vastly contributed to improve the presentation of the paper.This work is supported by the National Natural Science Foundations of China(61573306 and 61403331)2018 Qinhuangdao City Social Science Development Research Project(201807047 and 201807088)+1 种基金the Program for the Top Young Talents of Higher Learning Institutions of Hebei(BJ2017033)the Marine Science Special Research Project of Hebei Normal University of Science and Technology(No.2018HY021).
文摘An improved teaching-learning-based optimization(I-TLBO)algorithm is proposed to adjust the parameters of extreme learning machine with parallel layer perception(PELM),and a well-generalized I-TLBO-PELM model is obtained to build the model of NOX emissions of a boiler.In the I-TLBO algorithm,there are four major highlights.Firstly,a quantum initialized population by using the qubits on Bloch sphere replaces a randomly initialized population.Secondly,two kinds of angles in Bloch sphere are generated by using cube chaos mapping.Thirdly,an adaptive control parameter is added into the teacher phase to speed up the convergent speed.And then,according to actual teaching-learning phenomenon of a classroom,students learn some knowledge not only by their teacher and classmates,but also by themselves.Therefore,a self-study strategy by using Gauss mutation is introduced after the learning phase to improve the exploration ability.Finally,we test the performance of the I-TLBO-PELM model.The experiment results show that the proposed model has better regression precision and generalization ability than eight other models.
基金supported in part by the National Natural Science Foundation of China(72171172,62088101)in part by the Shanghai Science and Technology Major Special Project of Shanghai Development and Reform Commission(2021SHZDZX0100)+2 种基金in part by the Shanghai Commission of Science and Technology(19511132100,19511132101)in part by the China Scholarship Councilin part by the Deanship of Scientific Research(DSR)at King Abdulaziz University(KAU),Jeddah,Saudi Arabia(FP-146-43)。
文摘This study presents an autoencoder-embedded optimization(AEO)algorithm which involves a bi-population cooperative strategy for medium-scale expensive problems(MEPs).A huge search space can be compressed to an informative lowdimensional space by using an autoencoder as a dimension reduction tool.The search operation conducted in this low space facilitates the population with fast convergence towards the optima.To strike the balance between exploration and exploitation during optimization,two phases of a tailored teaching-learning-based optimization(TTLBO)are adopted to coevolve solutions in a distributed fashion,wherein one is assisted by an autoencoder and the other undergoes a regular evolutionary process.Also,a dynamic size adjustment scheme according to problem dimension and evolutionary progress is proposed to promote information exchange between these two phases and accelerate evolutionary convergence speed.The proposed algorithm is validated by testing benchmark functions with dimensions varying from 50 to 200.As indicated in our experiments,TTLBO is suitable for dealing with medium-scale problems and thus incorporated into the AEO framework as a base optimizer.Compared with the state-of-the-art algorithms for MEPs,AEO shows extraordinarily high efficiency for these challenging problems,t hus opening new directions for various evolutionary algorithms under AEO to tackle MEPs and greatly advancing the field of medium-scale computationally expensive optimization.
文摘<span style="font-family:Verdana;">In the present deregulated electricity market, power system congestion is the main complication that an independent system operator (ISO) faces on a regular basis. Transmission line congestion trigger serious problems for smooth functioning in restructured power system causing an increase in the cost of transmission hence affecting market efficiency. Thus, it is of utmost importance for the investigation of various techniques in order to relieve congestion in the transmission network. Generation rescheduling is one of the most efficacious techniques to do away with the problem of congestion. For optimiz</span><span style="font-family:Verdana;">ing the congestion cost, this work suggests a hybrid optimization based on</span><span style="font-family:Verdana;"> two effective algorithms viz Teaching learning-based optimization (TLBO) algorithm and Particle swarm optimization (PSO) algorithm. For binding the constraints, the traditional penalty function technique is incorporated. Modified IEEE 30-bus test system and modified IEEE 57-bus test system are used to inspect the usefulness of the suggested methodology.</span>
文摘提出了一种基于协同进化教与学优化(Co-evolutionary Teaching-and-Learning based Optimization,CTLBO)算法的二维最大熵多阈值分割方法。首先,给出了二维熵多阈值分割的最优化模型。然后,针对教与学优化(Teaching-and-Learning based Optimization,TLBO)算法存在的早熟收敛和停滞问题,提出了一种CTLBO算法,并将该算法应用于二维熵多阈值分割最优化模型的求解。该算法将整个班级分为多个子班级,每个子班级的学员同时向所有子班级的老师学习,从而提高种群多样性。此外,每隔一定的代数,各子班级的老师组成新的班级进行信息交流,从而提高收敛速度。最后,应用仿真实验对所提方法的有效性和可行性进行了验证。实验结果表明:与基于传统TLBO算法及其相关改进算法、粒子群算法的图像分割方法相比,所提方法具有更好的优化能力和分割性能。
