Search Results (1,066)

Metaheuristics are powerful optimization techniques that are well-suited for addressing complex combinatorial problems across diverse scientific and industrial domains. However, their application to computationally expensive problems remains challenging due to the high cost and significant number of fitness evaluations required during the search process. Surrogate modeling has recently emerged as an effective solution to reduce these computational demands by approximating the true, time-intensive fitness function. While surrogate-assisted metaheuristics have gained attention in recent years, their application to complex scheduling problems such as the Permutation Flowshop Scheduling Problem (PFSP) under learning, deterioration, and maintenance effects remains largely unexplored. To the best of our knowledge, this study is the first to investigate the integration of surrogate modeling within the artificial bee colony (ABC) framework specifically tailored to this problem context. We develop and evaluate two distinct strategies for integrating surrogate modeling into the optimization process, leveraging the ABC algorithm. The first strategy uses a Kriging model to dynamically guide the selection of the most effective search operator at each stage of the employed bee phase. The second strategy introduces three variants, each incorporating a Q-learning-based operator in the selection mechanism and a different evolution control mechanism, where the Kriging model is employed to approximate the fitness of generated offspring. Through extensive computational experiments and performance analysis, using Taillard’s well-known standard benchmarks, we assess solution quality, convergence, and the number of exact fitness evaluations, demonstrating that these approaches achieve competitive results. Full article

This paper presents a reinforcement learning (RL) approach for solving the team orienteering problem under both deterministic and dynamic travel time conditions. The proposed method builds on the transformer architecture and is trained to construct routes that adapt to real-time variations, such as traffic and environmental changes. A key contribution of this work is the model’s ability to generalize across problem instances with varying numbers of nodes and vehicles, eliminating the need for retraining when problem size changes. To assess performance, a comprehensive set of experiments involving 27,000 synthetic instances is conducted, comparing the RL model with a variable neighborhood search metaheuristic. The results indicate that the RL model achieves competitive solution quality while requiring significantly less computational time. Moreover, the RL approach consistently produces feasible solutions across all dynamic instances, demonstrating strong robustness in meeting time constraints. These findings suggest that learning-based methods can offer efficient, scalable, and adaptable solutions for routing problems in dynamic and uncertain environments. Full article

Precisely predicting photovoltaic (PV) output is crucial for reliable grid integration; so far, most models rely on site-specific sensor data or treat large meteorological datasets as black boxes. This study proposes an explainable machine-learning framework that simultaneously ranks the most informative weather parameters and reveals their physical relevance to PV generation. Starting from 27 local and plant-level variables recorded at 15 min resolution for a 1 MW array in Çanakkale region, Türkiye (1 August 2022–3 August 2024), we apply a three-stage feature-selection pipeline: (i) variance filtering, (ii) hierarchical correlation clustering with Ward linkage, and (iii) a meta-heuristic optimizer that maximizes a neural-network R² while penalizing poor or redundant inputs. The resulting subset, dominated by apparent temperature and diffuse, direct, global-tilted, and terrestrial irradiance, reduces dimensionality without significantly degrading accuracy. Feature importance is then quantified through two complementary aspects: (a) tree-based permutation scores extracted from a set of ensemble models and (b) information gain computed over random feature combinations. Both views converge on shortwave, direct, and global-tilted irradiance as the primary drivers of active power. Using only the selected features, the best model attains an average R² ≅ 0.91 on unseen data. By utilizing transparent feature-reduction techniques and explainable importance metrics, the proposed approach delivers compact, more generalized, and reliable PV forecasts that generalize to sites lacking embedded sensor networks, and it provides actionable insights for plant siting, sensor prioritization, and grid-operation strategies. Full article

Small- and medium-sized enterprises (SMEs) face dynamic and competitive environments where resilience and data-driven decision-making are critical. Despite the potential benefits of artificial intelligence (AI), machine learning (ML), and optimization techniques, SMEs often struggle to adopt these tools due to high costs, limited training, and restricted hardware access. This study reviews how SMEs can employ heuristics, metaheuristics, ML, and hybrid approaches to support strategic decisions under uncertainty and resource constraints. Using bibliometric mapping with UMAP and BERTopic, 82 key works are identified and clustered into 11 thematic areas. From this, the study develops a practical framework for implementing and evaluating optimization strategies tailored to SMEs’ limitations. The results highlight critical application areas, adoption barriers, and success factors, showing that heuristics and hybrid methods are especially effective for multi-objective optimization with lower computational demands. The study also outlines research gaps and proposes future directions to foster digital transformation in SMEs. Unlike prior reviews focused on specific industries or methods, this work offers a cross-sectoral perspective, emphasizing how these technologies can strengthen SME resilience and strategic planning. Full article

