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 (28)

Search Parameters:
Keywords = E-Jaya

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
21 pages, 973 KB  
Article
Forecasting Electronic Waste Using a Jaya-Optimized Discrete Trigonometric Grey Model
by Zeynep Ozsut Bogar, Gazi Murat Duman, Askiner Gungor and Elif Kongar
Sustainability 2025, 17(22), 10073; https://doi.org/10.3390/su172210073 - 11 Nov 2025
Viewed by 415
Abstract
The growing use of electrical and electronic appliances, coupled with shorter product lifespans, has accelerated the rise in waste electrical and electronic equipment (WEEE). Accurate forecasting is essential for addressing environmental challenges, conserving resources, and advancing the circular economy (CE). This research employs [...] Read more.
The growing use of electrical and electronic appliances, coupled with shorter product lifespans, has accelerated the rise in waste electrical and electronic equipment (WEEE). Accurate forecasting is essential for addressing environmental challenges, conserving resources, and advancing the circular economy (CE). This research employs a Trigonometry-Based Discrete Grey Model (TBDGM(1,1)) that integrates the Jaya algorithm and Least Squares Estimation (LSE) for parameter estimation. By leveraging Jaya’s parameter-free robustness and LSE’s computational efficiency, the model enhances prediction accuracy for small-sample and nonlinear datasets. WEEE data from Washington State (WA) in the USA and Türkiye are utilized to validate the model, demonstrating cross-context adaptability. To evaluate performance, the model is benchmarked against five state-of-the-art discrete grey models. For the WA dataset, additional benchmarking against methods used in prior e-waste forecasting literature enables a dual-layer comparative analysis, which strengthens the validity and practical relevance of the approach. Across evaluations and multiple performance metrics, TBDGM(1,1) attains satisfactory and competitive prediction performance on the WA and Türkiye datasets relative to comparator models. Using TBDGM(1,1), Türkiye’s e-waste is forecast for 2021–2030, with the 2030 amount projected at approximately 489 kilotones. The findings provide valuable insights for policymakers and researchers, offering a standardized and reliable forecasting tool that supports CE-driven strategies in e-waste management. Full article
(This article belongs to the Section Waste and Recycling)
Show Figures

Figure 1

26 pages, 1823 KB  
Article
Scalable Gender Profiling from Turkish Texts Using Deep Embeddings and Meta-Heuristic Feature Selection
by Hakan Gunduz
J. Theor. Appl. Electron. Commer. Res. 2025, 20(4), 253; https://doi.org/10.3390/jtaer20040253 - 24 Sep 2025
Viewed by 690
Abstract
Accurate gender identification from written text is critical for author profiling, recommendation systems, and demographic analytics in digital ecosystems. This study introduces a scalable framework for gender classification in Turkish, combining contextualized BERTurk and subword-aware FastText embeddings with three meta-heuristic feature selection algorithms: [...] Read more.
Accurate gender identification from written text is critical for author profiling, recommendation systems, and demographic analytics in digital ecosystems. This study introduces a scalable framework for gender classification in Turkish, combining contextualized BERTurk and subword-aware FastText embeddings with three meta-heuristic feature selection algorithms: Genetic Algorithm (GA), Jaya and Artificial Rabbit Optimization (ARO). Evaluated on the IAG-TNKU corpus of 43,292 balanced Turkish news articles, the best-performing model—BERTurk+GA+LSTM—achieves 89.7% accuracy, while ARO reduces feature dimensionality by 90% with minimal performance loss. Beyond in-domain results, exploratory zero-shot and few-shot adaptation experiments on Turkish e-commerce product reviews demonstrate the framework’s transferability: while zero-shot performance dropped to 59.8%, few-shot adaptation with only 200–400 labeled samples raised accuracy to 69.6–72.3%. These findings highlight both the limitations of training exclusively on news articles and the practical feasibility of adapting the framework to consumer-generated content with minimal supervision. In addition to technical outcomes, we critically examine ethical considerations in gender inference, including fairness, representation, and the binary nature of current datasets. This work contributes a reproducible and linguistically informed baseline for gender profiling in morphologically rich, low-resource languages, with demonstrated potential for adaptation across domains such as social media and e-commerce personalization. Full article
(This article belongs to the Special Issue Human–Technology Synergies in AI-Driven E-Commerce Environments)
Show Figures

