pymoo

Solve multi-objective optimization problems with NSGA-II, NSGA-III, MOEA/D, and SPEA2 algorithms.

13|3|Updated Jun 10, 2026
One-click install
npx skills add https://github.com/tassiovale/claude-code-kit --skill pymoo-tassiovale
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/tassiovale/claude-code-kit/tree/main/skills/pymoo
Command: npx skills add https://github.com/tassiovale/claude-code-kit --skill pymoo-tassiovale

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires numpy, scipy, matplotlib, autograd, joblib, pymoo, and includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill provides a comprehensive framework for solving multi-objective optimization problems, enabling users to find Pareto-optimal solutions and trade-off between conflicting objectives.

Core Features & Use Cases

  • Multi-Objective Optimization: Solve single and multi-objective problems using algorithms like NSGA-II, NSGA-III, MOEA/D, and SPEA2.
  • Benchmark Problems: Includes a suite of test problems like ZDT, DTLZ, and WFG for algorithm validation and benchmarking.
  • Custom Problem Definition: Allows users to define their own optimization problems with various constraints and variable types.
  • Visualization: Offers parallel coordinate plots, scatter plots, and other tools to visualize Pareto fronts and solution spaces.
  • Use Case: Imagine you are designing a new product and need to optimize its parameters to balance performance, cost, and other factors. Pymoo can help you explore different trade-offs and find the best solution.

Quick Start

To optimize a problem, first define your objectives and constraints, then use the appropriate algorithm and termination criteria. For example:

python3 scripts/many_objective_example.py

Frequently Asked Questions about pymoo

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I solve multi-objective optimization problems in Python?

Multi-objective optimization in Python can be solved by applying algorithms like NSGA-II or MOEA/D to find Pareto-optimal solutions. This framework calculates trade-offs between conflicting objectives for complex engineering design tasks.

What algorithms are available for finding Pareto-optimal solutions?

Available algorithms for finding Pareto-optimal solutions include NSGA-II, NSGA-III, MOEA/D, and SPEA2. These algorithms efficiently explore solution spaces to identify optimal trade-offs for complex multi-objective problems.

How do I define custom optimization problems with constraints?

Defining custom optimization problems involves specifying your objectives, variable types, and constraints within the framework. This allows you to tailor the multi-objective optimization process to your specific engineering or computational biology requirements.

Can I visualize the Pareto front and solution space?

Yes, you can visualize the Pareto front and solution space using matplotlib tools. The framework offers parallel coordinate plots and scatter plots to help you analyze the trade-offs and distribution of Pareto-optimal solutions.

What benchmark problems are included for algorithm validation?

Included benchmark problems for algorithm validation are ZDT, DTLZ, and WFG. These test problems allow you to evaluate and benchmark the performance of multi-objective optimization algorithms before applying them to custom engineering design tasks.

Do I need SciPy and NumPy to run multi-objective optimization?

Yes, you need NumPy and SciPy to run multi-objective optimization, as they are required dependencies. Optional libraries like matplotlib and autograd can also be used for visualization and gradient calculations.