7 papers
Chance-Constrained Bi-Objective Evolutionary Optimization for the Open-Pit Mining Operational Planning Problem
Ishara Hewa Pathiranage, Aneta Neumann
Open-pit mining operational planning involves allocating limited resources while satisfying production, equipment, and ore-quality requirements. Existing approaches often assume de…
Adaptive Operator Selection in Bilevel Large Neighborhood Search for Electric Autonomous Dial-a-Ride Problem under Uncertainty
Ishara Hewa Pathiranange, Aneta Neumann
The electric autonomous dial-a-ride problem (EADARP) extends the classical dial-a-ride problem by incorporating battery and charging constraints for electric vehicles. In practice,…
Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints
Thilina Pathirage Don, Aneta Neumann, Frank Neumann
The travelling thief problem (TTP) is a well-known multi-component optimisation problem that captures the interdependence between two components: the tour across cities and the pac…
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…
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…
Bi-objective chance-constrained evolutionary optimization for large-scale open-pit mine scheduling under geological uncertainty
Ishara Hewa Pathiranage, Aneta Neumann
The open-pit mine scheduling problem (OPMSP) is a complex optimization problem in long-term mine planning that involves numerous operational and geological constraints. Traditional…
Evolutionary Algorithm for Chance Constrained Quadratic Multiple Knapsack Problem
Kokila Kasuni Perera, Aneta Neumann
Quadratic multiple knapsack problem (QMKP) is a combinatorial optimisation problem characterised by multiple weight capacity constraints and a profit function that combines linear…