Figure 1

16 pages, 535 KB  
Article
Solving Construction Site Layout Planning as a Quadratic Assignment Problem Using the Advanced Jaya Algorithm
by Gülçağ Albayrak
Appl. Sci. 2025, 15(18), 10295; https://doi.org/10.3390/app151810295 - 22 Sep 2025
Viewed by 730
Abstract
Construction site layout planning (CSLP) plays a pivotal role in determining the overall efficiency and cost-effectiveness of construction projects. Material handling operations, which constitute a significant portion of indirect project costs, heavily depend on the spatial arrangement of temporary facilities such as site [...] Read more.
Construction site layout planning (CSLP) plays a pivotal role in determining the overall efficiency and cost-effectiveness of construction projects. Material handling operations, which constitute a significant portion of indirect project costs, heavily depend on the spatial arrangement of temporary facilities such as site offices, storage yards, and equipment zones. Poorly planned layouts can lead to excessive travel distances, increased material handling times, and operational delays, all of which contribute to inflated costs and reduced productivity. Therefore, optimizing the layout of construction sites to minimize transportation distances and enhance workflow is a critical task for project managers, contractors, and other stakeholders. The challenge in CSLP lies in the complexity of simultaneously satisfying multiple, often conflicting, requirements such as space constraints, safety regulations, and functional proximities. This complexity is compounded by the dynamic nature of construction activities and the presence of numerous facilities to be allocated within limited and irregularly shaped site boundaries. Mathematically, this problem can be formulated as a Quadratic Assignment Problem (QAP), a well-known NP-hard combinatorial optimization problem. The QAP seeks to assign a set of facilities to specific locations in a manner that minimizes the total cost, typically modeled as the sum of products of flows (e.g., material movement) and distances between assigned locations. However, due to the computational complexity of QAP, exact solutions become impractical for medium to large-scale site layouts. In recent years, metaheuristic algorithms have gained traction for effectively tackling such complex optimization problems. Among these, the Advanced Jaya Algorithm (A-JA), a recent population-based metaheuristic, stands out for its simplicity, parameter-free nature, and robust search capabilities. This study applies the A-JA to solve the CSLP modeled as a QAP, aiming to minimize the total weighted travel distance of material handling within the site. The algorithm’s performance is validated through two realistic case studies, showcasing its strong search capabilities and competitive results compared to traditional optimization methods. This promising approach offers a valuable decision-support tool for construction managers seeking to enhance site operational efficiency. Full article
Show Figures

Figure 1

30 pages, 1596 KB  
Article
Network-Aware Smart Scheduling for Semi-Automated Ceramic Production via Improved Discrete Hippopotamus Optimization
by Qi Zhang, Changtian Zhang, Man Yao, Xiwang Guo, Shujin Qin, Haibin Zhu, Liang Qi and Bin Hu
Electronics 2025, 14(17), 3543; https://doi.org/10.3390/electronics14173543 - 5 Sep 2025
Viewed by 640
Abstract
The increasing integration of automation and intelligent sensing technologies in daily-use ceramic manufacturing poses new challenges for efficient scheduling under hybrid flow-shop and shared-kiln constraints. To address these challenges, this study proposes a Mixed-Integer Linear Programming (MILP) model and an Improved Discrete Hippopotamus [...] Read more.
The increasing integration of automation and intelligent sensing technologies in daily-use ceramic manufacturing poses new challenges for efficient scheduling under hybrid flow-shop and shared-kiln constraints. To address these challenges, this study proposes a Mixed-Integer Linear Programming (MILP) model and an Improved Discrete Hippopotamus Optimization (IDHO) algorithm designed for smart, network-aware production environments. The MILP formulation captures key practical features such as batch processing, no-idle kiln constraints, and machine re-entry dynamics. The IDHO algorithm enhances global search performance via segment-based encoding, nonlinear population reduction, and operation-specific mutation strategies, while a parallel evaluation framework accelerates computational efficiency, making the solution viable for industrial-scale, time-sensitive scenarios. The experimental results from 12 benchmark cases demonstrate that IDHO achieves superior performance over six representative metaheuristics (e.g., PSO, GWO, Jaya, DBO), with an average ARPD of 1.04%, statistically significant improvements (p < 0.05), and large effect sizes (Cohen’s d > 0.8). Compared to the commercial solver CPLEX, IDHO provides near-optimal results with substantially lower runtime. The proposed approach contributes to the development of intelligent networked scheduling systems for cyber-physical manufacturing environments, enabling responsive, scalable, and data-driven optimization in smart sensing-enabled production settings. Full article
(This article belongs to the Section Networks)
Show Figures

