Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (66)

Search Parameters:
Keywords = flower pollination algorithm (FPA)

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
44 pages, 2719 KB  
Article
Hybrid LSF–FPA Optimization for Optimal Capacitor Placement and Sizing in Radial Distribution Systems
by Pablo Ribadeneira, Alexander Aguila Téllez and Manuel Darío Jaramillo Monge
Energies 2026, 19(15), 3462; https://doi.org/10.3390/en19153462 - 23 Jul 2026
Viewed by 225
Abstract
Increasing demand in radial distribution systems intensifies active power losses, voltage drops, and power factor deterioration, leading to reduced network efficiency and increased annual operating costs. Shunt capacitor banks can mitigate these effects by supplying reactive power locally; however, determining their locations and [...] Read more.
Increasing demand in radial distribution systems intensifies active power losses, voltage drops, and power factor deterioration, leading to reduced network efficiency and increased annual operating costs. Shunt capacitor banks can mitigate these effects by supplying reactive power locally; however, determining their locations and discrete ratings constitutes a nonlinear optimization problem governed by the radial network structure, nonlinear load flow equations, reactive power compensation limits, power factor requirements, and commercially available capacitor sizes. This paper presents a hybrid methodology that combines Loss Sensitivity Factors (LSFs) for candidate-bus screening with the Flower Pollination Algorithm (FPA) for discrete capacitor sizing. The LSF stage ranks buses according to the local sensitivity of active power losses to reactive power variations and applies a voltage-based screening criterion to reduce the number of decision variables. The FPA subsequently explores the reduced search space through global and local pollination, while a projection-and-repair procedure maps every continuous trial vector onto admissible capacitor ratings in 50 kVAr increments. The objective function minimizes the annual cost of active power losses, capacitor bank installation, and installed reactive power capacity. The method is evaluated on the IEEE 33-bus, 69-bus, and 141-bus radial distribution systems. For the IEEE 33-bus system, active power losses decrease from 202.7 to 133.5 kW and the power factor increases from 0.8502 to 0.9827. For the IEEE 69-bus system, losses decrease from 225.0 to 145.9 kW and the power factor increases from 0.8159 to 0.9705. For the IEEE 141-bus system, losses decrease from 632.7 to 453.7 kW and the power factor increases from 0.8500 to 0.9876. The corresponding cost savings in terms of annual loss are USD 36,371.52, USD 41,574.96, and USD 94,082.40. The compensation configurations improve the voltage profiles in all three systems; nevertheless, the resulting minimum voltages of 0.939, 0.932, and 0.948 p.u. remain below the 0.95 p.u. lower reference because voltage deviation is evaluated as a performance indicator rather than enforced through a hard constraint or penalty term. The results demonstrate that the proposed LSF–FPA framework provides effective loss reduction, power factor correction, and voltage profile improvement, while the economic comparison shows that the solution with the greatest loss reduction benefit does not necessarily produce the lowest total annual cost. Full article
(This article belongs to the Section F1: Electrical Power System)
Show Figures

Figure 1

