The purpose of this paper is twofold. First, it introduces a new hybrid computational intelligence algorithm to the optimization community. This novel hybrid algorithm has hyperheuristic (HH) neighborhood search movements embedded into a recently introduced migrating birds optimization (MBO) algorithm. Therefore, it is called HHMBO. Second, it gives the necessary mathematical model for a shift scheduling problem of a manufacturing company defined by including the fairness perspective, which is typically ignored especially in manufacturing industry. Therefore, we call this complex optimization problem fairness oriented integrated shift scheduling problem (FOSSP). HHMBO is applied on FOSSP and is compared with the well-known simulated annealing, hyperheuristics, and classical MBO algorithms through extended computational experiments on several synthetic datasets. Experiments demonstrate that the new hybrid computational intelligence algorithm is promising especially for large sized instances of the specific problem defined here. HHMBO has a high exploration capability and is a promising technique for all optimization problems. To justify this assertion, we applied HHMBO to the well-known quadratic assignment problem (QAP) instances from the QAPLIB. HHMBO was up to 14.6% better than MBO on converging to the best known solutions for QAP benchmark instances with different densities. We believe that the novel hybrid method and the fairness oriented model presented in this study will give new insights to the decision-makers in the industry as well as to the researchers from several disciplines.
31 May 2026 in Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi
In this study, we investigate traditional machine learning methods with respect to state-of-the-art deep learning approaches for fruit image classification. Conventional classifiers such as Random Forest, and eXreme Gradient Boosting were evaluated alongside neural networks and state-of-the-art transfer learning models, including Residual Network (ResNet), Visual Geometry Group 16 (VGG16), and EfficientNet-B0. The fine-tuned ResNet50 model obtained the maximum classification accuracy as 97.57%, substantially surpassing other traditional solutions as well as shallow networks. One important contribution of this work is in the focus on model explainability. To understand the reasoning from the deep models, we used Gradient-weighted Class Activation Mapping (Grad-CAM) and Grad-CAM++ techniques to visualize what kind of decision is helping the model making predictions as well as by considering what regions in input images are being looked up for the concerned class. This explainability integration provides the transparency and explainability of classification system, being crucial for its real world applicability. The results underline the significance of both model capability and explainability when it comes to model selection, and show that fine-tuned deep networks combined with explainability tools is a strong and useful framework for image based classification.
Although population-based metaheuristic algorithms have been widely applied to the One-Dimensional Cutting Stock Problem (1D-CSP), their performance is often limited by premature convergence and insufficient local search capability. This study presents a comparative investigation of the effect of local search on four population-based metaheuristic paradigms for the one-dimensional cutting stock problem (1D-CSP). Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Grey Wolf Optimizer (GWO) are evaluated both in their standard forms and after incorporating a common Simulated Annealing (SA)-based local refinement procedure. The objective is not to introduce a new hybridization strategy but to systematically examine whether and to what extent the same local search mechanism affects algorithms with different search characteristics. The methods are evaluated on two complementary benchmark datasets comprising 39 industrial instances from the Japanese chemical fiber industry and 1800 CUTGEN1 instances. Performance was evaluated using clipping loss, computational cost, Friedman ranks, win counts, and paired Wilcoxon signed-rank tests. According to the results, statistically significant differences were observed for GA, PSO, and GWO across both benchmark sets, while the difference between ACO and M-ACO was not statistically significant. The study provides a comparative assessment of how the common local search component affects different metaheuristic paradigms for full 1D-CSP.