This paper proposes a novel integer-mixed probabilistic optimal power flow (IM-POPF) strategy for frequency regulation in islanded microgrids under uncertain operating conditions. Existing load-shedding approaches face critical limitations: continuous frameworks fail to reflect the discrete nature of actual load disconnections, while deterministic models inadequately capture the stochastic behavior of renewable generation and load variations. The proposed approach formulates load shedding as an integer optimization problem where variables are categorized as integer (load disconnection decisions at specific nodes) and continuous (voltages, power generation, and steady-state frequency), better reflecting practical power system operations. The key innovation combines integer load-shedding optimization with efficient uncertainty propagation through Unscented Transformation, eliminating the computational burden of Monte Carlo simulations while maintaining accuracy. Load and renewable uncertainties are modeled as normally distributed variables, and probabilistic constraints ensure operational limits compliance with predefined confidence levels. The methodology integrates Differential Evolution metaheuristics with Unscented Transformation for uncertainty propagation, requiring only 137 deterministic evaluations compared to 5000 for Monte Carlo methods. Validation on an IEEE 33-bus radial distribution system configured as an islanded microgrid demonstrates significant advantages over conventional approaches. Results show 36.5-fold computational efficiency improvement while achieving 95.28% confidence level compliance for frequency limits, compared to only 50% for deterministic methods. The integer formulation requires minimal additional load shedding (21.265%) compared to continuous approaches (20.682%), while better aligning with the discrete nature of real-world operational decisions. The proposed IM-POPF framework successfully minimizes total load shedding while maintaining frequency stability under uncertain conditions, providing a computationally efficient solution for real-time microgrid operation. Full article

Container terminals are facing significant challenges in meeting the increasing demands for volume and throughput, with limited space often presenting as a critical constraint. Key areas of concern at the quayside include the berth allocation problem, the quay crane assignment, and the scheduling problem. Effectively managing these issues is essential for optimizing port operations; failure to do so can lead to substantial operational and economic ramifications, ultimately affecting competitiveness within the global shipping industry. Optimization models, encompassing both mathematical frameworks and metaheuristic approaches, offer promising solutions. Additionally, the application of machine learning and reinforcement learning enables real-time solutions, while robust optimization and stochastic models present effective strategies, particularly in scenarios involving uncertainties. This study expands upon earlier foundational analyses of berth allocation, quay crane assignment, and scheduling issues, which have laid the groundwork for port optimization. Recent developments in uncertainty management, automation, real-time decision-making approaches, and environmentally sustainable objectives have prompted this review of the literature from 2015 to 2024, exploring emerging challenges and opportunities in container terminal operations. Recent research has increasingly shifted toward integrated approaches and the utilization of continuous berthing for better wharf utilization. Additionally, emerging trends, such as sustainability and green infrastructure in port operations, and policy trade-offs are gaining traction. In this review, we critically analyze and discuss various aspects, including spatial and temporal attributes, crane handling, sustainability, model formulation, policy trade-offs, solution approaches, and model performance evaluation, drawing on a review of 94 papers published between 2015 and 2024. Full article

Minimizing energy consumption remains a critical challenge in wireless sensor networks (WSNs) because of their reliance on nonrechargeable batteries. Clustering-based hierarchical communication has been widely adopted to address this issue by improving residual energy and balancing the network load. In this architecture, cluster heads (CHs) are responsible for data collection, aggregation, and forwarding, making their optimal selection essential for prolonging network lifetime. The effectiveness of CH selection is highly dependent on the choice of metaheuristic optimization method and the design of the fitness function. Although numerous studies have applied metaheuristic algorithms with suitably designed fitness functions to tackle the CH selection problem, many existing approaches fail to fully capture both the spatial distribution of nodes and dynamic energy conditions. To address these limitations, we propose the binary secretary bird optimization clustering (BSBOC) method. BSBOC introduces a binary variant of the secretary bird optimization algorithm (SBOA) to handle the discrete nature of CH selection. Additionally, it defines a novel multiobjective fitness function that, for the first time, considers the Voronoi diagram of CHs as an optimization objective, besides other well-known objectives. BSBOC was thoroughly assessed via comprehensive simulation experiments, benchmarked against two advanced methods (MOBGWO and WAOA), under both homogeneous and heterogeneous network models across two deployment scenarios. Findings from these simulations demonstrated that BSBOC notably decreased energy usage and prolonged network lifetime, highlighting its effectiveness as a reliable method for energy-aware clustering in WSNs. Full article