39 pages, 3558 KB  
Article
Enhanced Load Frequency Control for Renewable-Integrated Low-Inertia Power Systems Using FPA-Optimised PID Controller with UPFC and Redox Flow Battery
by Stephen Gumede, Kavita Behara and Gulshan Sharma
Energies 2026, 19(12), 2898; https://doi.org/10.3390/en19122898 - 18 Jun 2026
Viewed by 287
Abstract
The increasing penetration of renewable energy sources introduces significant variability, low-inertia behaviour, and operational uncertainty into modern power systems, resulting in frequent frequency deviations and degraded dynamic stability. Conventional Load Frequency Control (LFC) approaches based on fixed-parameter PID controllers often exhibit limited disturbance [...] Read more.
The increasing penetration of renewable energy sources introduces significant variability, low-inertia behaviour, and operational uncertainty into modern power systems, resulting in frequent frequency deviations and degraded dynamic stability. Conventional Load Frequency Control (LFC) approaches based on fixed-parameter PID controllers often exhibit limited disturbance rejection capability under nonlinear and stochastic operating conditions. This study proposes an enhanced LFC framework that integrates a PID controller optimised using the Flower Pollination Algorithm (FPA) with support from a Unified Power Flow Controller (UPFC) and a Redox Flow Battery (RFB) to improve frequency regulation, damping, and robustness in renewable-integrated low-inertia power systems. This study developed a MATLAB/Simulink single-area power system model comprising governor, turbine, and generator-load dynamics to evaluate controller performance under a 0.01 pu step disturbance, stochastic load variations, renewable energy fluctuations, and ±20% parameter uncertainty conditions. The FPA optimally tuned the PID controller gains using the Integral Time Absolute Error criterion to enhance transient response and disturbance rejection capability. Comparative analyses were conducted against conventional PID and fuzzy-based controllers using settling time, overshoot, RMS deviation, ITAE, and mean frequency deviation indices. Simulation results demonstrate that the proposed FPA–PID + UPFC framework significantly outperforms the conventional PID controller by achieving approximately 66.6% settling-time reduction, 72.1% RMS reduction, and 75.5% ITAE reduction. The proposed framework reduced settling time from 18.46 s to 6.16 s and substantially improved damping performance under stochastic disturbances. The coordinated integration of the UPFC and RFB further enhanced transient stability through dynamic power-flow regulation and rapid active-power compensation during disturbances. Sensitivity analysis under parameter uncertainty and stochastic operating conditions confirmed stable and reliable operation under stochastic disturbances and parameter uncertainty conditions. The proposed architecture, therefore, provides an effective, practically applicable solution for secondary frequency regulation in renewable-rich smart grids, low-inertia transmission systems, microgrids, and future distributed power networks. Full article
Show Figures

Figure 1

14 pages, 1235 KB  
Proceeding Paper
Quadrotor Trajectory Tracking Under Wind Disturbance Using Backstepping Control Based on Different Optimization Techniques
by Imam Barket Ghiloubi, Latifa Abdou, Oussama Lahmar and Abdel Hakim Drid
Eng. Proc. 2025, 87(1), 93; https://doi.org/10.3390/engproc2025087093 - 16 Jul 2025
Cited by 4 | Viewed by 3576
Abstract
Enhancing quadrotor control to improve both precision and responsiveness is essential for expanding their deployment in complex and dynamic environments. These aerial vehicles are widely used in applications, such as aerial mapping, delivery, disaster response, and defense, where maintaining stability and accuracy is [...] Read more.
Enhancing quadrotor control to improve both precision and responsiveness is essential for expanding their deployment in complex and dynamic environments. These aerial vehicles are widely used in applications, such as aerial mapping, delivery, disaster response, and defense, where maintaining stability and accuracy is critical, especially under external disturbances like wind. This paper makes three key contributions. First, it develops a nonlinear mathematical model of a quadrotor and designs a backstepping controller for trajectory tracking. Second, the controller’s parameters are optimized using three nature-inspired algorithms: Gray Wolf Optimization (GWO), Particle Swarm Optimization (PSO), and the Flower Pollination Algorithm (FPA), enabling performance comparisons in terms of their tracking precision and control effort. Third, the robustness of the best-performing optimized controller is evaluated by applying wind disturbances at the simulation level, modeled as external forces acting along the x-axis and summed with the control input. The simulation results highlight the comparative efficiency of the optimization methods and demonstrate the robustness of the selected controller in maintaining stability and accuracy under wind-induced perturbations. Full article
(This article belongs to the Proceedings of The 5th International Electronic Conference on Applied Sciences)
Show Figures

Figure 1

