On gradient-based local search to hybridize multi-objective evolutionary algorithms

DOI10.1007/978-3-642-32726-1_9MaRDI QIDQ4649209zbMATH OpenOpenAlexFDO

Authors Adriana Lara, Oliver Schütze, Carlos A. Coello Coello

Publication date 20 November 2012

Published in EVOLVE- A Bridge between Probability, Set Oriented Numerics and Evolutionary Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32726-1_9

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)

Recommendations

• The gradient subspace approximation and its application to bi-objective optimization problems
• Using a Gradient Based Method to Seed an EMO Algorithm
• scientific article; zbMATH DE number 2013532
• Gradient projection and local region search for multiobjective optimisation
• A new hybrid evolutionary multiobjective algorithm guided by descent directions

Cites work

• Applications of Multi-Objective Evolutionary Algorithms
• Covering Pareto sets by multilevel subdivision techniques
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Evolutionary Multi-Criterion Optimization
• Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
• Genetic local search for multi-objective combinatorial optimization
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• scientific article; zbMATH DE number 2013532 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 2209474 (Why is no real title available?)
• Multi-objective optimization using evolutionary algorithms
• Nonlinear multiobjective optimization. A generalized homotopy approach
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Steepest descent methods for multicriteria optimization.
• Stochastic method for the solution of unconstrained vector optimization problems
• The directed search method for multi-objective memetic algorithms

Cited in

(10)

• Gradient subspace approximation: a direct search method for memetic computing
• The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume
• A Hybrid Algorithm for the Simple Cell Mapping Method in Multi-objective Optimization
• On steering dominated points in hypervolume indicator gradient ascent for bi-objective optimization
• scientific article; zbMATH DE number 2013532 (Why is no real title available?)
• scientific article; zbMATH DE number 1784917 (Why is no real title available?)
• The gradient subspace approximation and its application to bi-objective optimization problems
• A gradient-based search method for multi-objective optimization problems
• A hybrid multiobjective evolutionary algorithm: Striking a balance with local search
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima

This page was built for publication: On gradient-based local search to hybridize multi-objective evolutionary algorithms

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