Research map / Learning theory and algorithms / Combinatorial and search optimization
An Ant-Based Algorithm to Solve Distributed Constraint Optimization Problems
Ziyu Chen, Tengfei Wu, Yanchen Deng, Cheng Zhang
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 ACO DCOP instead of DSA, MGM2, DSAN, D-Gibbs, GDBA, ACO DCSP | DCOP solvers · Sparse random DCOPs | solution cost: 7.5%∼12.8% | Improved |
| use ACO DCOP instead of competitors other than GDBA | DCOP solvers · Dense random DCOPs | solution cost: 0.4%∼23.1% | Improved |
| use ACO DCOP instead of GDBA | DCOP solvers · Dense random DCOPs | solution cost | Hurt |
| use ACO DCOP instead of ACO DCSP and others | DCOP solvers · Weighted graph coloring | solution cost: 34.1%∼63.8% | Improved |
| use ACO DCOP instead of ant solver ACO DCSP | DCOP solvers · Sparse random DCOPs | solution cost | Improved |
| use pheromone-biased probabilities instead of fixed probabilities (D-Gibbs) | stochastic DCOP solvers · Dense random DCOPs | solution cost | Improved |
| use MGM2 instead of DSA | local search DCOP · Sparse random DCOPs | solution cost | Improved |
| increase number of ants K with problem size (50 -> 70 agents, p1=0.1) | ACO DCOP · Random DCOPs | recommended K: 8 -> 13 | Mixed |
| increase constraint density p1 from 0.1 to 0.6 (n=70) | ACO DCOP · Random DCOPs | recommended K: 13 -> 20 | Mixed |
| add pipelining to ACO DCOP | ACO DCOP · DCOPs | solving time | Improved |
Closest papers by meaning
- A Particle Swarm Based Algorithm for Functional Distributed Constraint Optimization Problems (AAAI 2020 · similarity 0.88)
- Pretrained Cost Model for Distributed Constraint Optimization Problems (AAAI 2022 · similarity 0.86)
- CoCoA: A Non-Iterative Approach to a Local Search (A)DCOP Solver (AAAI 2017 · similarity 0.86)
- DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimization (NeurIPS 2023 · similarity 0.85)
- On the Complexity of Finite-Sum Smooth Optimization under the Polyak–Łojasiewicz Condition (ICML 2024 · similarity 0.80)
- CO-Bench: Benchmarking Language Model Agents in Algorithm Search for Combinatorial Optimization (AAAI 2026 · similarity 0.79)
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.