28 pages, 2804 KB  
Article
Adaptive Network-Based Fuzzy Inference System Training Using Nine Different Metaheuristic Optimization Algorithms for Time-Series Analysis of Brent Oil Price and Detailed Performance Analysis
by Ebubekir Kaya, Ahmet Kaya and Ceren Baştemur Kaya
Symmetry 2025, 17(5), 786; https://doi.org/10.3390/sym17050786 - 19 May 2025
Cited by 3 | Viewed by 1436
Abstract
Brent oil holds a significant position in the global energy market, as oil prices in many regions are indexed to it. Therefore, forecasting the future price of Brent oil is of great importance. In recent years, artificial intelligence techniques have been widely applied [...] Read more.
Brent oil holds a significant position in the global energy market, as oil prices in many regions are indexed to it. Therefore, forecasting the future price of Brent oil is of great importance. In recent years, artificial intelligence techniques have been widely applied in modeling and prediction tasks. In this study, an Adaptive Neuro-Fuzzy Inference System (ANFIS), a well-established AI approach, was employed for the time-series forecasting of Brent oil prices. To ensure effective learning and improve prediction accuracy, ANFIS was trained using nine different metaheuristic algorithms: Artificial Bee Colony (ABC), Selfish Herd Optimizer (SHO), Biogeography-Based Optimization (BBO), Multi-Verse Optimizer (MVO), Teaching–Learning-Based Optimization (TLBO), Cuckoo Search (CS), Moth Flame Optimization (MFO), Marine Predator Algorithm (MPA), and Flower Pollination Algorithm (FPA). Symmetric training procedures were applied across all algorithms to ensure fair and consistent evaluation. The analyses were conducted on the lowest and highest daily, weekly, and monthly Brent oil prices. Mean squared error (MSE) was used as the primary performance metric. The results showed that all algorithms achieved effective prediction performance. Among them, BBO and TLBO demonstrated superior accuracy and stability, particularly in handling the complexities of Brent oil forecasting. This study contributes to the literature by combining ANFIS and metaheuristics within a symmetric framework of experimentation and evaluation. Full article
Show Figures

Figure 1

20 pages, 694 KB  
Article
Performance Evaluation of Fractional Proportional–Integral–Derivative Controllers Tuned by Heuristic Algorithms for Nonlinear Interconnected Tanks
by Raúl Pazmiño, Wilson Pavon, Matthew Armstrong and Silvio Simani
Algorithms 2024, 17(7), 306; https://doi.org/10.3390/a17070306 - 10 Jul 2024
Cited by 8 | Viewed by 1961
Abstract
This article presents an in-depth analysis of three advanced strategies to tune fractional PID (FOPID) controllers for a nonlinear system of interconnected tanks, simulated using MATLAB. The study focuses on evaluating the performance characteristics of system responses controlled by FOPID controllers tuned through [...] Read more.
This article presents an in-depth analysis of three advanced strategies to tune fractional PID (FOPID) controllers for a nonlinear system of interconnected tanks, simulated using MATLAB. The study focuses on evaluating the performance characteristics of system responses controlled by FOPID controllers tuned through three heuristic algorithms: Ant Colony Optimization (ACO), Grey Wolf Optimizer (GWO), and Flower Pollination Algorithm (FPA). Each algorithm aims to minimize its respective cost function using various performance metrics. The nonlinear model was linearized around an equilibrium point using Taylor Series expansion and Laplace transforms to facilitate control. The FPA algorithm performed better with the lowest Integral Square Error (ISE) criterion value (297.83) and faster convergence in constant values and fractional orders. This comprehensive evaluation underscores the importance of selecting the appropriate tuning strategy and performance index, demonstrating that the FPA provides the most efficient and robust tuning for FOPID controllers in nonlinear systems. The results highlight the efficacy of meta-heuristic algorithms in optimizing complex control systems, providing valuable insights for future research and practical applications, thereby contributing to the advancement of control systems engineering. Full article
Show Figures

Figure 1

24 pages, 6320 KB  
Article
Application of Dandelion Optimization Algorithm in Pattern Synthesis of Linear Antenna Arrays
by Jianhui Li, Yan Liu, Wanru Zhao and Tianning Zhu
Mathematics 2024, 12(7), 1111; https://doi.org/10.3390/math12071111 - 7 Apr 2024
Cited by 17 | Viewed by 2836
Abstract
This paper introduces an application of the dandelion optimization (DO) algorithm in antenna arrays. This is the first time that the DO algorithm has been used for optimizing antenna arrays. For antenna array optimization, sidelobe level (SLL) and deep nulls are key technical [...] Read more.
This paper introduces an application of the dandelion optimization (DO) algorithm in antenna arrays. This is the first time that the DO algorithm has been used for optimizing antenna arrays. For antenna array optimization, sidelobe level (SLL) and deep nulls are key technical indicators. A lower SLL can improve the signal-to-noise ratio and reduce the impact of clutter signals outside the main beam. Deep nulls need to be aligned with the direction of interference to eliminate the influence of interference sources. The combination of the two can effectively improve the anti-interference ability of the entire system. Therefore, antenna arrays with ultra-low sidelobes and ultra-deep nulls are currently hot in the field of antenna array design and are also some of the key technologies needed to achieve modern high-performance radar systems. As a new type of evolutionary algorithm inspired by nature, the DO algorithm is inspired by the wind propagation behavior of dandelions in nature. This algorithm iteratively updates the population from three stages of ascent, descent, and landing, ultimately finding the optimal position. It has good optimization ability in solving complex problems such as those involving nonlinearity, discreteness, and non-convexity, and the antenna array pattern synthesis optimization problem belongs to multivariate nonlinear problems. Therefore, the DO algorithm can be effectively applied in the field of antenna array optimization. In this work, we use the following method to obtain an optimized pattern of a linear array with the lowest sidelobe level (SLL), null placement in particular directions, and a lower notch in particular directions: by controlling the antenna array’s element spacing and leaving the phase unchanged to optimize the current amplitudes and by controlling the excitation current and phase fixation of the antenna array and changing the element spacing. In the first and second examples, different algorithms are used to reduce the SLL of the antenna. In the first example, the DO algorithm reduces the SLL to −33.37 dB, which is 2.67 dB, 2.67 dB, 3.77 dB, 2.74 dB, and 2.52 dB lower than five other algorithms. In the second example, the SLL optimized by the DO algorithm is −42.56 dB, which is 5.04 dB and 1.48 dB lower than two other algorithms. In both examples, the DO algorithm reduces the SLL lower than other algorithms when the main lobe of the antenna is not significantly widened. Examples 3, 4, and 5 use the DO algorithm to optimize the amplitude of the current, generating deep nulls and deep notches in specific directions. In Example 3, the DO algorithm obtains a depth of nulls equal to −187.6 dB, which is 66.7 dB and 44.3 dB lower than that of the flower pollination algorithm (FPA) and the chaotic colony predation algorithm (CCPA), respectively. In Example 4, the deep null obtained by the DO algorithm is as low as −98.69 dB, which is 6.67 dB lower than the deep null obtained by the grey wolf optimization (GWO) algorithm. In Example 5, the deep notch obtained by the DO algorithm is as low as −63.1 dB, which is 6.4 dB and 1.9 dB lower than the spider monkey optimization (SMO) algorithm and the grasshopper optimization algorithm (GOA), respectively. The data prove that the DO algorithm produces deeper nulls and notches than other algorithms. The last two examples involve reducing sidelobe levels and generating deep nulls by optimizing the spacing between elements. In Example 5, the SLL obtained using the DO algorithm is −22.8766 dB, which is 0.1998 dB lower than the lowest SLL of −22.6768 dB among other algorithms. In Example 6, the SLL obtained using the DO algorithm is −20.1012 dB, and the null depth is −125.1 dB, which is 1.592 dB lower than the SLL obtained by the cat swarm optimization (CSO) algorithm and 19.1 dB lower than the deep null obtained by the GWO algorithm, respectively. In summary, the results of six simulation experiments indicate that the DO algorithm has better optimization ability in linear array optimization than other evolutionary algorithms. Full article
Show Figures

Figure 1

25 pages, 2019 KB  
Article
Optimizing Cybersecurity Attack Detection in Computer Networks: A Comparative Analysis of Bio-Inspired Optimization Algorithms Using the CSE-CIC-IDS 2018 Dataset
by Hadi Najafi Mohsenabad and Mehmet Ali Tut
Appl. Sci. 2024, 14(3), 1044; https://doi.org/10.3390/app14031044 - 25 Jan 2024
Cited by 58 | Viewed by 6576
Abstract
In computer network security, the escalating use of computer networks and the corresponding increase in cyberattacks have propelled Intrusion Detection Systems (IDSs) to the forefront of research in computer science. IDSs are a crucial security technology that diligently monitor network traffic and host [...] Read more.
In computer network security, the escalating use of computer networks and the corresponding increase in cyberattacks have propelled Intrusion Detection Systems (IDSs) to the forefront of research in computer science. IDSs are a crucial security technology that diligently monitor network traffic and host activities to identify unauthorized or malicious behavior. This study develops highly accurate models for detecting a diverse range of cyberattacks using the fewest possible features, achieved via a meticulous selection of features. We chose 5, 9, and 10 features, respectively, using the Artificial Bee Colony (ABC), Flower Pollination Algorithm (FPA), and Ant Colony Optimization (ACO) feature-selection techniques. We successfully constructed different models with a remarkable detection accuracy of over 98.8% (approximately 99.0%) with Ant Colony Optimization (ACO), an accuracy of 98.7% with the Flower Pollination Algorithm (FPA), and an accuracy of 98.6% with the Artificial Bee Colony (ABC). Another achievement of this study is the minimum model building time achieved in intrusion detection, which was equal to 1 s using the Flower Pollination Algorithm (FPA), 2 s using the Artificial Bee Colony (ABC), and 3 s using Ant Colony Optimization (ACO). Our research leverages the comprehensive and up-to-date CSE-CIC-IDS2018 dataset and uses the preprocessing Discretize technique to discretize data. Furthermore, our research provides valuable recommendations to network administrators, aiding them in selecting appropriate machine learning algorithms tailored to specific requirements. Full article
(This article belongs to the Special Issue Risk and Protection for Machine Learning-Based Network Intrusion)
Show Figures

