Essential particle swarm optimization queen with tabu search for MKP resolution

DOI10.1007/S00607-013-0316-2zbMATH Open1314.68293OpenAlexW2024158944WikidataQ124306192 ScholiaQ124306192MaRDI QIDQ488403FDOQ488403

Habib Chabchoub, Raida Ktari

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

Recommendations

• Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
• The hybrid tabu search and particle swarm optimization algorithm for mixed discrete optimization problems
• A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem

zbMATH Keywords

particle swarm optimizationhybridizationtabu searchmultidimensional knapsack problemessential particle swarm optimization queen

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Ant colony optimization.
• Future paths for integer programming and links to artificial intelligence
• Title not available (Why is that?)
• Tabu Search—Part I
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Improved results on the 0--1 multidimensional knapsack problem
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• The multidimensional knapsack problem: structure and algorithms
• Tabu Search—Part II
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
• A genetic algorithm for the multidimensional knapsack problem
• The Theory and Computation of Knapsack Functions
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Competitive analysis for dynamic multiperiod uncapacitated routing problems
• A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
• A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
• Numerical Analysis and Its Applications
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• A heuristic solution procedure for the multiconstraint zero-one knapsack problem
• A review of particle swarm optimization. I: Background and development
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• An Improved Heuristic for Multidimensional 0-1 Knapsack Problems
• Tabu search techniques. A tutorial and an application to neural networks
• An algorithm for the solution of the 0-1 knapsack problem
• Title not available (Why is that?)
• Pivot and Complement–A Heuristic for 0-1 Programming
• Some Convergence Results for Probabilistic Tabu Search

Cited In (3)

• Heuristic algorithm for topology optimization of continuum structure
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• A comprehensive survey on particle swarm optimization algorithm and its applications

Uses Software

• OR-Library

This page was built for publication: Essential particle swarm optimization queen with tabu search for MKP resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488403)