The pseudo-coloring problem (PsCP) is a combinatorial optimization challenge that involves assigning colors to elements in a way that meets specific criteria, often related to minimizing conflicts or maximizing some f...
详细信息
ISBN:
(纸本)9789819771806;9789819771813
The pseudo-coloring problem (PsCP) is a combinatorial optimization challenge that involves assigning colors to elements in a way that meets specific criteria, often related to minimizing conflicts or maximizing some form of utility. A variety of metaheuristic algorithms have been developed to solve PsCP efficiently. However, these algorithms sometimes struggle with the quality of solutions, impacting their ability to achieve optimal or near-optimal results reliably. To overcome these issues, this study introduces an adapted conscious neighborhood-based crow search algorithm (CCSA) and a massive variant of CCSA specifically tailored for PsCP. The performance of CCSA and MCCSA are evaluated on real and synthetic images and compared with state-of-the-art optimizers. The results showed that the adapted CCSA and MCCSA outperformed offering an effective strategy for image pseudo-colorization.
In telecommunication networks, fiber optics is used to transfer data from a source to a destination. One of the common problems in the transmission process is called the Bandpass Problem (BP). BP concentrates on estab...
详细信息
ISBN:
(纸本)9783031628801;9783031628818
In telecommunication networks, fiber optics is used to transfer data from a source to a destination. One of the common problems in the transmission process is called the Bandpass Problem (BP). BP concentrates on establishing a model that can transfer information on various wavelengths at a minimum cost usingwavelength division multiplexing technology. The data is organized in packets involving various columns. The minimum cost can be obtained by finding the best row permutation in terms of cost in an acceptable time. Sundry studies have been exploited to find the minimum cost at an appropriate time. Although previous studies have reduced the cost and decreased the execution time, they have not reached optimality. Therefore, in this article, a mining technique using a meta-heuristic method called the crow search algorithm (CSA) was applied to achieve the aforementioned goal. The proposed method can find the global minimum cost by keeping the positions of the best row permutation in an acceptable time. The row permutation remains unchanged unless a new better row permutation is computed. The findings exhibited a great deal of insights into how the CSA method outperformed the genetic algorithm, simulated annealing, and the ant bee colony in most cases.
Power system stabilizers (PSSs) are extensively used in generator units to enhance the transient stability of the power system. Hence, optimal tuning and placement of the parameters of PSS are crucial for the efficien...
详细信息
Power system stabilizers (PSSs) are extensively used in generator units to enhance the transient stability of the power system. Hence, optimal tuning and placement of the parameters of PSS are crucial for the efficiency of the stabilizer. Researchers have been proposed many methods for optimizing such parameters. In this paper, the crow search algorithm (CSA), which is based on the intelligence of crows, was employed in a single-machine infinite-bus (SMIB) system to determine the optimum parameters of the PSS. Modeling and simulation of the SMIB and designing of PSS were made by MATLAB/Simulink. PSSs are designed to minimize low-frequency oscillations such as power angle, rotor speed, and field current deviation following a large disturbance. Our objective in this study is the minimization of the rotor speed deviation. The results of the simulations proved the effectiveness and robustness of the optimization process compared to other metaheuristic algorithms such as particle swarm optimization (PSO) and genetic algorithm (GA). When compared to the performance attained by the GA-based and PSO-based PSS controller designs, the simulations show that the CSA-based PSS delivers a far better dynamic response when the system is disrupted. The CSA-based PSS settles 48.1% faster than the PSO-based PSS and 55.7% faster than the GA-based PSS. CSA has just 2 parameters to adjust, making it much easier to implement than other methods. These parameters for PSO and GA are 4 and 6. When CSA-based PSS is used in the SMIB system, overshoot and low-frequency oscillations are also significantly reduced compared to other methods.
crow search algorithm(CSA)is a swarm-based single-objective optimizer proposed in recent years,which tried to inspire the behavior of crows that hide foods in different locations and retrieve them when *** original ve...
详细信息
crow search algorithm(CSA)is a swarm-based single-objective optimizer proposed in recent years,which tried to inspire the behavior of crows that hide foods in different locations and retrieve them when *** original version of the CSA has simple parameters and moderate ***,it often tends to converge slowly or get stuck in a locally optimal region due to a missed harmonizing strategy during the exploitation and exploration ***,strategies of mutation and crisscross are combined into CSA(CCMSCSA)in this paper to improve the performance and provide an efficient optimizer for various optimization *** verify the superiority of CCMSCSA,a set of comparisons has been performed reasonably with some well-established metaheuristics and advanced metaheuristics on 15 benchmark *** experimental results expose and verify that the proposed CCMSCSA has meaningfully improved the convergence speed and the ability to jump out of the local *** addition,the scalability of CCMSCSA is analyzed,and the algorithm is applied to several engineering problems in a constrained space and feature selection *** results show that the scalability of CCMSCSA has been significantly improved and can find better solutions than its competitors when dealing with combinatorial optimization *** proposed CCMSCSA performs well in almost all experimental ***,we hope the researchers can see it as an effective method for solving constrained and unconstrained optimization problems.
crow search algorithm (CSA) is a novel meta-heuristic optimization algorithm based on the intelligent behavior of the crow population. Although the algorithm has the characteristics of few parameters, simple structure...
详细信息
crow search algorithm (CSA) is a novel meta-heuristic optimization algorithm based on the intelligent behavior of the crow population. Although the algorithm has the characteristics of few parameters, simple structure, and easy application, it has the shortcomings of low convergence accuracy and imbalance between exploration and exploitation capabilities. The occurrence of these issues is originated from crow learning from only one goal. In this paper, an improved crow search algorithm based on oppositional forgetting learning (OFLCSA) is proposed. In order to solve the shortcomings of CSA, the forgetting mechanism is introduced to help the algorithm jump out of the local optimum. Moreover, the opposition-based learning (OBL) strategy is combined with the forgetting mechanism to increase the probability of approaching the optimal solution. In addition, the elite crow and adaptive flight length are used to improve the convergence accuracy. To verify the performance of OFLCSA, experiments were conducted on the Congress on Evolutionary Computation (CEC) 2014 and CEC 2019 benchmark functions. OFLCSA is compared with the ten state-of-the-art meta-heuristic optimization algorithms. Moreover, OFLCSA is evaluated by four real-world engineering applications. Experimental results and analysis show that OFLCSA is a competitive meta-heuristic optimization algorithm.
The development of a reliable quantitative structure-activity relationship (QSAR) classification model with a small number of molecular descriptors is a crucial step in chemometrics. In this study, an improvement of c...
详细信息
The development of a reliable quantitative structure-activity relationship (QSAR) classification model with a small number of molecular descriptors is a crucial step in chemometrics. In this study, an improvement of crow search algorithm (CSA) is proposed by adapting the opposite-based learning (OBL) approach, which is named as OBL-CSA, to improve the exploration and exploitation capability of the CSA in quantitative structure-biodegradation relationship (QSBR) modelling of classifying the biodegradable materials. The results reveal that the performance of OBL-CSA not only manifest in improving the classification performance, but also in reduced computational time required to complete the process when compared to the standard CSA and other four optimization algorithms tested, which are the particle swarm algorithm (PSO), black hole algorithm (BHA), grey wolf algorithm (GWA), and whale optimization algorithm (WOA). In conclusion, the OBL-CSA could be a valuable resource in the classification of biodegradable materials.
This research presents a crow search algorithm (CSA) for reducing the cellular network cost when reporting the cell planning (RCP) scheme. In cellular systems, the RCP scheme is used to maintain location. We employ CS...
详细信息
This research presents a crow search algorithm (CSA) for reducing the cellular network cost when reporting the cell planning (RCP) scheme. In cellular systems, the RCP scheme is used to maintain location. We employ CSA as an optimization tool because it is a bio-inspired optimization technique. In this study, CSA uses the cellular network's diversity to optimize the cost of reporting the RCP scheme. The cost of location management is calculated using dynamic awareness probability (DAP) and a CSA for various cellular network sizes. With each iteration of the CSA, the dynamic properties of the DAP are used to change the decision threshold. This provides additional freedom and enhances decision-making abilities. As a result, the set awareness probability allows for a cheaper cost per call arrival. Extensive simulations are used to test and evaluate the suggested method's performance. The experiments are carried out with 4 x 4, 6 x 6, and 8 x 8 cells in current cellular systems. The recommended CSA is used to measure performance in groups of 50, 100, 150, and 200 people. Multiple graphs displaying statistical measurements, convergence rates, and other data are used to present the conclusions. It was determined that scaling up from a smaller to a larger network lowers the cost per call arrival by about 12%. This shows a possible vision of the proposed CSA's vast range of uses and needs more research to improve existing cellular services.
In recent times, sentiment analysis research has gained wide popularity. That situation causes the importance of online applications that allow users to express their opinions on events, services, or products through ...
详细信息
In recent times, sentiment analysis research has gained wide popularity. That situation causes the importance of online applications that allow users to express their opinions on events, services, or products through social media applications such as Twitter, Facebook, and Amazon. This paper proposes a novel sentiment classification method according to the fuzzy rule-based system (FRBS) with the crow search algorithm (CSA). FRBS is used to classify the polarity of sentences or documents, and the CSA is employed to optimize the best output from the fuzzy logic algorithm. The FRBS is applied to extract the sentiment and classify its polarity into negative, neutral, and positive. Sometimes, the outputs of the FRBS must be enhanced, especially since many variables are present and the rules between them overlap. For such cases, the CSA is used to solve this limitation faced by FRBS to optimize the outputs of FRBS and achieve the best result. This study compares the performance of the proposed model with different machine learning algorithms, such as SVM, maximum entropy, boosting, and SWESA. It tests the model on three famous data sets collected from Amazon, Yelp, and IMDB. Experimental results demonstrate the effectiveness of the proposed model and achieve competitive performance in terms of accuracy, recall, precision, and the F-score.
In recent years, with the increasing volume of databases, the removal of redundant features has become an essential thing in classification. A smaller subset of features is selected using feature selection algorithm. ...
详细信息
In recent years, with the increasing volume of databases, the removal of redundant features has become an essential thing in classification. A smaller subset of features is selected using feature selection algorithm. One of the famous algorithms of feature selection methods is the crow search algorithm (CSA). This algorithm's popularity can be mentioned in the algorithm's implementation and process and the impressive results compared to the previous algorithms. Despite all these benefits, this algorithm suffers from problems such as unbalanced global and local search. It is also stuck in local optimization due to the search approach's inadequacy. In this paper, a new algorithm based on CSA is introduced. In order to overcome the shortcoming, four fundamental changes have been made to CSA. (i) The algorithm uses the concept of dynamic awareness probability to solve the balance between exploitation and exploration. Then, a new approach is introduced for each part of the search that improves crows' search performance both (ii) locally and (iii) globally. Also, as the last change, (iv) the concept of chaos is used to increase the algorithm's convergence rate. The proposed method has been tested and compared with ten well-known algorithms in this field on the same datasets and has performed on average 20% better in the feature reduction index and 2.5% in the fitness index, while has a lower performance in accuracy by only 1.5%. Practical results show that the algorithm changes have provided attractive results compared to other algorithms in this field in the mentioned metrics.
This work introduces cutting-edge research to predict heart diseases. This application designed for accurate and personalized assessment of cardiovascular health. This work aims to provide an overall understanding of ...
详细信息
暂无评论