Essential particle swarm optimization queen with tabu search for MKP resolution
From MaRDI portal
Publication:488403
DOI10.1007/s00607-013-0316-2zbMath1314.68293OpenAlexW2024158944WikidataQ124306192 ScholiaQ124306192MaRDI QIDQ488403
Publication date: 26 January 2015
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-013-0316-2
tabu searchhybridizationparticle swarm optimizationmultidimensional knapsack problemessential particle swarm optimization queen
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Heuristic algorithm for topology optimization of continuum structure, A comprehensive survey on particle swarm optimization algorithm and its applications, A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A heuristic algorithm for the multidimensional zero-one knapsack problem
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Tabu search techniques. A tutorial and an application to neural networks
- An algorithm for the solution of the 0-1 knapsack problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- A genetic algorithm for the multidimensional knapsack problem
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Improved results on the 0--1 multidimensional knapsack problem
- Future paths for integer programming and links to artificial intelligence
- A review of particle swarm optimization. I: Background and development
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- The Multidimensional Knapsack Problem: Structure and Algorithms
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A heuristic solution procedure for the multiconstraint zero-one knapsack problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- Some Convergence Results for Probabilistic Tabu Search
- Tabu Search—Part I
- Tabu Search—Part II
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- The Theory and Computation of Knapsack Functions
- Numerical Analysis and Its Applications
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
