Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem

DOI10.1023/B:NACO.0000023415.22052.55zbMath1074.68065OpenAlexW1976513030MaRDI QIDQ1768780

Marco Laumanns, Eckart Zitzler, Lothar Thiele

Publication date: 15 March 2005

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:naco.0000023415.22052.55

zbMATH Keywords

multiobjective optimizationknapsack problemevolutionary algorithmsgraph searchPareto setrunning time analysisdecision space partition

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (14)

Variable and large neighborhood search to solve the multiobjective set covering problem ⋮ NNIA-RS: A multi-objective optimization based recommender system ⋮ A comprehensive survey on the multiple traveling salesman problem: applications, approaches and taxonomy ⋮ Evolutionary algorithms for multi-objective stochastic resource availability cost problem ⋮ Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem ⋮ A novel heuristic method for the energy-efficient flexible job-shop scheduling problem with sequence-dependent set-up and transportation time ⋮ Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II) ⋮ Population size matters: rigorous runtime results for maximizing the hypervolume indicator ⋮ On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems ⋮ A study on evolutionary multi-objective optimization for flow geometry design ⋮ Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem ⋮ A new definition and calculation model for evolutionary multi-objective optimization ⋮ Reference-point-based multi-objective optimization algorithm with opposition-based voting scheme for multi-label feature selection ⋮ Labeling algorithms for multiple objective integer knapsack problems

This page was built for publication: Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem