Bady Gana
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Bady Gana has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Héctor Allende
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile
5 shared publications - Marcelo Becerra-Rozas
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile
4 shared publications - Andrés Leiva-Araos
Department of Computing, University of North Florida, Jacksonville, USA
3 shared publications - José Lara Arce
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile
3 shared publications - Broderick Crawford
Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile
2 shared publications - José García
Escuela de Ingeniería de Construcción y Transporte, Pontifícia Universidad Católica de Valparaíso, Valparaíso 2362804, Chile
2 shared publications
Latest Publications
- Open Access
- 3 November 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (11) , 801
Bio-Inspired Metaheuristic Optimization for Elective Surgical Scheduling: A Real-World Two-Stage Flexible Flow-Shop Study
Elective surgical scheduling allocates operating rooms and specialized personnel under operational constraints, yet most metaheuristic evaluations rely on synthetic benchmarks. We study a two-stage flexible flow shop with independently assigned rooms for anesthesia preparation and surgery, calibrated with 23,865 valid records from a Chilean public hospital, and compare four population-based, bio-inspired methods: a Genetic Algorithm, discrete Particle Swarm Optimization, the Secretary Bird Optimization Algorithm, and a discrete Mantis Shrimp Optimization Algorithm. Across four 15–30-surgery instances and 400 replications, the particle swarm method achieves the lowest mean makespan among the metaheuristics for 20–30 surgeries, whereas the Secretary Bird Optimization Algorithm roughly halves the number of patients incurring inter-stage waiting relative to that method () and produces zero-wait schedules in some replications. Deterministic dispatching rules remain competitive or better for expected benchmark throughput, although the particle swarm method finds the shortest best-case schedule for 30 surgeries. A retrospective replay of 120 historical elective operating days reproduces the throughput–waiting trade-off. Relative to the realized manual calendar span, the particle swarm method yields a median simulated makespan difference of (median absolute difference: min per day). The replay evaluates scheduling with realized procedure durations, daily room counts, and the fixed configured staff pool, providing a retrospective comparison across historical workloads.- 3 November 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (11) , 801
Open AccessBio-Inspired Metaheuristic Optimization for Elective Surgical Scheduling: A Real-World Two-Stage Flexible Flow-Shop Study
Elective surgical scheduling allocates operating rooms and specialized personnel under operational constraints, yet most metaheuristic evaluations rely on synthetic benchmarks. We study a two-stage flexible flow shop with independently assigned rooms for anesthesia preparation and surgery, calibrated with 23,865 valid records from a Chilean public hospital, and compare four population-based, bio-inspired methods: a Genetic Algorithm, discrete Particle Swarm Optimization, the Secretary Bird Optimization Algorithm, and a discrete Mantis Shrimp Optimization Algorithm. Across four 15–30-surgery instances and 400 replications, the particle swarm method achieves the lowest mean makespan among the metaheuristics for 20–30 surgeries, whereas the Secretary Bird Optimization Algorithm roughly halves the number of patients incurring inter-stage waiting relative to that method () and produces zero-wait schedules in some replications. Deterministic dispatching rules remain competitive or better for expected benchmark throughput, although the particle swarm method finds the shortest best-case schedule for 30 surgeries. A retrospective replay of 120 historical elective operating days reproduces the throughput–waiting trade-off. Relative to the realized manual calendar span, the particle swarm method yields a median simulated makespan difference of (median absolute difference: min per day). The replay evaluates scheduling with realized procedure durations, daily room counts, and the fixed configured staff pool, providing a retrospective comparison across historical workloads. - Open Access
- 3 March 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (3) , 183
Evaluating Bio-Inspired Metaheuristics for Dynamic Surgical Scheduling: A Resilient Three-Stage Flow Shop Model Under Stochastic Emergency Arrivals
Optimal surgical scheduling necessitates a strategic balance between elective efficiency and responsiveness to stochastic emergency arrivals. This study evaluates a Genetic Algorithm alongside discretized variants of Particle Swarm Optimization, the Secretary Bird Optimization Algorithm, and the Mantis Shrimp Optimization Algorithm. These algorithms are assessed within a dynamic three-stage flexible flow shop model under no-buffer blocking constraints. Findings from 300 Monte Carlo replications demonstrate that while the Genetic Algorithm achieves peak global efficiency, discretized bio-inspired algorithms reach a comparable statistical efficiency frontier. Notably, the discretized Secretary Bird Optimization Algorithm facilitates superior emergency integration by maintaining natural capacity buffers, whereas the aggressive local optimization characteristic of alternative methods often triggers resource saturation in recovery units. These results indicate a potential recovery of 90 annual operating hours per theater.These results indicate a potential recovery of 90 annual operating hours per theater, representing a 6.7% increase in resource utilization efficiency. This improvement provides a critical data-driven capacity margin to mitigate the non-prioritized (Non-GES) surgical backlog in Chilean public hospitals.
- 3 March 2026
- Published by MDPI AG in Biomimetics
- Vol. 11 (3) , 183
Open AccessEvaluating Bio-Inspired Metaheuristics for Dynamic Surgical Scheduling: A Resilient Three-Stage Flow Shop Model Under Stochastic Emergency Arrivals
Optimal surgical scheduling necessitates a strategic balance between elective efficiency and responsiveness to stochastic emergency arrivals. This study evaluates a Genetic Algorithm alongside discretized variants of Particle Swarm Optimization, the Secretary Bird Optimization Algorithm, and the Mantis Shrimp Optimization Algorithm. These algorithms are assessed within a dynamic three-stage flexible flow shop model under no-buffer blocking constraints. Findings from 300 Monte Carlo replications demonstrate that while the Genetic Algorithm achieves peak global efficiency, discretized bio-inspired algorithms reach a comparable statistical efficiency frontier. Notably, the discretized Secretary Bird Optimization Algorithm facilitates superior emergency integration by maintaining natural capacity buffers, whereas the aggressive local optimization characteristic of alternative methods often triggers resource saturation in recovery units. These results indicate a potential recovery of 90 annual operating hours per theater.These results indicate a potential recovery of 90 annual operating hours per theater, representing a 6.7% increase in resource utilization efficiency. This improvement provides a critical data-driven capacity margin to mitigate the non-prioritized (Non-GES) surgical backlog in Chilean public hospitals.
- 17 February 2026
- Published by Springer Nature
- p. 81-95
Optimizing Surgical Schedules: A Comparative Performance Analysis of Genetic Algorithms and Discrete Particle Swarm Optimization
- 17 February 2026
- Published by Springer Nature
- p. 81-95
Optimizing Surgical Schedules: A Comparative Performance Analysis of Genetic Algorithms and Discrete Particle Swarm Optimization
- Open Access
- 31 October 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (21) , 3472
Measuring Semantic Coherence of RAG-Generated Abstracts Through Complex Network Metrics
The exponential growth of scientific literature demands scalable methods to evaluate large-language-model outputs beyond surface-level fluency. We present a two-phase framework that separates generation from evaluation: a retrieval-augmented generation system first produces candidate abstracts, which are then embedded into semantic co-occurrence graphs and assessed using seven robustness metrics from complex network theory. Two experiments were conducted. The first varied model, embedding and prompt configurations, achieved results showing clear differences in performance; the best family combined gemma-2b-it, a prompt inspired by chain-of-Thought reasoning, and all-mpnet-base-v2, achieving the highest graph-based robustness. The second experiment refined the temperature setting for this family, identifying as optimal, which stabilized results (sd ) and improved robustness relative to retrieval baselines (, ). While human evaluation was limited to a small set of abstracts, the results revealed a partial convergence between graph-based robustness and expert judgments of coherence and importance. Our approach contrasts with methods like GraphRAG and establishes a reproducible, model-agnostic pathway for the scalable quality control of LLM-generated scientific content.- 31 October 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (21) , 3472
Open AccessMeasuring Semantic Coherence of RAG-Generated Abstracts Through Complex Network Metrics
The exponential growth of scientific literature demands scalable methods to evaluate large-language-model outputs beyond surface-level fluency. We present a two-phase framework that separates generation from evaluation: a retrieval-augmented generation system first produces candidate abstracts, which are then embedded into semantic co-occurrence graphs and assessed using seven robustness metrics from complex network theory. Two experiments were conducted. The first varied model, embedding and prompt configurations, achieved results showing clear differences in performance; the best family combined gemma-2b-it, a prompt inspired by chain-of-Thought reasoning, and all-mpnet-base-v2, achieving the highest graph-based robustness. The second experiment refined the temperature setting for this family, identifying as optimal, which stabilized results (sd ) and improved robustness relative to retrieval baselines (, ). While human evaluation was limited to a small set of abstracts, the results revealed a partial convergence between graph-based robustness and expert judgments of coherence and importance. Our approach contrasts with methods like GraphRAG and establishes a reproducible, model-agnostic pathway for the scalable quality control of LLM-generated scientific content. - Open Access
- 22 August 2025
- Published by Elsevier in Neurocomputing
- Vol. 655
A systematic review of long document summarization methods: Evaluation metrics and approaches
- 22 August 2025
- Published by Elsevier in Neurocomputing
- Vol. 655
Open AccessA systematic review of long document summarization methods: Evaluation metrics and approaches
- Open Access
- 25 March 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-21
Large scale summarization using ensemble prompts and in context learning approaches
The field of Information Assurance (IA) and Cybersecurity has seen substantial evolution, driven by advancements in technology and the increasing sophistication of threats in the digital age. This study employs Large Language Models (LLMs), as well as other advanced NLP techniques, to conduct a comprehensive analysis of literature from 1967 to 2024. By analyzing a corpus of more than 62,000 documents extracted from Scopus, our approach involves a comprehensive methodology that includes two main phases: topic detection using BERTopic and automatic summarization with LLMs across various periods (annual and decades). By designing targeted queries to extract relevant papers, analyzing textual data, and applying advanced prompting techniques for summarization, we integrate computational models to handle large volumes of data. Our results demonstrate that an ensemble of methods (Ev2) outperforms traditional summarization and density-based approaches, with improvements ranging from 16.7% to 29.6% in keyword definition tasks. It generates summaries that outperform in 5 out of the 7 tested metrics while maintaining the logical integrity of bibliographic references. Our results illuminate the shifts in focus within Information Assurance across decades, revealing key breakthroughs and forecasting emerging areas of significance.
- 25 March 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-21
Open AccessLarge scale summarization using ensemble prompts and in context learning approaches
The field of Information Assurance (IA) and Cybersecurity has seen substantial evolution, driven by advancements in technology and the increasing sophistication of threats in the digital age. This study employs Large Language Models (LLMs), as well as other advanced NLP techniques, to conduct a comprehensive analysis of literature from 1967 to 2024. By analyzing a corpus of more than 62,000 documents extracted from Scopus, our approach involves a comprehensive methodology that includes two main phases: topic detection using BERTopic and automatic summarization with LLMs across various periods (annual and decades). By designing targeted queries to extract relevant papers, analyzing textual data, and applying advanced prompting techniques for summarization, we integrate computational models to handle large volumes of data. Our results demonstrate that an ensemble of methods (Ev2) outperforms traditional summarization and density-based approaches, with improvements ranging from 16.7% to 29.6% in keyword definition tasks. It generates summaries that outperform in 5 out of the 7 tested metrics while maintaining the logical integrity of bibliographic references. Our results illuminate the shifts in focus within Information Assurance across decades, revealing key breakthroughs and forecasting emerging areas of significance.
- 13 March 2025
- Published by Springer Nature
- p. 269-282
Advances and Strategies in Quantum Computing Integration for Cybersecurity: A Systematic Literature Review
- 13 March 2025
- Published by Springer Nature
- p. 269-282
Advances and Strategies in Quantum Computing Integration for Cybersecurity: A Systematic Literature Review
- Open Access
- 30 August 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (17) , 7675
Leveraging LLMs for Efficient Topic Reviews
This paper presents the topic review (TR), a novel semi-automatic framework designed to enhance the efficiency and accuracy of literature reviews. By leveraging the capabilities of large language models (LLMs), TR addresses the inefficiencies and error-proneness of traditional review methods, especially in rapidly evolving fields. The framework significantly improves literature review processes by integrating advanced text mining and machine learning techniques. Through a case study approach, TR offers a step-by-step methodology that begins with query generation and refinement, followed by semi-automated text mining to identify relevant articles. LLMs are then employed to extract and categorize key themes and concepts, facilitating an in-depth literature analysis. This approach demonstrates the transformative potential of natural language processing in literature reviews. With an average similarity of 69.56% between generated and indexed keywords, TR effectively manages the growing volume of scientific publications, providing researchers with robust strategies for complex text synthesis and advancing knowledge in various domains. An expert analysis highlights a positive Fleiss’ Kappa score, underscoring the significance and interpretability of the results.
- 30 August 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (17) , 7675
Open AccessLeveraging LLMs for Efficient Topic Reviews
This paper presents the topic review (TR), a novel semi-automatic framework designed to enhance the efficiency and accuracy of literature reviews. By leveraging the capabilities of large language models (LLMs), TR addresses the inefficiencies and error-proneness of traditional review methods, especially in rapidly evolving fields. The framework significantly improves literature review processes by integrating advanced text mining and machine learning techniques. Through a case study approach, TR offers a step-by-step methodology that begins with query generation and refinement, followed by semi-automated text mining to identify relevant articles. LLMs are then employed to extract and categorize key themes and concepts, facilitating an in-depth literature analysis. This approach demonstrates the transformative potential of natural language processing in literature reviews. With an average similarity of 69.56% between generated and indexed keywords, TR effectively manages the growing volume of scientific publications, providing researchers with robust strategies for complex text synthesis and advancing knowledge in various domains. An expert analysis highlights a positive Fleiss’ Kappa score, underscoring the significance and interpretability of the results.