Research map / Learning theory and algorithms / Combinatorial and search optimization
Rigorous Runtime Analysis of MOEA/D for Solving Multi-Objective Minimum Weight Base Problems
Anh Viet Do, Aneta Neumann, Frank Neumann, Andrew M. Sutton
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 1 | success rate: 2/10 -> 10/10 | Improved |
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 2 | success rate: 0/10 -> 10/10 | Improved |
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 7 | success rate: 3/10 -> 10/10 | Improved |
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 8 | success rate: 1/10 -> 10/10 | Improved |
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 12 | success rate: 0/10 -> 10/10 | Improved |
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 1 | T / max evaluations: 79$\pm$11\% -> 50$\pm$15\% | Improved |
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 7 | T / max evaluations: 86$\pm$13\% -> 41$\pm$11\% | Improved |
| use MOEA/D instead of GSEMO | MOEA/D · bi-objective MST, instance 8 | T / max evaluations: 94$\pm$0\% -> 40$\pm$8.1\% | Improved |
| smallest m-n instances (5 and 6) are expected to be easiest but need largest budget fraction | MOEA/D · bi-objective MST, instances 5 and 6 | T / max evaluations: 63$\pm$15\% and 58$\pm$11\% | Mixed |
| increase edges from 150 to 300 at 25 nodes | MOEA/D · bi-objective MST, instances 1 vs 7 | T / max evaluations: 50$\pm$15\% -> 41$\pm$11\% | No clear effect |
Closest papers by meaning
- Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms (AAAI 2024 · similarity 0.86)
- Speeding Up the NSGA-II with a Simple Tie-Breaking Rule (AAAI 2025 · similarity 0.85)
- Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces (AAAI 2025 · similarity 0.85)
- Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees (ICML 2025 · similarity 0.84)
- Approximation algorithms for combinatorial optimization with predictions (ICLR 2025 · similarity 0.84)
- Runtime Analysis of the SMS-EMOA for Many-Objective Optimization (AAAI 2024 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