Predicting water inrush in coal mines faces significant challenges due to limited data, model generalization, and a lack of interpretability. Current approaches often neglect the inherent geometrical symmetries and structured patterns within the complex hydrological parameter space, rely on local parameter optimization, and struggle with interpretability, leading to insufficient predictive accuracy and engineering applicability under complex geological conditions. This study addresses these limitations by integrating Gaussian mixture modeling (GMM), manifold learning, and data augmentation to effectively capture multimodal hydrological data distributions and reveal their intrinsic symmetrical configurations and manifold structures, thereby reducing feature dimensionality. We then apply a whale optimization algorithm (WOA)-enhanced XGBoost model to forecast water inrush probabilities. Our model achieved an R² of 0.92, demonstrating a greater than 60% error reduction across various metrics. Validation at the Yangcheng Coal Mine confirmed that this balanced approach significantly enhances predictive accuracy, interpretability, and cross-scenario applicability. The synergy between high accuracy and transparency provides decision makers with reliable risk insights, enabling bidirectional validation with geological mechanisms and supporting the implementation of targeted, proactive safety measures. Full article

The performance of meta-heuristic algorithms on optimisation problems depend on the values of control parameters. These parameters greatly influence the behaviour of algorithms and affect the quality of the solutions. In order to optimise an algorithm for a specific problem set, a structured approach is followed to carefully select the appropriate control parameters. This approach is called control parameter tuning. Most existing tuning approaches focus on tuning an algorithm based on only one performance objective, such as accuracy or convergence speed. However, these objectives often work against each other, and improving the algorithm based on one objective can worsen the performance based on another objective. For example, obtaining a more accurate solution generally requires the algorithm to run for a longer time. The goal of this research is to develop a tuning approach that takes multiple performance objectives into account when tuning the control parameters of a meta-heuristic. The result of the tuning algorithm presents the experimenter with multiple values for control parameters, each representing different trade-offs between the various objectives. Experimental results demonstrate that M-race successfully discovered between 9 and 15 non-dominated parameter configurations across benchmark functions for both particle swarm optimisation (PSO) and differential evolution (DE) algorithms. These non-dominated parameter configurations represent balances among the tuning objectives used. Full article

In the shift toward sustainable and resource-efficient manufacturing, Artificial Intelligence (AI) is playing a transformative role in overcoming the limitations of traditional production scheduling methods. This study, based on a Systematic Literature Review (SLR), explores how AI techniques enhance Advanced Planning and Scheduling (APS) systems, particularly under finite-capacity constraints. Traditional scheduling models often overlook real-time resource limitations, leading to inefficiencies in complex and dynamic production environments. AI, with its capabilities in data fusion, pattern recognition, and adaptive learning, enables the development of intelligent, flexible scheduling solutions. The integration of metaheuristic algorithms—especially Ant Colony Optimization (ACO) and hybrid models like GA-ACO—further improves optimization performance by offering high-quality, near-optimal solutions without requiring extensive structural modeling. These AI-powered APS systems enhance scheduling accuracy, reduce lead times, improve resource utilization, and enable the proactive identification of production bottlenecks. Especially relevant in high-variability sectors like fashion, these approaches support Industry 5.0 goals by enabling agile, sustainable, and human-centered manufacturing systems. The findings have been highlighted in a structured framework for AI-based APS systems supported by metaheuristics that compares the Industry 4.0 and Industry 5.0 perspectives. The study offers valuable implications for both academia and industry: academics can gain a synthesized understanding of emerging trends, while practitioners are provided with actionable insights for deploying intelligent planning systems that align with sustainability goals and operational efficiency in modern supply chains. Full article

The Unicost Set Covering Problem (USCP), an NP-hard combinatorial optimization challenge, demands efficient methods to minimize the number of sets covering a universe. This study introduces a binary White Shark Optimizer (WSO) enhanced with V3 transfer functions, elitist binarization, and chaotic maps. To evaluate algorithm performance, we employ the Relative Percentage Deviation (RPD), which measures the percentage difference between the obtained solutions and optimal values. Our approach achieves outstanding results on six benchmark instances: WSO-ELIT_CIRCLE delivers an RPD of 0.7% for structured instances, while WSO-ELIT_SINU attains an RPD of 0.96% in cyclic instances, showing empirical improvements over standard methods. Experimental results demonstrate that circle chaotic maps excel in structured problems, while sinusoidal maps perform optimally in cyclic instances, with observed improvements up to 7.31% over baseline approaches. Diversity and convergence analyses show structured instances favor exploitation-driven strategies, whereas cyclic instances benefit from adaptive exploration. This work establishes WSO as a robust metaheuristic for USCP, with applications in resource allocation and network design. Full article

