Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
From MaRDI portal
Publication:1994450
Recommendations
- Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Application of a new acceleration particle swarm optimization for solving multiple traveling salesman problems
- A kind of hybrid particle swarm optimization algorithm for solving 0-1 knapsack problems
- Particle swarm optimization for problems with variable number of dimensions
- A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A discrete particle swarm optimization method for feature selection in binary classification problems
- A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation
- A particle swarm algorithm for inspection optimization in serial multi-stage processes
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- An approximate dynamic programming approach to multidimensional knapsack problems
- An improved particle swarm optimization algorithm combined with piecewise linear chaotic map
- Balancing and optimizing a portfolio of R&D projects
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- Evolutionary algorithm to traveling salesman problems
- Improved results on the 0--1 multidimensional knapsack problem
- Integration of particle swarm optimization-based fuzzy neural network and artificial neural network for supplier selection
- Particle swarm optimization applied to the design of water supply systems
- Particle swarm with equilibrium strategy of selection for multi-objective optimization
- The multidimensional 0-1 knapsack problem: an overview.
Cited in
(19)- Two-dimensional knapsack-block packing problem
- A randomized heuristic repair for the multidimensional knapsack problem
- Autonomous mobile robot global path planning: a prior information-based particle swarm optimization approach
- A partheno-genetic algorithm for dynamic 0-1 multidimensional Knapsack problem
- Improved quantum particle swarm optimization algorithm for multi-dimensional multi-choice knapsack problem
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
- A novel characterization method of piezoelectric composite material based on particle swarm optimization algorithm
- Prepositioning emergency earthquake response supplies: a new multi-objective particle swarm optimization algorithm
- Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application
- A comprehensive survey on particle swarm optimization algorithm and its applications
- Opposition-based adaptive fireworks algorithm
- Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Essential particle swarm optimization queen with tabu search for MKP resolution
- Improving whale optimization algorithm for feature selection with a time-varying transfer function
- A novel simple particle swarm optimization algorithm for global optimization
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Gompertz PSO variants for knapsack and multi-knapsack problems
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
This page was built for publication: Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994450)
