A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems
type: Item
instance of: scholarly article
title: A fast Pareto genetic algorithm approach for solving expensive multiobjective optimization problems
zbMATH Open document ID: 1211.90207
author: Hamidreza Eskandari
author: Christopher D. Geiger
published in: Journal of Heuristics
publication date: 2008-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5366798
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: evolutionary algorithms
zbMATH Keywords: Pareto optimality
describes a project that uses: AbYSS
describes a project that uses: PAES
describes a project that uses: Genocop
describes a project that uses: SPEA2
describes a project that uses: ParEGO
MaRDI profile type: Publication
full work available at URL: s10732-007-9037-z
OpenAlex ID: W2077345861
cites work: Applications of Multi-Objective Evolutionary Algorithms
cites work: Q4451071
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Q4868589
cites work: Q4692508
cites work: Global multiobjective optimization using evolutionary algorithms
cites work: Tackling real-coded genetic algorithms: operators and tools for behavioural analysis
cites work: Multi-objective tabu search using a multinomial probability mass function
cites work: Q4873721
DOI: 10.1007/S10732-007-9037-Z
description: scientific article; zbMATH DE number 5366798