pymoo

Solve multi-objective optimization problems using evolutionary algorithms like NSGA-II.

8|Updated Nov 19, 2025
One-click install
npx skills add https://github.com/sanand0/scientific-research --skill pymoo-sanand0
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/sanand0/scientific-research/tree/main/.claude/skills/pymoo
Command: npx skills add https://github.com/sanand0/scientific-research --skill pymoo-sanand0

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill tackles complex optimization problems where multiple, often conflicting, objectives need to be optimized simultaneously, providing a set of optimal trade-off solutions.

Core Features & Use Cases

  • Multi-Objective Optimization: Solves problems with 2 or more objectives using state-of-the-art algorithms like NSGA-II and NSGA-III.
  • Constraint Handling: Manages problems with various types of constraints to ensure feasible solutions.
  • Custom Problem Definition: Allows users to define their own unique optimization problems.
  • Visualization: Provides tools to visualize Pareto fronts and solution distributions.
  • Use Case: Optimize a product design to simultaneously minimize cost, maximize performance, and minimize environmental impact.

Quick Start

Use the pymoo skill to solve the ZDT1 multi-objective optimization problem for 200 generations.

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 with conflicting objectives?

Multi-objective optimization is solved using evolutionary algorithms like NSGA-II to find a set of optimal trade-off solutions. This framework handles simultaneous optimization and provides Pareto front visualization for decision-making.

What is a Pareto front and when do I need it for engineering design?

A Pareto front represents the set of non-dominated solutions where no objective can be improved without degrading another. You need it for engineering design or resource allocation scenarios requiring trade-off analysis between conflicting goals like cost, performance, and environmental impact.

How do I define custom optimization problems and handle constraints?

You can define custom optimization problems by specifying your objectives and variables within the framework. It includes built-in constraint handling mechanisms to evaluate and manage various constraint types, ensuring the evolutionary algorithm only explores feasible solutions.

Can I use evolutionary algorithms for many-objective optimization with more than two objectives?

Yes, you can solve many-objective optimization problems with three or more objectives using algorithms like NSGA-III. The framework extends standard multi-objective evolutionary algorithms to handle higher-dimensional objective spaces effectively.

What is the best way to visualize solution sets from NSGA-II?

The best way to visualize solution sets from NSGA-II is using the framework's built-in visualization tools. These tools allow you to plot and analyze the distribution of solutions along the Pareto front to evaluate trade-offs effectively.

Does this framework support single-objective optimization or is it strictly multi-objective?

The framework supports both single-objective and multi-objective optimization. While it specializes in finding trade-off solutions using algorithms like NSGA-II, it also provides comprehensive algorithms for standard single-objective evolutionary optimization.