Set Branching in Constraint Optimization

@inproceedings{Kitching2003SetBI,
  title={Set Branching in Constraint Optimization},
  author={Matthew Kitching and Fahiem Bacchus},
  booktitle={IJCAI},
  year={2003}
}
This paper is about the evolutionary design of multi-agent systems. An important part of recent research in this domain has been focusing on collaborative coevolutionary methods. We expose possible drawbacks of these methods, and show that for a non-trivial problem called the “blind mice” problem, a classical GA approach in which whole populations are evaluated, selected and crossed together (with a few tweaks) finds an elegant and non-intuitive solution more efficiently than cooperative… CONTINUE READING
3 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A collective genetic algorithm

  • J. Bruten
  • Proceedings of the Genetic and Evolutionary…
  • 2001

An empirical analysis of collaboration methods in cooperative coevolutionary algorithms

  • Wiegand
  • 2001

In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001)

  • Thomas Miconi. A collective genetic algorithm
  • pages 876– 883. Morgan Kaufmann,
  • 2001
1 Excerpt

DeJong . An empirical analysis of collaboration methods in cooperative coevolutionary algorithms

  • R. Paul Wiegand, William C. Liles, A. Kenneth
  • 1994

Goldberg.Genetic Algorithms in Search, Optimization and Machine Learning

  • E. David
  • AddisonWesley,
  • 1989

Similar Papers

Loading similar papers…