A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
From MaRDI portal
Publication:443043
DOI10.1155/2012/703601zbMath1244.90257OpenAlexW1971842476WikidataQ58907191 ScholiaQ58907191MaRDI QIDQ443043
Publication date: 6 August 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/703601
Approximation methods and heuristics in mathematical programming (90C59) Fuzzy control/observation systems (93C42) Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Boolean programming (90C09)
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, A special mutation operator in the genetic algorithm for fixed point problems, Neurogenetic algorithm for solving combinatorial engineering problems
Uses Software
Cites Work
- A genetic algorithm with fuzzy crossover operator and probability
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- Tackling real-coded genetic algorithms: operators and tools for behavioural analysis
- A genetic algorithm for the multidimensional knapsack problem
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- A formal analysis of the role of multi-point crossover in genetic algorithms
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Introduction to Genetic Algorithms
- Machine Learning: ECML 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