Figure 1

31 pages, 3958 KB  
Article
Optimal Distributed Generation Mix to Enhance Distribution Network Performance: A Deterministic Approach
by Muhammad Ibrahim Bhatti, Frank Fischer, Matthias Kühnbach, Zohaib Hussain Leghari, Touqeer Ahmed Jumani, Zeeshan Anjum Memon and Muhammad I. Masud
Sustainability 2025, 17(13), 5978; https://doi.org/10.3390/su17135978 - 29 Jun 2025
Viewed by 673
Abstract
Distribution systems’ vulnerability to power losses remains high, among other parts of the power system, due to the high currents and lower voltage ratio. Connecting distributed generation (DG) units can reduce power loss and improve the overall performance of the distribution networks if [...] Read more.
Distribution systems’ vulnerability to power losses remains high, among other parts of the power system, due to the high currents and lower voltage ratio. Connecting distributed generation (DG) units can reduce power loss and improve the overall performance of the distribution networks if sized and located correctly. However, existing studies have usually assumed that DGs operate only at the unity power factor (i.e., type-I DGs) and ignored their dynamic capability to control reactive power, which is unrealistic when optimizing DG allocation in power distribution networks. In contrast, optimizing the allocation of DG units injecting reactive power (type-II), injecting both active and reactive powers (type-III), and injecting active power and dynamically adjusting (absorbing or injecting) reactive power (type-IV) is a more likely approach, which remains unexplored in the current literature. Additionally, various metaheuristic optimization techniques are employed in the literature to optimally allocate DGs in distribution networks. However, the no-free-lunch theorem emphasizes employing novel optimization approaches, as no method is best for all optimization problems. This study demonstrates the potential of optimally allocating different DG types simultaneously to improve power distribution network performance using a parameter-free Jaya optimization technique. The primary objective of optimally allocating DG units is minimizing the distribution network’s power losses. The simulation validation of this study is conducted using the IEEE 33-bus test system. The results revealed that optimally allocating a multiunit DG mix instead of a single DG type significantly reduces power losses. The highest reduction of 96.14% in active power loss was obtained by placing three type-II, two type-III, and three type-IV units simultaneously. In contrast, the minimum loss reduction of 87.26% was observed by jointly allocating one unit of the aforementioned three DG types. Full article
Show Figures

Figure 1

68 pages, 5954 KB  
Article
Mechanical and Civil Engineering Optimization with a Very Simple Hybrid Grey Wolf—JAYA Metaheuristic Optimizer
by Chiara Furio, Luciano Lamberti and Catalin I. Pruncu
Mathematics 2024, 12(22), 3464; https://doi.org/10.3390/math12223464 - 6 Nov 2024
Cited by 4 | Viewed by 2426
Abstract
Metaheuristic algorithms (MAs) now are the standard in engineering optimization. Progress in computing power has favored the development of new MAs and improved versions of existing methods and hybrid MAs. However, most MAs (especially hybrid algorithms) have very complicated formulations. The present study [...] Read more.
Metaheuristic algorithms (MAs) now are the standard in engineering optimization. Progress in computing power has favored the development of new MAs and improved versions of existing methods and hybrid MAs. However, most MAs (especially hybrid algorithms) have very complicated formulations. The present study demonstrated that it is possible to build a very simple hybrid metaheuristic algorithm combining basic versions of classical MAs, and including very simple modifications in the optimization formulation to maximize computational efficiency. The very simple hybrid metaheuristic algorithm (SHGWJA) developed here combines two classical optimization methods, namely the grey wolf optimizer (GWO) and JAYA, that are widely used in engineering problems and continue to attract the attention of the scientific community. SHGWJA overcame the limitations of GWO and JAYA in the exploitation phase using simple elitist strategies. The proposed SHGWJA was tested very successfully in seven “real-world” engineering optimization problems taken from various fields, such as civil engineering, aeronautical engineering, mechanical engineering (included in the CEC 2020 test suite on real-world constrained optimization problems) and robotics; these problems include up to 14 optimization variables and 721 nonlinear constraints. Two representative mathematical optimization problems (i.e., Rosenbrock and Rastrigin functions) including up to 1000 variables were also solved. Remarkably, SHGWJA always outperformed or was very competitive with other state-of-the-art MAs, including CEC competition winners and high-performance methods in all test cases. In fact, SHGWJA always found the global optimum or a best cost at most 0.0121% larger than the target optimum. Furthermore, SHGWJA was very robust: (i) in most cases, SHGWJA obtained a 0 or near-0 standard deviation and all optimization runs practically converged to the target optimum solution; (ii) standard deviation on optimized cost was at most 0.0876% of the best design; (iii) the standard deviation on function evaluations was at most 35% of the average computational cost. Last, SHGWJA always ranked 1st or 2nd for average computational speed and its fastest optimization runs outperformed or were highly competitive with their counterpart recorded for the best MAs. Full article
(This article belongs to the Special Issue Mathematical Applications in Mechanical and Civil Engineering)
Show Figures

Figure 1

21 pages, 4088 KB  
Article
Analysis of War Optimization Algorithm in a Multi-Loop Power System Based on Directional Overcurrent Relays
by Bakht Muhammad Khan, Abdul Wadood, Shahbaz Khan, Husan Ali, Tahir Khurshaid, Asim Iqbal and Ki Chai Kim
Energies 2024, 17(22), 5542; https://doi.org/10.3390/en17225542 - 6 Nov 2024
Cited by 2 | Viewed by 1317
Abstract
In electrical power systems, ensuring a reliable, precise, and efficient relay strategy is crucial for safe and trustworthy operation, especially in multi-loop distribution systems. Overcurrent relays (OCRs) have emerged as effective solutions for these challenges. This study focuses on optimizing the coordination of [...] Read more.
In electrical power systems, ensuring a reliable, precise, and efficient relay strategy is crucial for safe and trustworthy operation, especially in multi-loop distribution systems. Overcurrent relays (OCRs) have emerged as effective solutions for these challenges. This study focuses on optimizing the coordination of OCRs to minimize the overall operational time of main relays, thereby reducing power outages. The optimization problem is addressed by adjusting the time multiplier setting (TMS) using the War Strategy Optimization (WSO) algorithm, which efficiently solves this constrained problem. This algorithm mimics ancient warfare strategies of attack and defense to solve complex optimization problems efficiently. The results show that WSO provides superior performance in minimizing total operating time and achieving global optimum solutions with reduced computational effort, outperforming traditional optimization methods (i.e., SM, HPSO, GA, RTO, and JAYA). The proposed algorithm shows a net time gains of 7.77 s, 2.57 s, and 0.8484 s when compared to GA, RTO, and JAYA respectively. This robust protection coordination ensures better reliability and efficiency in multi-loop power systems. Full article
Show Figures

Figure 1