The Sustainable Supply Chain Network Design Problem (SSCNDP) is to determine the optimal network configuration and resource allocation that achieve the trade-off among economic, environmental, social, and resilience objectives. The Sustainable Supply Chain Network Design Problem (SSCNDP) involves determining the optimal network configuration and resource allocation that allows trade-off among economic, environmental, social, and resilience objectives. This paper addresses the SSCNDP under hybrid uncertainty, which combines objective randomness got from historical data, and subjective beliefs induced by expert judgment. Building on chance theory, we formulate a dependent-chance goal programming model that specifies target probability levels for achieving sustainability objectives and minimizes deviations from these targets using a lexicographic approach. To solve this complex optimization problem, we develop a hybrid intelligent algorithm that combines uncertain random simulation with Reinforcement Learning-enhanced Salp Swarm Optimization (RL-SSO). The proposed RL-SSO algorithm is benchmarked against standard metaheuristics—Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), and standard SSO, across diverse problem instances. Results show that our method consistently outperforms these techniques in both solution quality and computational efficiency. The paper concludes with managerial insights and discusses limitations and future research directions. Full article

In this article, we present a hybrid optimization methodology using the whale optimization algorithm and Markov Chain Monte Carlo sampling technique in a teachers’ training development program regarding creativity in technology-enhanced learning design. Finding the best possible training for creativity in learning design with technology is a complex task, as many dynamic and multi-model variables need to be taken into consideration. When designing the best possible training, the whale optimization algorithm helped us in determining the right methods, resources, content, and assessment. A further Markov Chain Monte Carlo-based approach helped us in deciding with accuracy that these were the correct parameters of our training. In this article, we show that metaheuristic algorithms like the whale optimization algorithm, validated by a Markov chain technique like Markov Chain Monte Carlo, can help not only in areas like machine learning but also in fields without structured data, like creativity in technology-enhanced learning design. The best possible training for a teacher’s professional development in creative learning design is collaborative, hands-on, and utilizes creativity definitions for the product along with technology integration learning design models. Full article

Background/Objectives: Differentiated Thyroid Cancer (DTC), comprising papillary and follicular carcinomas, is the most common type of thyroid cancer. This is highly infectious and increasing at a higher rate. Some patients experience recurrence even after undergoing successful treatment. Early signs of recurrence can be hard to identify, and the existing health care system cannot always identify it on time. Therefore, predicting its recurrence accurately and in its early stage is a significant clinical challenge. Numerous advanced technologies, such as machine learning, are being used to overcome this clinical challenge. Thus, this study presents a novel approach for predicting the recurrence of DTC. The key objective is to improve the prediction accuracy through hyperparameter optimization. Methods: In order to achieve this, we have used a metaheuristic algorithm, the whale optimization algorithm (WOA) and its modified version. The modifications that we introduced in the original WOA algorithm are a piecewise linear chaotic map for population initialization and inertia weight. Both of our algorithms optimize the hyperparameters of the Extreme Gradient Boosting (XGBoost) model to increase the overall performance. The proposed algorithms were applied to the dataset collected from the University of California, Irvine (UCI), Machine Learning Repository to predict the chances of recurrence for DTC. This dataset consists of 383 samples with a total of 16 features. Each feature captures the critical medical and demographic information. Results: The model has shown an accuracy of 99% when optimized with WOA and 97% accuracy when optimized with the modified WOA. Conclusions: Furthermore, we have compared our work with other innovative works and validated the performance of our model for the prediction of DTC recurrence. Full article

In recent decades, the rapid development of metaheuristic algorithms has outpaced theoretical understanding, with experimental evaluations often overshadowing rigorous analysis. While nature-inspired optimization methods show promise for various applications, their effectiveness is often limited by metaphor-driven design, structural biases, and a lack of sufficient theoretical foundation. This paper systematically examines the challenges in developing robust, generalizable optimization techniques, advocating for a paradigm shift toward modular, transparent frameworks. A comprehensive review of the existing limitations in metaheuristic algorithms is presented, along with actionable strategies to mitigate biases and enhance algorithmic performance. Through emphasis on theoretical rigor, reproducible experimental validation, and open methodological frameworks, this work bridges critical gaps in algorithm design. The findings support adopting scientifically grounded optimization approaches to advance operational applications. Full article