The directed search method for multi-objective memetic algorithms
From MaRDI portal
Publication:5963675
DOI10.1007/S10589-015-9774-0zbMATH Open1332.90261OpenAlexW2098704402MaRDI QIDQ5963675FDOQ5963675
Authors: Oliver Schütze, Adanay Martín, Adriana Lara, Sergio Alvarado, Eduardo Salinas, Carlos A. Coello Coello 
Publication date: 23 February 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9774-0
Recommendations
- The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems
- Direct Multisearch for Multiobjective Optimization
- Multi-directional local search
- The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume
- Enhanced directed search: a continuation method for mixed-integer multi-objective optimization problems
Cites Work
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multi-objective optimization using evolutionary algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- MULTIPLE PARAMETER CONTINUATION: COMPUTING IMPLICITLY DEFINED k-MANIFOLDS
- Nonlinear multiobjective optimization. A generalized homotopy approach
- Problems and methods with multiple objective functions
- Multi agent collaborative search based on Tchebycheff decomposition
- A modified NBI and NC method for the solution of \(N\)-multiobjective optimization problems
- Integrating Cross-Dominance Adaptation in Multi-Objective Memetic Algorithms
- Tracing the Pareto frontier in bi-objective optimization problems by ODE techniques
- Triangulating smooth submanifolds with light scaffolding
- Stochastic method for the solution of unconstrained vector optimization problems
Cited In (16)
- A tutorial on multiobjective optimization: fundamentals and evolutionary methods
- Computing the set of approximate solutions of a multi-objective optimization problem by means of cell mapping techniques
- On steering dominated points in hypervolume indicator gradient ascent for bi-objective optimization
- A memetic variant of R-NSGA-II for reference point problems
- Multi-directional local search
- The Gradient Subspace Approximation and Its Application to Bi-objective Optimization Problems
- The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems
- Kernel-based hybrid multi-objective optimization algorithm (KHMO)
- Title not available (Why is that?)
- A memetic procedure for global multi-objective optimization
- A PRP type conjugate gradient method without truncation for nonconvex vector optimization
- Multi-objective retrospective optimization using stochastic zigzag search
- On gradient-based local search to hybridize multi-objective evolutionary algorithms
- Gradient subspace approximation: a direct search method for memetic computing
- A Broyden-based algorithm for multi-objective local-search optimization
- Direct Multisearch for Multiobjective Optimization
Uses Software
This page was built for publication: The directed search method for multi-objective memetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963675)
