3 papers
cs.NE2026
On the Use of Evolutionary Optimization for the Dynamic Chance Constrained Open-Pit Mine Scheduling Problem
Ishara Hewa Pathiranage, Aneta Neumann
Open-pit mine scheduling is a complex real world optimization problem that involves uncertain economic values and dynamically changing resource capacities. Evolutionary algorithms…
cs.NE2026
On the Use of Bi-Objective Evolutionary Algorithms for the Stochastic MKP under Dynamic Constraints
Ishara Hewa Pathiranage, Aneta Neumann
The multiple knapsack problem (MKP) generalizes the classical knapsack problem by assigning items to multiple knapsacks subject to capacity constraints. It is used to model many re…
cs.NE2024
Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem
Ishara Hewa Pathiranage, Frank Neumann, Denis Antipov +1
Real-world optimization problems often involve stochastic and dynamic components. Evolutionary algorithms are particularly effective in these scenarios, as they can easily adapt to…