Solving a kind of high complexity multi-objective problems by a fast algorithm

DOI10.1007/BF02899476zbMATH Open1061.90104OpenAlexW2000864887MaRDI QIDQ4454474FDOQ4454474

Lixin Ding, Lishan Kang, Sanyou Zeng

Publication date: 8 March 2004

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02899476

zbMATH Keywords

evolutionary algorithmsPareto-optimal setmulti-objective optimizatio

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• SPEA2

   Recommendations

• Title not available (Why is that?) 👍 👎
• Fast annealing genetic algorithm for multi-objective optimization problems 👍 👎
• A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems 👍 👎
• Very fast non-dominated sorting 👍 👎
• A statistical model-based algorithm for ‘black-box’ multi-objective optimisation 👍 👎

This page was built for publication: Solving a kind of high complexity multi-objective problems by a fast algorithm

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