On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems
From MaRDI portal
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Evolutionary algorithms for knapsack problems
- On the effectivity of evolutionary algorithms for the multidimensional knapsack problem
- Single- and multi-objective evolutionary algorithms for the knapsack problem with dynamically changing constraints
- Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem
- Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
- Analysis of solution quality of a multiobjective optimization-based evolutionary algorithm for knapsack problem
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- A new evolutionary algorithm for the multiobjective 0/1 knapasck problem
- Computational Science - ICCS 2004
Cited in
(4)
This page was built for publication: On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770486)