Figure 1

37 pages, 1716 KB  
Article
Optimum Scheduling of a Multi-Machine Flexible Manufacturing System Considering Job and Tool Transfer Times without Tool Delay
by Sunil Prayagi, Padma Lalitha Mareddy, Lakshmi Narasimhamu Katta and Sivarami Reddy Narapureddy
Mathematics 2023, 11(19), 4190; https://doi.org/10.3390/math11194190 - 7 Oct 2023
Cited by 4 | Viewed by 2530
Abstract
In order to minimize makespan (Cmax) without causing tool delay with the fewest copies of each tool type, this study investigates the concurrent scheduling of automated guided vehicles (AGVs), machines (MCs), tool transporter (TT), and tools in a multi-machine flexible manufacturing [...] Read more.
In order to minimize makespan (Cmax) without causing tool delay with the fewest copies of each tool type, this study investigates the concurrent scheduling of automated guided vehicles (AGVs), machines (MCs), tool transporter (TT), and tools in a multi-machine flexible manufacturing system (FMS). The tools are housed in a central tool magazine (CTM), accessible to and utilized by several machines. AGVs and the tool transporter (TT) move jobs and tools between machines. Since it involves allocating tool copies and AGVs to job operations, sequencing job operations on machines, and related trip operations, such as AGVs’ and TT’s empty trip and loaded trip times, this simultaneous scheduling problem is highly complicated. This issue is resolved using the symbiotic organisms search algorithm (SOSA), based on the symbiotic interaction strategies that organisms adapt to survive in the ecosystem. This study proposes a mixed nonlinear integer programming formulation to address this problem. Verification is performed using an industrial problem from a manufacturing organization. The results show that employing two copies for two tool types out of 22 tool kinds and one copy for the remaining tool types results in no tool delay, which causes a reduction in the Cmax as well as cost. The industries that can benefit directly from this study are consumer electronics manufacturers, original equipment manufacturers, automobile manufacturers, and textile machine producers. The results demonstrate that the SOSA provides promising results compared to the flower pollination algorithm (FPA). Full article
Show Figures

Figure 1

30 pages, 58440 KB  
Article
Multilevel Threshold Segmentation of Skin Lesions in Color Images Using Coronavirus Optimization Algorithm
by Yousef S. Alsahafi, Doaa S. Elshora, Ehab R. Mohamed and Khalid M. Hosny
Diagnostics 2023, 13(18), 2958; https://doi.org/10.3390/diagnostics13182958 - 15 Sep 2023
Cited by 15 | Viewed by 2863
Abstract
Skin Cancer (SC) is among the most hazardous due to its high mortality rate. Therefore, early detection of this disease would be very helpful in the treatment process. Multilevel Thresholding (MLT) is widely used for extracting regions of interest from medical images. Therefore, [...] Read more.
Skin Cancer (SC) is among the most hazardous due to its high mortality rate. Therefore, early detection of this disease would be very helpful in the treatment process. Multilevel Thresholding (MLT) is widely used for extracting regions of interest from medical images. Therefore, this paper utilizes the recent Coronavirus Disease Optimization Algorithm (COVIDOA) to address the MLT issue of SC images utilizing the hybridization of Otsu, Kapur, and Tsallis as fitness functions. Various SC images are utilized to validate the performance of the proposed algorithm. The proposed algorithm is compared to the following five meta-heuristic algorithms: Arithmetic Optimization Algorithm (AOA), Sine Cosine Algorithm (SCA), Reptile Search Algorithm (RSA), Flower Pollination Algorithm (FPA), Seagull Optimization Algorithm (SOA), and Artificial Gorilla Troops Optimizer (GTO) to prove its superiority. The performance of all algorithms is evaluated using a variety of measures, such as Mean Square Error (MSE), Peak Signal-To-Noise Ratio (PSNR), Feature Similarity Index Metric (FSIM), and Normalized Correlation Coefficient (NCC). The results of the experiments prove that the proposed algorithm surpasses several competing algorithms in terms of MSE, PSNR, FSIM, and NCC segmentation metrics and successfully solves the segmentation issue. Full article
Show Figures