26 pages, 3654 KB  
Article
An Innovative Enhanced JAYA Algorithm for the Optimization of Continuous and Discrete Problems
by Jalal Jabbar Bairooz and Farhad Mardukhi
Algorithms 2024, 17(11), 472; https://doi.org/10.3390/a17110472 - 22 Oct 2024
Cited by 2 | Viewed by 2129
Abstract
Metaheuristic algorithms have gained popularity in the past decade due to their remarkable ability to address various optimization challenges. Among these, the JAYA algorithm has emerged as a recent contender that demonstrates strong performance across different optimization problems, largely attributed to its simplicity. [...] Read more.
Metaheuristic algorithms have gained popularity in the past decade due to their remarkable ability to address various optimization challenges. Among these, the JAYA algorithm has emerged as a recent contender that demonstrates strong performance across different optimization problems, largely attributed to its simplicity. However, real-world problems have become increasingly complex in today’s era, creating a demand for more robust and effective solutions to tackle these intricate challenges and achieve outstanding results. This article proposes an enhanced JAYA (EJAYA) method that addresses its inherent shortcomings, resulting in improved convergence and search capabilities when dealing with diverse problems. The current study evaluates the performance of the proposed optimization methods on both continuous and discontinuous problems. Initially, EJAYA is applied to solve 20 prominent test functions and is validated by comparison with other contemporary algorithms in the literature, including moth–flame optimization, particle swarm optimization, the dragonfly algorithm, and the sine–cosine algorithm. The effectiveness of the proposed approach in discrete scenarios is tested using feature selection and compared to existing optimization strategies. Evaluations across various scenarios demonstrate that the proposed enhancements significantly improve the JAYA algorithm’s performance, facilitating escape from local minima, achieving faster convergence, and expanding the search capabilities. Full article
(This article belongs to the Section Analysis of Algorithms and Complexity Theory)
Show Figures

Figure 1

42 pages, 7686 KB  
Article
Parallel GPU-Acceleration of Metaphorless Optimization Algorithms: Application for Solving Large-Scale Nonlinear Equation Systems
by Bruno Silva, Luiz Guerreiro Lopes and Fábio Mendonça
Appl. Sci. 2024, 14(12), 5349; https://doi.org/10.3390/app14125349 - 20 Jun 2024
Cited by 2 | Viewed by 2177
Abstract
Traditional population-based metaheuristic algorithms are effective in solving complex real-world problems but require careful strategy selection and parameter tuning. Metaphorless population-based optimization algorithms have gained importance due to their simplicity and efficiency. However, research on their applicability for solving large systems of nonlinear [...] Read more.
Traditional population-based metaheuristic algorithms are effective in solving complex real-world problems but require careful strategy selection and parameter tuning. Metaphorless population-based optimization algorithms have gained importance due to their simplicity and efficiency. However, research on their applicability for solving large systems of nonlinear equations is still incipient. This paper presents a review and detailed description of the main metaphorless optimization algorithms, including the Jaya and enhanced Jaya (EJAYA) algorithms, the three Rao algorithms, the best-worst-play (BWP) algorithm, and the new max–min greedy interaction (MaGI) algorithm. This article presents improved GPU-based massively parallel versions of these algorithms using a more efficient parallelization strategy. In particular, a novel GPU-accelerated implementation of the MaGI algorithm is proposed. The GPU-accelerated versions of the metaphorless algorithms developed were implemented using the Julia programming language. Both high-end professional-grade GPUs and a powerful consumer-oriented GPU were used for testing, along with a set of hard, large-scale nonlinear equation system problems to gauge the speedup gains from the parallelizations. The computational experiments produced substantial speedup gains, ranging from 33.9× to 561.8×, depending on the test parameters and the GPU used for testing. This highlights the efficiency of the proposed GPU-accelerated versions of the metaphorless algorithms considered. Full article
Show Figures

Figure 1

14 pages, 1368 KB  
Article
“A Safe Space for Sharing Feelings”: Perspectives of Children with Lived Experiences of Anxiety on Social Robots
by Jill A. Dosso, Jaya N. Kailley, Susanna E. Martin and Julie M. Robillard
Multimodal Technol. Interact. 2023, 7(12), 118; https://doi.org/10.3390/mti7120118 - 15 Dec 2023
Cited by 7 | Viewed by 4761
Abstract
Social robots have the potential to support health and quality of life for children experiencing anxiety. We engaged families with lived experiences of pediatric anxiety in social robot development to explore desired design features, application areas, and emotion functionalities of social robots in [...] Read more.
Social robots have the potential to support health and quality of life for children experiencing anxiety. We engaged families with lived experiences of pediatric anxiety in social robot development to explore desired design features, application areas, and emotion functionalities of social robots in anxiety care. We conducted 10 online co-creation workshops with (1) children with anxiety aged 7–13 (n = 24) with their family members (n = 20), and (2) youth with anxiety aged 14–18 (n = 12). Workshop participation included a validated robot expectations scale, anonymous polls, and discussion. Transcripts and text responses were subjected to content analysis. A lived experience expert group provided feedback throughout the research. Participants desired a pet-like robot with a soft texture, expressive eyes, and emotion detection to support activities of daily living. Specific anxiety-related applications included breathing exercises, managing distressing thoughts, and encouragement. Emotional alignment, the design of a robot’s emotional display, and the emotional impacts of an interaction were discussed. Privacy and the replacement of human interaction were concerns. We identify pediatric anxiety-specific design features, applications, and affective considerations for existing and future social robots. Our findings highlight the need for customizability and robust emotional functionality in social robot technologies intended to support the health and care of children living with anxiety. Full article
(This article belongs to the Special Issue Intricacies of Child–Robot Interaction - 2nd Edition)
Show Figures

Figure 1

24 pages, 4927 KB  
Article
A New Optimized FOPIDA-FOIDN Controller for the Frequency Regulation of Hybrid Multi-Area Interconnected Microgrids
by Nessma M. Ahmed, Mohamed Ebeed, Gaber Magdy, Khairy Sayed, Samia Chehbi Gamoura, Ahmed Sayed M. Metwally and Alaa A. Mahmoud
Fractal Fract. 2023, 7(9), 666; https://doi.org/10.3390/fractalfract7090666 - 4 Sep 2023
Cited by 16 | Viewed by 2175
Abstract
This paper proposes a combined feedback and feed-forward control system to support the frequency regulation of multi-area interconnected hybrid microgrids considering renewable energy sources (RESs). The proposed control system is based on a fractional-order proportional-integral-derivative-accelerated (FOPIDA) controller in the feed-forward direction and a [...] Read more.
This paper proposes a combined feedback and feed-forward control system to support the frequency regulation of multi-area interconnected hybrid microgrids considering renewable energy sources (RESs). The proposed control system is based on a fractional-order proportional-integral-derivative-accelerated (FOPIDA) controller in the feed-forward direction and a fractional-order integral-derivative with a low-pass filter compensator (FOIDN) controller in the feedback direction, referred to as a FOPIDA-FOIDN controller. Moreover, the parameters of the proposed FOPIDA-FOIDN controller (i.e., twelve parameters in each area) are optimally tuned using a proposed hybrid of two metaheuristic optimization algorithms, i.e., hybrid artificial gorilla troops optimizer (AGTO) and equilibrium optimizer (EO), and this hybrid is referred to as HGTOEO. The robustness and reliability of the proposed control system are validated by evaluating its performance in comparison to that of other counterparts’ controllers utilized in the literature, such as PID, FOPID, and tilt integral derivative (TID) controller, under the different operating conditions of the studied system. Furthermore, the proficiency of the proposed HGTOEO algorithm is checked against other powerful optimizers, such as the genetic algorithm, Jaya algorithm, improved Jaya algorithm, multi-verse optimizer, and cost-effective multi-verse optimizer, to optimally design the PID controller for the load frequency control of the studied two-area interconnected microgrid. The MATLAB simulation results demonstrate the viability and dependability of the proposed FOPIDA-FOIDN controller based on the HGTOEO algorithm under a variety of load perturbations and random production of RESs. Full article
Show Figures

Figure 1

