Evolutionary Algorithms for Solving Multi-Objective Problems¶
Coello Coello, C. A., Lamont, & Van Veldhuizen, D. A. (2007). Evolutionary Algorithms for Solving Multi-Objective Problems. Springer.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Multiobjective Optimization
- The tooling ecosystem includes: specialized MOO libraries (pymoo in Python, PlatEMO in MATLAB, jMetal in Java, DEAP for evolutionary MOO); solver extensions in general-purpose optimization packages (AMPL, GAMS, JuMP, Pyomo all support MOO to varying degrees); visualization tools for Pareto frontiers (parallel coordinates, scatter plots, glyph plots for high-dimensional fronts); and substantial tutorial literature (Miettinen 1999, Deb 2001, Coello Coello, Lamont, and Van Veldhuizen (2007), and Branke et al. 2008 as canonical references).
This sourceCanonical reference on evolutionary multiobjective optimization covering algorithms, tooling, performance assessment, and applications.
Supported in partVerified against the publisher's abstract
Abstract confirms a classroom-adapted textbook on evolutionary multiobjective algorithms; it says nothing about the libraries, solvers, or visualization tools listed.
“This textbook is a second edition of Evolutionary Algorithms for Solving Multi-Objective Problems, significantly expanded and adapted for the classroom.”
- The tooling ecosystem includes: specialized MOO libraries (pymoo in Python, PlatEMO in MATLAB, jMetal in Java, DEAP for evolutionary MOO); solver extensions in general-purpose optimization packages (AMPL, GAMS, JuMP, Pyomo all support MOO to varying degrees); visualization tools for Pareto frontiers (parallel coordinates, scatter plots, glyph plots for high-dimensional fronts); and substantial tutorial literature (Miettinen 1999, Deb 2001, Coello Coello, Lamont, and Van Veldhuizen (2007), and Branke et al. 2008 as canonical references).
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:8b999ce7a847 · see in the full table