Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence

DOI10.1080/00207160.2012.742514zbMath1361.68198OpenAlexW1972070025MaRDI QIDQ2855721

Sunanda Gupta, M. L. Garg

Publication date: 22 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.742514

zbMATH Keywords

genetic algorithmdiversitypremature convergencemulti-dimensional knapsack problembinary trie coding scheme

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Boolean programming (90C09) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Greedy algorithm for the general multidimensional knapsack problem
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1

This page was built for publication: Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence