Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem-Reference-Cited by-同舟云学术

Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem

Published:2024-07-14 Issue: Volume: Page:520-528
ISSN:
Container-title:Proceedings of the Genetic and Evolutionary Computation Conference
language:
Short-container-title:

Author:

Hewa Pathiranage Ishara¹^ORCID,Neumann Frank¹^ORCID,Antipov Denis¹^ORCID,Neumann Aneta¹^ORCID

Affiliation:

1. Optimisation and Logistics,School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia

Funder

Australian Research Council

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3638529.3654067

Reference41 articles.

1. Resource and Network Management for Satellite Communications Systems: A Chance-Constrained Approach

2. Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem

3. Hirad Assimi, Oscar Harper, Yue Xie, Aneta Neumann, and Frank Neumann. 2020. Evolutionary bi-objective optimization for the dynamic chance-constrained knapsack problem based on tail bound objectives. In European Conference on Artificial Intelligence, ECAI 2020, Vol. 325. IOS Press, 307--314.

4. Runtime analysis of randomized search heuristics for dynamic graph coloring

5. Leslie Pérez Cáceres and Thomas Stützle (Eds.). 2023. Evolutionary Computation in Combinatorial Optimization - 23rd European Conference, EvoCOP 2023, Held as Part of EvoStar 2023, Brno, Czech Republic, 2023, Proceedings. Lecture Notes in Computer Science, Vol. 13987. Springer.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weighted-Scenario Optimisation for the Chance Constrained Travelling Thief Problem;2025 IEEE Congress on Evolutionary Computation (CEC);2025-06-08

2. Evolving Reliable Differentiating Constraints for the Chance-constrained Maximum Coverage Problem;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

3. Sampling-based Pareto Optimization for Chance-constrained Monotone Submodular Problems;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

4. Using 3-Objective Evolutionary Algorithms for the Dynamic Chance Constrained Knapsack Problem;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

5. Multi-Objective Evolutionary Algorithms with Sliding Window Selection for the Dynamic Chance-Constrained Knapsack Problem;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14