Figure 1

17 pages, 8638 KB  
Article
Research on the Clothing Classification of the She Ethnic Group in Different Regions Based on FPA-CNN
by Xiaojun Ding, Tao Li, Jingyu Chen, Ling Ma and Fengyuan Zou
Appl. Sci. 2023, 13(17), 9676; https://doi.org/10.3390/app13179676 - 27 Aug 2023
Cited by 5 | Viewed by 3080
Abstract
In order to achieve the effective computer recognition of the She ethnic clothing from different regions through the extraction of color features, this paper proposes a She ethnic clothing classification method based on the Flower Pollination Algorithm-optimized color feature fusion and Convolutional Neural [...] Read more.
In order to achieve the effective computer recognition of the She ethnic clothing from different regions through the extraction of color features, this paper proposes a She ethnic clothing classification method based on the Flower Pollination Algorithm-optimized color feature fusion and Convolutional Neural Network (FPA-CNN). The method consists of three main steps: color feature fusion, FPA optimization, and CNN classification. In the first step, a color histogram and color moment features, which can represent regional differences in She ethnic clothing, are extracted. Subsequently, FPA is used to perform optimal weight fusion, obtaining an optimized ratio. Kernel principal component analysis is then applied to reduce the dimensionality of the fused features, and a CNN is constructed to classify the She ethnic clothing from different regions based on the reduced fused features. The results show that the FPA-CNN method can effectively classify the She ethnic clothing from different regions, achieving an average classification accuracy of 98.38%. Compared to SVM, BP, RNN, and RBF models, the proposed method improves the accuracy by 11.49%, 7.7%, 6.49%, and 3.92%, respectively. This research provides a reference and guidance for the effective recognition of clothing through the extraction of color features. Full article
Show Figures

Figure 1

25 pages, 5302 KB  
Article
Monthly Runoff Forecasting Using Particle Swarm Optimization Coupled with Flower Pollination Algorithm-Based Deep Belief Networks: A Case Study in the Yalong River Basin
by Zhaoxin Yue, Huaizhi Liu and Hui Zhou
Water 2023, 15(15), 2704; https://doi.org/10.3390/w15152704 - 27 Jul 2023
Cited by 12 | Viewed by 2032
Abstract
Accuracy in monthly runoff forecasting is of great significance in the full utilization of flood and drought control and of water resources. Data-driven models have been proposed to improve monthly runoff forecasting in recent years. To effectively promote the prediction effect of monthly [...] Read more.
Accuracy in monthly runoff forecasting is of great significance in the full utilization of flood and drought control and of water resources. Data-driven models have been proposed to improve monthly runoff forecasting in recent years. To effectively promote the prediction effect of monthly runoff, a novel hybrid data-driven model using particle swarm optimization coupled with flower pollination algorithm-based deep belief networks (PSO-FPA-DBNs) was proposed, which selected the optimal network depth via PSO and searched for the optimum hyper parameters (the number of neurons in the hidden layer and the learning rate of the RBMs) in the DBN using FPA. The methodology was divided into three steps: (i) the Comprehensive Basin Response (COM) was constructed and calculated to characterize the hydrological state of the basin, (ii) the information entropy algorithm was adopted to select the key factors, and (iii) the novel model was proposed for monthly runoff forecasting. We systematically compared the PSO-FPA-DBN model with the traditional prediction models (i.e., the backpropagation neural network (BPNN), support vector machines (SVM), deep belief networks (DBN)), and other improved models (DBN-PLSR, PSO-GA-DBN, and PSO-ACO-DBN) for monthly runoff forecasting by using an original dataset. Experimental results demonstrated that our PSO-FPA-DBN model outperformed the peer models, with a mean absolute percentage error (MAPE) of 18.23%, root mean squared error (RMSE) of 230.45 m3/s, coefficient of determination (DC) of 0.9389, and qualified rate (QR) of 64.2% for the data from the Yalong River Basin. Also, the stability of our PSO-FPA-DBN model was evaluated. The proposed model might adapt effectively to the nonlinear characteristics of monthly runoff forecasting; therefore, it could obtain accurate and reliable runoff forecasting results. Full article
Show Figures

