pymoo

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

21|1|Updated Mar 19, 2026
One-click install
npx skills add https://github.com/OwnLabAI/ownlab --skill pymoo-ownlabai
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/OwnLabAI/ownlab/tree/main/mart/skills/scientific-skills/pymoo
Command: npx skills add https://github.com/OwnLabAI/ownlab --skill pymoo-ownlabai

SYSTEM DOCUMENTATION & REQUIREMENTS

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

What problem does it solve?

This Skill helps users solve complex optimization problems with multiple objectives by providing a cohesive Python framework and ready-to-run examples.

Core Features & Use Cases

  • Unified minimize() API for single-, multi-, and many-objective problems
  • Supports NSGA-II/NSGA-III, MOEA/D, NSGA-R variants, and related algorithms
  • Benchmark problem suites (ZDT, DTLZ) and easy custom problem definitions via ElementwiseProblem
  • Constraint handling options, visualization tools (Scatter, PCP, Petal), and MCDM methods
  • Rich documentation, reusable scripts, and cross-domain applicability from engineering to research

Quick Start

Install dependencies, import pymoo, and run a basic NSGA-II optimization on a sample problem.

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?

To solve multi-objective optimization problems in Python, you can use a unified minimize() API that supports algorithms like NSGA-II and MOEA/D to find Pareto-optimal fronts and analyze trade-offs across conflicting objectives.

What is the best way to find Pareto-optimal fronts for many-objective engineering problems?

Finding Pareto-optimal fronts for many-objective engineering problems is best handled by algorithms like NSGA-III, which are specifically designed to handle many objectives and deliver a diverse set of optimal trade-off solutions.

Can I define custom optimization problems and constraints using this framework?

Yes, you can define custom optimization problems and constraints by subclassing ElementwiseProblem, allowing you to specify objective functions, variable bounds, and constraint handling options tailored to your specific engineering or research benchmark.

How do I visualize and analyze trade-offs after running a multi-objective optimization?

To visualize and analyze trade-offs after running a multi-objective optimization, you can use built-in visualization tools like Scatter, PCP, and Petal plots, alongside Multi-Criteria Decision Making (MCDM) methods to select optimal solutions.

Does this framework include benchmark problem suites for testing optimization algorithms?

Yes, this framework includes benchmark problem suites such as ZDT and DTLZ, providing standardized test problems to evaluate and compare the performance of multi-objective optimization algorithms like NSGA-II and MOEA/D.