29 pages, 2115 KB  
Systematic Review
Machine Learning-Based Early Prediction of Sepsis Using Electronic Health Records: A Systematic Review
by Khandaker Reajul Islam, Johayra Prithula, Jaya Kumar, Toh Leong Tan, Mamun Bin Ibne Reaz, Md. Shaheenur Islam Sumon and Muhammad E. H. Chowdhury
J. Clin. Med. 2023, 12(17), 5658; https://doi.org/10.3390/jcm12175658 - 30 Aug 2023
Cited by 44 | Viewed by 13718
Abstract
Background: Sepsis, a life-threatening infection-induced inflammatory condition, has significant global health impacts. Timely detection is crucial for improving patient outcomes as sepsis can rapidly progress to severe forms. The application of machine learning (ML) and deep learning (DL) to predict sepsis using electronic [...] Read more.
Background: Sepsis, a life-threatening infection-induced inflammatory condition, has significant global health impacts. Timely detection is crucial for improving patient outcomes as sepsis can rapidly progress to severe forms. The application of machine learning (ML) and deep learning (DL) to predict sepsis using electronic health records (EHRs) has gained considerable attention for timely intervention. Methods: PubMed, IEEE Xplore, Google Scholar, and Scopus were searched for relevant studies. All studies that used ML/DL to detect or early-predict the onset of sepsis in the adult population using EHRs were considered. Data were extracted and analyzed from all studies that met the criteria and were also evaluated for their quality. Results: This systematic review examined 1942 articles, selecting 42 studies while adhering to strict criteria. The chosen studies were predominantly retrospective (n = 38) and spanned diverse geographic settings, with a focus on the United States. Different datasets, sepsis definitions, and prevalence rates were employed, necessitating data augmentation. Heterogeneous parameter utilization, diverse model distribution, and varying quality assessments were observed. Longitudinal data enabled early sepsis prediction, and quality criteria fulfillment varied, with inconsistent funding–article quality correlation. Conclusions: This systematic review underscores the significance of ML/DL methods for sepsis detection and early prediction through EHR data. Full article
(This article belongs to the Special Issue Trends and Prospects in Sepsis and Septic Shock)
Show Figures

Figure 1

18 pages, 1960 KB  
Article
An Improved Discrete Jaya Algorithm for Shortest Path Problems in Transportation-Related Processes
by Ren Wang, Mengchu Zhou, Jinglin Wang and Kaizhou Gao
Processes 2023, 11(8), 2447; https://doi.org/10.3390/pr11082447 - 14 Aug 2023
Cited by 12 | Viewed by 3045
Abstract
Shortest path problems are encountered in many engineering applications, e.g., intelligent transportation, robot path planning, and smart logistics. The environmental changes as sensed and transmitted via the Internet of Things make the shortest path change frequently, thus posing ever-increasing difficulty for traditional methods [...] Read more.
Shortest path problems are encountered in many engineering applications, e.g., intelligent transportation, robot path planning, and smart logistics. The environmental changes as sensed and transmitted via the Internet of Things make the shortest path change frequently, thus posing ever-increasing difficulty for traditional methods to meet the real-time requirements of many applications. Therefore, developing more efficient solutions has become particularly important. This paper presents an improved discrete Jaya algorithm (IDJaya) to solve the shortest path problem. A local search operation is applied to expand the scope of solution exploration and improve solution quality. The time complexity of IDJaya is analyzed. Experiments are carried out on seven real road networks and dense graphs in transportation-related processes. IDJaya is compared with the Dijkstra and ant colony optimization (ACO) algorithms. The results verify the superiority of the IDJaya over its peers. It can thus be well utilized to meet real-time application requirements. Full article
Show Figures

Figure 1

