Metaheuristic algorithms have become indispensable for solving high-dimensional, non-convex, and constrained optimization problems arising in science and engineering. However, no single method can simultaneously provide strong global exploration, accurate local exploitation, and robust performance across diverse problem classes. This paper proposes JADEFLO, a new hybrid nature-inspired metaheuristic that couples Adaptive Differential Evolution with Optional External Archive (JADE) and Frilled Lizard Optimization (FLO) in a two-stage search framework. In the first stage, JADE drives global exploration using p-best mutation, an external archive, and adaptive control of the mutation factor and crossover rate to maintain population diversity. In the second stage, FLO performs intensive local refinement by mimicking the hunting and tree-climbing behaviors of frilled lizards through dedicated exploration and exploitation moves. The resulting algorithm has linear time complexity with respect to the population size, dimensionality, and number of iterations. JADEFLO is evaluated on the IEEE CEC 2022 single-objective benchmark suite (F1–F12) and three constrained engineering design problems (Pressure Vessel, tension/compression spring, and speed reducer), using 30 independent runs and comparisons against more than thirty state-of-the-art metaheuristics, including GA, PSO, DE variants, GWO, WOA, MFO, and FLO. The results show that JADEFLO attains the best overall rank on the CEC functions, delivers faster convergence and higher accuracy on most test cases, and matches or improves the best-known designs with markedly reduced variance. These findings indicate that JADEFLO is a promising general-purpose optimizer and a flexible foundation for future extensions to multi-objective and large-scale optimization.

Role-Based Access Control (RBAC) is the de-facto mechanism for preserving Kubernetes and other cloud-native container platforms, however real deployments occasionally drift away from the principle of least privilege as clusters, teams, and services improve. This paper introduces an automated RBAC hardening framework that formulates least-privilege policy design as a limited optimization problem over RoleBindings and ClusterRoleBindings. The objective combines (i) a permission-risk score for namespaced and cluster-scoped actions with (ii) an operational complexity term that discourages overly large binding sets. Solid limitations encode functional requirements as well as practical security policies, which includes namespace allowlists, role scoping rules, administrative restrictions on cluster-wide bindings, binding budgets, and separation-of-duty requirements expressed by utilizing capability classes. To allow optimizer-agnostic search while protecting Kubernetes RBAC semantics, we analyze candidate policies by utilizing a unified penalty-based fitness function that compines risk, complexity, and constraint violations into a single scalar value. We utilized ten metaheuristic as a benchmark including baseline search paths on a Kubernetes-inspired instance and report feasibility and least-privilege quality metrics (precision, recall, F1, and over-privilege ratio) parallel to RB/CRB counts and excess risk as a structural indicators. Outcomes present that feasibility is the prime challenge, and is restricted to a subset of optimizers reliably arrives to entirely feasible and compact arrangements within the exact budget, indicating the practicality of metaheuristic enhancement for systematic RBAC reduction in containerized cloud computing environments.

Data-driven innovation in healthcare, finance, and smart cities increasingly depends on sharing rich datasets, but such sharing raises severe privacy risks and regulatory challenges. Privacy-preserving data publishing (PPDP) seeks to release useful data while preventing re-identification and inference attacks. This paper presents a comprehensive survey of anonymization techniques for PPDP, spanning traditional models (k-anonymity, l-diversity, t-closeness, and pseudonymization) and modern approaches (differential privacy (DP), synthetic data generation, federated learning (FL), secure multi-party computation (SMPC), homomorphic encryption (HE), blockchain-based schemes, and quantum-safe cryptography). We propose a taxonomy that organizes these methods by privacy guarantees, data utility, scalability, and computational cost, and we provide a comparative analysis of their strengths, limitations, and typical application domains. The survey also reviews legal and ethical frameworks, with particular attention to general data protection regulation GDPR, health insurance portability and accountability act (HIPAA), and related regulations, and highlights emerging trends such as artificial intelligence (AI-driven) anonymization and privacy risks from large language models (LLMs) and quantum computing. Overall, the study shows that various techniques fail to protect all data scenarios so we need to create hybrid systems which will provide explainable anonymization solutions at different scales to protect privacy and maintain useful data utility.