Improved genetic algorithm based on particle swarm optimization-inspired reference point placement

DOI10.1080/0305215X.2018.1509961MaRDI QIDQ5059174zbMATH OpenOpenAlexWikidataFDO

Authors Ima O. Essiet, Yan-Xia Sun, Zenghui Wang

Publication date 23 December 2022

Published in Engineering Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0305215x.2018.1509961

zbMATH Keywords

hyper-planeinverted generational distancenon-dominated sorting genetic algorithmoptimizationreference points

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Reference-point-based particle swarm optimization algorithm for many-objective optimization
• A reference point constrained dominance-based NSGA-III algorithm
• An improved nondominated sorting genetic algorithm for multiobjective problem
• A memetic variant of R-NSGA-II for reference point problems
• scientific article; zbMATH DE number 5730180

Cites work

• Improved genetic algorithm based on particle swarm optimization-inspired reference point placement
• Introduction to evolutionary computing
• Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems

Cited in

(1)

• Improved genetic algorithm based on particle swarm optimization-inspired reference point placement

Describes a project that uses

Uses Software

• NBI
• HypE
• PlatEMO

This page was built for publication: Improved genetic algorithm based on particle swarm optimization-inspired reference point placement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059174)