Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm

DOI10.1007/S11047-011-9250-4MaRDI QIDQ1761699zbMATH OpenOpenAlexWikidataFDO

Authors Karthik Sindhya, Kalyanmoy Deb, Kaisa Miettinen

Publication date 15 November 2012

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-70135

zbMATH Keywords

achievement scalarizing functionsevolutionary algorithmshybrid algorithmsmulticriteria optimizationmultiple criteria decision makingNSGA-IIPareto optimality

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

• A new hybrid evolutionary multiobjective algorithm guided by descent directions
• A hybrid optimization technique coupling an evolutionary and a local search algorithm
• Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search
• A hybrid multiobjective evolutionary algorithm: Striking a balance with local search
• Evolutionary algorithm with a directional local search for multiobjective optimization in combinatorial problems

Cites work

• Applications of Multi-Objective Evolutionary Algorithms
• Evolution strategies. A comprehensive introduction
• Evolutionary Algorithms for Solving Multi-Objective Problems
• Experiments with classification-based scalarizing functions in interactive multiobjective optimization
• Genetic local search for multi-objective combinatorial optimization
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 1975082 (Why is no real title available?)
• scientific article; zbMATH DE number 5066287 (Why is no real title available?)
• Multi-objective optimization using evolutionary algorithms
• Nonlinear multiobjective optimization
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• On the use of preferential weights in interactive reference point based methods
• Optimization by simulated annealing
• Retrieval and use of the balance set in multiobjective global optimization
• Tabu Search—Part I
• Theory of multiobjective optimization
• Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP

Cited in

(9)

• Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search
• Trade-off analysis approach for interactive nonlinear multiobjective optimization
• A reinforcement learning approach for dynamic multi-objective optimization
• A hybrid optimization technique coupling an evolutionary and a local search algorithm
• A new hybrid evolutionary multiobjective algorithm guided by descent directions
• A hybrid elitist Pareto-based coordinate exchange algorithm for constructing multi-criteria optimal experimental designs
• A Broyden-based algorithm for multi-objective local-search optimization
• A hybrid multiobjective evolutionary algorithm: Striking a balance with local search
• PAINT: Pareto front interpolation for nonlinear multiobjective optimization

Describes a project that uses

Uses Software

• SPEA2
• KNITRO

This page was built for publication: Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm

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