Figure 1

24 pages, 950 KB  
Article
Supply Chain Scheduling Method for the Coordination of Agile Production and Port Delivery Operation
by Xiaoyu Yu, Jingyi Qian, Yajing Zhang and Min Kong
Mathematics 2023, 11(15), 3276; https://doi.org/10.3390/math11153276 - 26 Jul 2023
Cited by 5 | Viewed by 3006
Abstract
The cost-reducing potential of intelligent supply chains (ISCs) has been recognized by companies and researchers. This paper investigates a two-echelon steel supply chain scheduling problem that considers the parallel-batching processing and deterioration effect in the production stage and sufficient vehicles in the port [...] Read more.
The cost-reducing potential of intelligent supply chains (ISCs) has been recognized by companies and researchers. This paper investigates a two-echelon steel supply chain scheduling problem that considers the parallel-batching processing and deterioration effect in the production stage and sufficient vehicles in the port delivery stage. To solve this problem, we first analyze several sufficient and necessary conditions of the optimal scheme. We then propose a heuristic algorithm based on a dynamic programming algorithm to obtain the optimal solution for a special case where the assignment of all ingots to the soaking pits is known. Based on the results of this special case, we develop a modified biased random-key genetic algorithm (BRKGA), which incorporates genetic operations based on the flower pollination algorithm (FPA) to obtain joint production and distribution schedules for the general problem. Finally, we conduct a series of computational experiments, the results of which indicate that BRKGA-FPA has certain advantages in solving quality and convergence speed issues. Full article
(This article belongs to the Special Issue Data-Driven Decision Making: Models, Methods and Applications)
Show Figures

Figure 1

18 pages, 742 KB  
Article
An Enhanced Flower Pollination Algorithm with Gaussian Perturbation for Node Location of a WSN
by Jun Zheng, Ting Yuan, Wenwu Xie, Zhihe Yang and Dan Yu
Sensors 2023, 23(14), 6463; https://doi.org/10.3390/s23146463 - 17 Jul 2023
Cited by 11 | Viewed by 2263
Abstract
Localization is one of the essential problems in internet of things (IoT) and wireless sensor network (WSN) applications. However, most traditional range-free localization algorithms cannot fulfill the practical demand for high localization accuracy. Therefore, a localization algorithm based on an enhanced flower pollination [...] Read more.
Localization is one of the essential problems in internet of things (IoT) and wireless sensor network (WSN) applications. However, most traditional range-free localization algorithms cannot fulfill the practical demand for high localization accuracy. Therefore, a localization algorithm based on an enhanced flower pollination algorithm (FPA) with Gaussian perturbation (EFPA-G) and the DV-Hop method is proposed.FPA is widely applied, but premature convergence still cannot be avoided. How to balance its global exploration and local exploitation capabilities still remains an outstanding problem. Therefore, the following improvement schemes are introduced. A search strategy based on Gaussian perturbation is proposed to solve the imbalance between the global exploration and local exploitation search capabilities. Meanwhile, to fully exploit the variability of population information, an enhanced strategy is proposed based on optimal individual and Lévy flight. Finally, in the experiments with 26 benchmark functions and WSN simulations, the former verifies that the proposed algorithm outperforms other state-of-the-art algorithms in terms of convergence and search capability. In the simulation experiment, the best value for the normalized mean squared error obtained by the most advanced algorithm, RACS, is 20.2650%, and the best value for the mean distance error is 5.07E+00. However, EFPA-G reached 19.5182% and 4.88E+00, respectively. It is superior to existing algorithms in terms of positioning, accuracy, and robustness. Full article
(This article belongs to the Section Sensor Networks)
Show Figures

