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

DOI10.1023/B:NACO.0000023415.22052.55MaRDI QIDQ1768780zbMATH OpenOpenAlexFDO

Authors Marco Laumanns, Lothar Thiele, Eckart Zitzler

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

knapsack problemmultiobjective optimizationevolutionary algorithmsPareto setgraph searchrunning time analysisdecision space partition

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) 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

• Foundations of Genetic Algorithms
• Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
• Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem
• Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem
• Analysis of solution quality of a multiobjective optimization-based evolutionary algorithm for knapsack problem

Cited in

(17)

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

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

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