A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
DOI10.1007/s12351-010-0084-0zbMath1256.90039OpenAlexW2010795210MaRDI QIDQ1937869
Mohammad Reza Bonyadi, Xiaodong Li
Publication date: 1 February 2013
Published in: Operational Research. An International Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12351-010-0084-0
swarm intelligencemultidimensional knapsack problemelectromagnetism-like meta-heuristicpopulation-based optimization
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
- Scatter search for the 0-1 multidimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- An electromagnetism-like mechanism for global optimization
- An ant colony optimization approach for the multidimensional knapsack problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A study of ACO capabilities for solving the maximum clique problem
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- Quantum Approach to Informatics
- The Theory and Computation of Knapsack Functions
This page was built for publication: A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
