Verified:GitHub

pymoo

Solve single and multi-objective optimization problems with evolutionary algorithms.

Updated Mar 10, 2026

Search Tags:#optimization #multi-objective #evolutionary algorithms #nsga-ii #nsga-iii #constraint handling #pareto front

Ready to run

npx skills add https://github.com/felixboehm/biochem-allergy --skill pymoo-felixboehm

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: pymoo
Source: https://github.com/felixboehm/biochem-allergy/tree/main/.claude/skills/pymoo
Command: npx skills add https://github.com/felixboehm/biochem-allergy --skill pymoo-felixboehm

SYSTEM DOCUMENTATION & REQUIREMENTS

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

What problem does it solve?

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

Core Features & Use Cases

Multi-Objective Optimization: Solves problems with 2 or more objectives using advanced algorithms like NSGA-II and NSGA-III.
Constraint Handling: Manages optimization problems with various types of constraints.
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 reduce environmental impact, exploring all viable trade-offs.

Quick Start

Use the pymoo skill to solve the ZDT1 multi-objective 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 balances conflicting goals by using evolutionary algorithms like NSGA-II to compute a set of optimal trade-off solutions. This framework provides a Pareto front representing the best viable compromises across all objectives.

What is the best way to visualize a Pareto front for evolutionary algorithm outputs?▼

To visualize a Pareto front, you can use built-in plotting tools to render solution distributions and trade-offs. This helps explore the solution space and evaluate design compromises generated by algorithms like NSGA-III.

Can I define custom optimization problems with specific constraints?▼

Yes, you can define custom optimization problems with specific constraints. The framework supports advanced constraint handling, allowing you to specify unique problem definitions and manage various constraint types during the evolutionary search.

When should I use NSGA-III instead of NSGA-II for multi-objective optimization?▼

You should use NSGA-III instead of NSGA-II when solving many-objective optimization problems involving three or more objectives. NSGA-III uses reference points to guide the evolutionary search, providing better convergence on high-dimensional Pareto fronts.

How do I minimize cost and maximize performance simultaneously in product design?▼

To minimize cost and maximize performance simultaneously, you apply multi-objective evolutionary algorithms to explore trade-offs. This generates a Pareto front of optimal solutions, allowing you to select the best design based on decision-making criteria.