scientific article; zbMATH DE number 1858037

MaRDI QIDQ4789008zbMATH OpenFDO

Authors Andrzej Jaszkiewicz

Publication date 22 January 2003

zbMATH Keywords

metaheuristicsmultiple objective optimizationinteractive methodscomputational effectivenessscalarizing functions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• scientific article; zbMATH DE number 1086965
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Interactive multiobjective optimization with the Pareto memetic algorithm

Cited in

(6)

• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
• Comparative analysis of multi-objective metaheuristic algorithms by means of performance metrics to continuous problems
• Experiments concerning sequential versus simultaneous maximization of objective function and distance
• Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations
• scientific article; zbMATH DE number 5774615 (Why is no real title available?)
• State space modeling \& Bayesian inference with computational intelligence

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication:

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