Generalized decomposition and cross entropy methods for many-objective optimization
From MaRDI portal
Publication:507765
DOI10.1016/j.ins.2014.05.045zbMath1355.90091OpenAlexW2015371402WikidataQ57537296 ScholiaQ57537296MaRDI QIDQ507765
Peter J. Fleming, Robin C. Purshouse, Ioannis Giagkiozis
Publication date: 7 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: http://eprints.whiterose.ac.uk/74767/1/1029.pdf
convex optimizationdecomposition methodmany-objective optimizationcross entropy methodgeneralized decomposition
Related Items (8)
A tutorial on multiobjective optimization: fundamentals and evolutionary methods ⋮ Methods for constrained optimization of expensive mixed-integer multi-objective problems, with application to an internal combustion engine design problem ⋮ An adaptive decomposition-based evolutionary algorithm for many-objective optimization ⋮ A decomposition based evolutionary algorithm with direction vector adaption and selection enhancement ⋮ A new resource allocation strategy based on the relationship between subproblems for MOEA/D ⋮ Methods for multi-objective optimization: an analysis ⋮ A dual-population paradigm for evolutionary multiobjective optimization ⋮ An overview of population-based algorithms for multi-objective optimisation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- CVXGEN: a code generator for embedded convex optimization
- Methods for multi-objective optimization: an analysis
- Hierarchical Bayesian optimization algorithm. Toward a new generation of evolutionary algorithms. With a foreword by David E. Goldberg
- Natural exponential families with quadratic variance functions
- Nonlinear multiobjective optimization
- Distributing many points on a sphere
- Energy functionals, numerical integration and asymptotic equidistribution on the sphere.
- On scalarizing functions in multiobjective optimization
- The cross-entropy method for combinatorial and continuous optimization
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- A tutorial on the cross-entropy method
- A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation
- Distributing Points on the Sphere, I
- Convex Analysis
- Evolutionary Multi-Criterion Optimization
- Drift analysis and average time complexity of evolutionary algorithms
This page was built for publication: Generalized decomposition and cross entropy methods for many-objective optimization