On Gradient-Based Local Search to Hybridize Multi-objective Evolutionary Algorithms

DOI10.1007/978-3-642-32726-1_9zbMath1251.68208OpenAlexW42955995MaRDI QIDQ4649209

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

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

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stochastic method for the solution of unconstrained vector optimization problems
• Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
• Steepest descent methods for multicriteria optimization.
• Nonlinear multiobjective optimization. A generalized homotopy approach
• Covering Pareto sets by multilevel subdivision techniques
• Applications of Multi-Objective Evolutionary Algorithms
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Evolutionary Multi-Criterion Optimization
• Genetic local search for multi-objective combinatorial optimization
• The directed search method for multi-objective memetic algorithms

This page was built for publication: On Gradient-Based Local Search to Hybridize Multi-objective Evolutionary Algorithms