Figure 1

25 pages, 2257 KB  
Article
A New Parallel Cuckoo Flower Search Algorithm for Training Multi-Layer Perceptron
by Rohit Salgotra, Nitin Mittal and Vikas Mittal
Mathematics 2023, 11(14), 3080; https://doi.org/10.3390/math11143080 - 12 Jul 2023
Cited by 5 | Viewed by 2016
Abstract
This paper introduces a parallel meta-heuristic algorithm called Cuckoo Flower Search (CFS). This algorithm combines the Flower Pollination Algorithm (FPA) and Cuckoo Search (CS) to train Multi-Layer Perceptron (MLP) models. The algorithm is evaluated on standard benchmark problems and its competitiveness is demonstrated [...] Read more.
This paper introduces a parallel meta-heuristic algorithm called Cuckoo Flower Search (CFS). This algorithm combines the Flower Pollination Algorithm (FPA) and Cuckoo Search (CS) to train Multi-Layer Perceptron (MLP) models. The algorithm is evaluated on standard benchmark problems and its competitiveness is demonstrated against other state-of-the-art algorithms. Multiple datasets are utilized to assess the performance of CFS for MLP training. The experimental results are compared with various algorithms such as Genetic Algorithm (GA), Grey Wolf Optimization (GWO), Particle Swarm Optimization (PSO), Evolutionary Search (ES), Ant Colony Optimization (ACO), and Population-based Incremental Learning (PBIL). Statistical tests are conducted to validate the superiority of the CFS algorithm in finding global optimum solutions. The results indicate that CFS achieves significantly better outcomes with a higher convergence rate when compared to the other algorithms tested. This highlights the effectiveness of CFS in solving MLP optimization problems and its potential as a competitive algorithm in the field. Full article
(This article belongs to the Special Issue Biologically Inspired Computing, 2nd Edition)
Show Figures

Figure 1

17 pages, 10680 KB  
Article
Optimizing Solution in Decision Supporting System for River Basin Management Consisting of a Reservoir System
by Ratsuda Ngamsert, Rapeepat Techarungruengsakul, Siwa Kaewplang, Rattana Hormwichian, Haris Prasanchum, Ounla Sivanpheng and Anongrit Kangrang
Water 2023, 15(14), 2510; https://doi.org/10.3390/w15142510 - 9 Jul 2023
Cited by 11 | Viewed by 2945
Abstract
Decision support systems tackle problems and require systematic planning. They consider physical data, hydrological data, and sediment levels to achieve efficiency and adaptability in various situations. Therefore, this research aims to identify alternative engineering choices for the management of a river basin with [...] Read more.
Decision support systems tackle problems and require systematic planning. They consider physical data, hydrological data, and sediment levels to achieve efficiency and adaptability in various situations. Therefore, this research aims to identify alternative engineering choices for the management of a river basin with a single reservoir system. Optimization techniques, including marine predator algorithm (MPA), genetic algorithm (GA), genetic programming (GP), tabu search (TS), and flower pollination algorithm (FPA), were applied to find the optimal reservoir rule curves using a reservoir simulation model. The study focused on the Ubolratana Reservoir in Thailand’s Khon Kaen Province, considering historic inflow data, water demand, hydrologic and physical data, and sedimentation volume. Four scenarios were considered: normal water scarcity, high water scarcity, normal excess water, and high excess water. The optimal rule curves derived from the reservoir simulation model, incorporating sedimentation and hedging rule (HR) criteria, were found to be the best engineering choices. In the normal and high water scarcity scenarios, they minimized the average water shortage to 95.558 MCM/year, with the lowest maximum water shortage 693.000 MCM/year. Similarly, in the normal and high excess water scenarios, the optimal rule curves minimized the average excess water, resulting in a minimum overflow of 1087.810 MCM/year and the lowest maximum overflow 4105.660 MCM/year. These findings highlight the effectiveness of integrating optimization techniques and a reservoir simulation model to obtain the optimal rule curves. By considering sedimentation and incorporating HR criteria, the selected engineering alternatives demonstrated their ability to minimize water shortage and excess water. This contributes to improved water resource management and decision-making in situations of scarcity and excess. Full article
(This article belongs to the Section Water Resources Management, Policy and Governance)
Show Figures

Figure 1

Back to TopTop