Evolutionary algorithms for optimization problems with interval and hybrid indices

MaRDI QIDQ3180824zbMATH OpenFDO

Authors Xinfang Ji, Yali Kang, Xiangnan Kang

Publication date 6 January 2017

zbMATH Keywords

evolutionary optimizationhybrid indiceslarge populationuncertain preference

Mathematics Subject Classification ID

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

Recommendations

• Evolutionary algorithms with preference polyhedron for interval multi-objective optimization problems
• An interactive evolutionary algorithm for interval multi-objective optimization problems based on preference direction
• Optimizing interval higher-dimensional multi-objective problems using a set-based evolutionary algorithm incorporated with preferences
• Optimizing many-objective problems with interval parameters using set-based evolutionary algorithms
• Hybrid evolutionary algorithm for mixed-integer programming problems

Cited in

(2)

• Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
• Hybrid evolutionary algorithm for solving general variational inequality problems

This page was built for publication: Evolutionary algorithms for optimization problems with interval and hybrid indices

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