MOEA/D (Multi-objective evolutionary algorithm based on decomposition) is a general-purpose algorithm framework. It decomposes a multi-objective optimization problem into a number of single-objective optimization sub-problems (or simple multi-objective optimization problems) and then uses a search heuristic to optimize these sub-problems simultaneously and cooperatively.
In order to share and learn from other researchers from the MOEA/D community, to report up-to-date developments and results, and to discuss new ideas, the MOEA/D website provides an active mailing-list, and advertises meetings and workshops held in major conferences from the field in a regular basis.
News and upcoming events
- New IEEE CIS Task Force on Decomposition-based Techniques in Evolutionary Computation (chair: Ke Li)
- New MOEA/D package in R (written by Felipe Campelo, Lucas Batista, Claus Aranha) [sources]