Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems

Publication date: 4 October 2006

Published in: International Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristics genetic algorithms combinatorial optimisation multidimensional knapsack problems genetic algorithm convergence initial population generation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ A Genetic Algorithm for Optimization of a Relational Knapsack Problem with Respect to a Description Logic Knowledge Base ⋮ The Effect of Initial Population Sampling on the Convergence of Multi-Objective Genetic Algorithms

This page was built for publication: Improving genetic algorithm convergence using problem structure and domain knowledge in multidimensional knapsack problems