Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
From MaRDI portal
Publication:1994450
DOI10.1016/J.APM.2013.08.009zbMATH Open1427.90239OpenAlexW2039190904MaRDI QIDQ1994450FDOQ1994450
Authors: Mingchang Chih, Chin-Jung Lin, Maw-Sheng Chern, Tsung-Yin Ou 
Publication date: 1 November 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.08.009
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
multidimensional knapsack problembinary particle swarm optimizationOR-librarytime-varying acceleration coefficients
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- Title not available (Why is that?)
- Particle swarm optimization applied to the design of water supply systems
- Improved results on the 0--1 multidimensional knapsack problem
- An approximate dynamic programming approach to multidimensional knapsack problems
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- A discrete particle swarm optimization method for feature selection in binary classification problems
- The multidimensional 0-1 knapsack problem: an overview.
- Particle swarm with equilibrium strategy of selection for multi-objective optimization
- Balancing and optimizing a portfolio of R&D projects
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A particle swarm algorithm for inspection optimization in serial multi-stage processes
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation
- An improved particle swarm optimization algorithm combined with piecewise linear chaotic map
- Integration of particle swarm optimization-based fuzzy neural network and artificial neural network for supplier selection
- An ant colony optimization approach for the multidimensional knapsack problem
- Evolutionary algorithm to traveling salesman problems
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
- A novel simple particle swarm optimization algorithm for global optimization
- Improving whale optimization algorithm for feature selection with a time-varying transfer function
- 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
Uses Software
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)
