Skip to content

Foundations of multi-objective optimization

This learning path explains the ideas behind VAMOS rather than its interface. It starts from zero (what it means to optimize several objectives at once) and ends with the questions researchers face when they compare algorithms. Every lesson has interactive figures you can manipulate, runnable VAMOS code, and references to the papers where each idea was introduced.

You need no previous knowledge of optimization. Basic mathematical notation (vectors, sums, minimum and maximum) is enough to follow the text; Python is only needed to run the code.

Three levels

Level Lessons After it you can
Basic B1. What is a multi-objective problem? · B2. Pareto dominance and the Pareto front · B3. What makes a good approximation? · B4. Quality indicators Formulate a problem with several objectives, reason with Pareto dominance, judge an approximation set and compute the standard quality indicators.
Intermediate I1. NSGA-II at a glance · I2. Fast non-dominated sorting · I3. Crowding distance and tournament selection · I4. Variation: SBX and polynomial mutation · I5. Elitist survival and the complete generation · I6. Beyond NSGA-II · I7. SPEA2 · I8. MOEA/D · I9. SMS-EMOA · I10. IBEA · I11. SMPSO Explain every step of NSGA-II and the code that implements it in VAMOS, place it among the Pareto-based, decomposition-based and indicator-based families, and explain in the same depth SPEA2, MOEA/D, SMS-EMOA, IBEA and SMPSO.
Advanced A1. Many-objective optimization · A2. NSGA-III · A3. RVEA · A4. AGE-MOEA · A5. Constrained multi-objective optimization · A6. CCMO · A7. C-TAEA · A8. ToP · A9. CMOEA-MS · A10. Comparing algorithms rigorously Recognize why four or more objectives and constraints change the problem, explain the many-objective and constrained algorithms of VAMOS, and design a comparison whose conclusions survive scrutiny.

Read the levels in order the first time. Within a level, each lesson builds on the previous one and ends with a link to the next.

How the interactive figures work

The figures run in your browser. You can drag the points, or focus one with Tab and move it with the arrow keys (hold Shift for larger steps). Sliders and buttons change the data, and a readout next to each figure states the numbers that the picture shows.

The figures use a small JavaScript port of the same algorithms that VAMOS implements in Python: non-dominated sorting, crowding distance, simulated binary crossover, polynomial mutation and the two-objective quality indicators. Their results are checked against VAMOS and MooCore, but they exist to teach; use VAMOS itself for real experiments. Without JavaScript the figures do not appear, and the text of every lesson remains complete.

Run the code

Each lesson ends with a short program that uses the public VAMOS interface. Install VAMOS first, following the installation guide:

python -m pip install "vamos-optimization==1.5.0"

The quality-indicator examples also use MooCore, the indicator library that the quality and budget tutorial uses as well:

python -m pip install moocore

The outputs printed in the lessons come from VAMOS 1.5.0 with the NumPy engine. Values computed by an optimization run can differ in their last digits in another environment; a seed makes a run repeatable in the same environment, not bitwise identical everywhere.

Where to go next

After the Basic level you can already read a result: T01. Your first meaningful result applies B2 to a real run. After the Intermediate level, the algorithm lessons show each built-in algorithm with its exact configuration. The Advanced level leads to the study tutorials, where comparisons are planned, measured and reported with saved evidence.

Further reading

These books and tutorials cover the whole path in more depth. Each lesson cites the original papers for its own topic.