AI ethics on Tuesday, 17 February 2026

Abstract Discrete and combinatorial optimization problems such as routing, scheduling, and resource allocation present high computational complexity, limiting the effectiveness of classical exact optimization methods. Most existing metaheuristic (MH) algorithms are originally designed for continuous domains and require transformation procedures that often degrade performance when applied to discrete problems. This study introduces the discrete puma optimizer (DPO), a new variant metaheuristic al