28 pages, 2294 KB  
Article
An Adaptive Jellyfish Search Algorithm for Packing Items with Conflict
by Walaa H. El-Ashmawi, Ahmad Salah, Mahmoud Bekhit, Guoqing Xiao, Khalil Al Ruqeishi and Ahmed Fathalla
Mathematics 2023, 11(14), 3219; https://doi.org/10.3390/math11143219 - 22 Jul 2023
Cited by 3 | Viewed by 1879
Abstract
The bin packing problem (BPP) is a classic combinatorial optimization problem with several variations. The BPP with conflicts (BPPCs) is not a well-investigated variation. In the BPPC, there are conditions that prevent packing some items together in the same bin. There are very [...] Read more.
The bin packing problem (BPP) is a classic combinatorial optimization problem with several variations. The BPP with conflicts (BPPCs) is not a well-investigated variation. In the BPPC, there are conditions that prevent packing some items together in the same bin. There are very limited efforts utilizing metaheuristic methods to address the BPPC. The current methods only pack the conflict items only and then start a new normal BPP for the non-conflict items; thus, there are two stages to address the BPPC. In this work, an adaption of the jellyfish metaheuristic has been proposed to solve the BPPC in one stage (i.e., packing the conflict and non-conflict items together) by defining the jellyfish operations in the context of the BPPC by proposing two solution representations. These representations frame the BPPC problem on two different levels: item-wise and bin-wise. In the item-wise solution representation, the adapted jellyfish metaheuristic updates the solutions through a set of item swaps without any preference for the bins. In the bin-wise solution representation, the metaheuristic method selects a set of bins, and then it performs the item swaps from these selected bins only. The proposed method was thoroughly benchmarked on a standard dataset and compared against the well-known PSO, Jaya, and heuristics. The obtained results revealed that the proposed methods outperformed the other comparison methods in terms of the number of bins and the average bin utilization. In addition, the proposed method achieved the lowest deviation rate from the lowest bound of the standard dataset relative to the other methods of comparison. Full article
(This article belongs to the Topic Applied Metaheuristic Computing: 2nd Volume)
Show Figures

Figure 1

33 pages, 798 KB  
Systematic Review
Does Native Vitamin D Supplementation Have Pleiotropic Effects in Patients with End-Stage Kidney Disease? A Systematic Review of Randomized Trials
by Nathan G. Pilkey, Olivia Novosel, Angélique Roy, Tristin E. Wilson, Jaya Sharma, Sono Khan, Sanjana Kapuria, Michael A. Adams and Rachel M. Holden
Nutrients 2023, 15(13), 3072; https://doi.org/10.3390/nu15133072 - 7 Jul 2023
Cited by 6 | Viewed by 5232
Abstract
Vitamin D has been shown to have multiple pleiotropic effects beyond bone and mineral metabolism, with purported roles in cardiovascular disease, cancer, and host immunity. Vitamin D deficiency is common in patients with end-stage kidney disease (ESKD); however, current clinical practice has favored [...] Read more.
Vitamin D has been shown to have multiple pleiotropic effects beyond bone and mineral metabolism, with purported roles in cardiovascular disease, cancer, and host immunity. Vitamin D deficiency is common in patients with end-stage kidney disease (ESKD); however, current clinical practice has favored the use of the active hormone. Whether vitamin D deficiency should be corrected in patients with ESKD remains unclear, as few randomized trials have been conducted. In this systematic review, we summarize the current evidence examining whether vitamin D supplementation improves outcomes, beyond mineral metabolism, in patients with ESKD. Data from randomized controlled trials of adults with ESKD were obtained by searching Ovid MEDLINE, Embase, the Cochrane Central Register of Controlled Trials, and the Web of Science Core Collection from inception to February 2023. Twenty-three trials composed of 2489 participants were identified for inclusion. Data were synthesized by two independent reviewers and summarized in tables organized by outcome. Outcomes included measures of mortality, cardiovascular disease, inflammation, muscle strength/function, nutrition, patient well-being, and outcomes specific to ESKD including erythropoietin usage, pruritus, and dialysis access maturation. The Cochrane risk of Bias Tool (RoB 2, 2019) was used to assess study quality. Overall, our findings indicate a minimal and varied benefit of native vitamin D supplementation. From the largest studies included, we determine that vitamin D has no demonstrated effect on patient-reported measures of well-being or utilization of erythropoietin, nor does it change levels of the inflammation biomarker C-reactive protein. Included trials were heterogeneous with regards to outcomes, and the majority studied small participant populations with a relatively short follow-up. We conclude that vitamin D supplementation corrects vitamin D deficiency and is safe and well-tolerated in humans with ESKD. However, it is not clear from clinical trials conducted to date that a causal pathway exists between 25(OH)D and pleiotropic effects that is responsive to vitamin D treatment. Full article
(This article belongs to the Special Issue Role of Vitamin D in Chronic Diseases)
Show Figures

Figure 1

Back to TopTop