As threats of landslide hazards have become gradually more severe in recent decades,studies on landslide prevention and mitigation have attracted widespread attention in relevant domains.A hot research topic has been ...As threats of landslide hazards have become gradually more severe in recent decades,studies on landslide prevention and mitigation have attracted widespread attention in relevant domains.A hot research topic has been the ability to predict landslide susceptibility,which can be used to design schemes of land exploitation and urban development in mountainous areas.In this study,the teaching-learning-based optimization(TLBO)and satin bowerbird optimizer(SBO)algorithms were applied to optimize the adaptive neuro-fuzzy inference system(ANFIS)model for landslide susceptibility mapping.In the study area,152 landslides were identified and randomly divided into two groups as training(70%)and validation(30%)dataset.Additionally,a total of fifteen landslide influencing factors were selected.The relative importance and weights of various influencing factors were determined using the step-wise weight assessment ratio analysis(SWARA)method.Finally,the comprehensive performance of the two models was validated and compared using various indexes,such as the root mean square error(RMSE),processing time,convergence,and area under receiver operating characteristic curves(AUROC).The results demonstrated that the AUROC values of the ANFIS,ANFIS-TLBO and ANFIS-SBO models with the training data were 0.808,0.785 and 0.755,respectively.In terms of the validation dataset,the ANFISSBO model exhibited a higher AUROC value of 0.781,while the AUROC value of the ANFIS-TLBO and ANFIS models were 0.749 and 0.681,respectively.Moreover,the ANFIS-SBO model showed lower RMSE values for the validation dataset,indicating that the SBO algorithm had a better optimization capability.Meanwhile,the processing time and convergence of the ANFIS-SBO model were far superior to those of the ANFIS-TLBO model.Therefore,both the ensemble models proposed in this paper can generate adequate results,and the ANFIS-SBO model is recommended as the more suitable model for landslide susceptibility assessment in the study area considered due to its excellent accuracy and ef展开更多
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.展开更多
Bottleneck stage and reentrance often exist in real-life manufacturing processes;however,the previous research rarely addresses these two processing conditions in a scheduling problem.In this study,a reentrant hybrid ...Bottleneck stage and reentrance often exist in real-life manufacturing processes;however,the previous research rarely addresses these two processing conditions in a scheduling problem.In this study,a reentrant hybrid flow shop scheduling problem(RHFSP)with a bottleneck stage is considered,and an elite-class teaching-learning-based optimization(ETLBO)algorithm is proposed to minimize maximum completion time.To produce high-quality solutions,teachers are divided into formal ones and substitute ones,and multiple classes are formed.The teacher phase is composed of teacher competition and teacher teaching.The learner phase is replaced with a reinforcement search of the elite class.Adaptive adjustment on teachers and classes is established based on class quality,which is determined by the number of elite solutions in class.Numerous experimental results demonstrate the effectiveness of new strategies,and ETLBO has a significant advantage in solving the considered RHFSP.展开更多
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>展开更多
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.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.41807192,41790441)Innovation Capability Support Program of Shaanxi(Grant No.2020KJXX-005)Natural Science Basic Research Program of Shaanxi(Grant Nos.2019JLM-7,2019JQ-094)。
文摘As threats of landslide hazards have become gradually more severe in recent decades,studies on landslide prevention and mitigation have attracted widespread attention in relevant domains.A hot research topic has been the ability to predict landslide susceptibility,which can be used to design schemes of land exploitation and urban development in mountainous areas.In this study,the teaching-learning-based optimization(TLBO)and satin bowerbird optimizer(SBO)algorithms were applied to optimize the adaptive neuro-fuzzy inference system(ANFIS)model for landslide susceptibility mapping.In the study area,152 landslides were identified and randomly divided into two groups as training(70%)and validation(30%)dataset.Additionally,a total of fifteen landslide influencing factors were selected.The relative importance and weights of various influencing factors were determined using the step-wise weight assessment ratio analysis(SWARA)method.Finally,the comprehensive performance of the two models was validated and compared using various indexes,such as the root mean square error(RMSE),processing time,convergence,and area under receiver operating characteristic curves(AUROC).The results demonstrated that the AUROC values of the ANFIS,ANFIS-TLBO and ANFIS-SBO models with the training data were 0.808,0.785 and 0.755,respectively.In terms of the validation dataset,the ANFISSBO model exhibited a higher AUROC value of 0.781,while the AUROC value of the ANFIS-TLBO and ANFIS models were 0.749 and 0.681,respectively.Moreover,the ANFIS-SBO model showed lower RMSE values for the validation dataset,indicating that the SBO algorithm had a better optimization capability.Meanwhile,the processing time and convergence of the ANFIS-SBO model were far superior to those of the ANFIS-TLBO model.Therefore,both the ensemble models proposed in this paper can generate adequate results,and the ANFIS-SBO model is recommended as the more suitable model for landslide susceptibility assessment in the study area considered due to its excellent accuracy and ef
基金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 National Natural Science Foundation of China(Grant Number 61573264).
文摘Bottleneck stage and reentrance often exist in real-life manufacturing processes;however,the previous research rarely addresses these two processing conditions in a scheduling problem.In this study,a reentrant hybrid flow shop scheduling problem(RHFSP)with a bottleneck stage is considered,and an elite-class teaching-learning-based optimization(ETLBO)algorithm is proposed to minimize maximum completion time.To produce high-quality solutions,teachers are divided into formal ones and substitute ones,and multiple classes are formed.The teacher phase is composed of teacher competition and teacher teaching.The learner phase is replaced with a reinforcement search of the elite class.Adaptive adjustment on teachers and classes is established based on class quality,which is determined by the number of elite solutions in class.Numerous experimental results demonstrate the effectiveness of new strategies,and ETLBO has a significant advantage in solving the considered RHFSP.
基金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>
基金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.
