Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
From MaRDI portal
Publication:1994450
DOI10.1016/j.apm.2013.08.009zbMath1427.90239OpenAlexW2039190904MaRDI QIDQ1994450
Mingchang Chih, Tsung-Yin Ou, Maw-Sheng Chern, Chin-Jung Lin
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
multidimensional knapsack problembinary particle swarm optimizationOR-librarytime-varying acceleration coefficients
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (14)
A randomized heuristic repair for the multidimensional knapsack problem ⋮ Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A comprehensive survey on particle swarm optimization algorithm and its applications ⋮ Autonomous mobile robot global path planning: a prior information-based particle swarm optimization approach ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application ⋮ Opposition-based adaptive fireworks algorithm ⋮ Two-dimensional knapsack-block packing problem ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem ⋮ Prepositioning emergency earthquake response supplies: a new multi-objective particle swarm optimization algorithm ⋮ A novel characterization method of piezoelectric composite material based on particle swarm optimization algorithm ⋮ Improving whale optimization algorithm for feature selection with a time-varying transfer function ⋮ A novel simple particle swarm optimization algorithm for global optimization ⋮ Stochastic stability analysis of particle swarm optimization with pseudo random number assignment strategy
Uses Software
Cites Work
- Unnamed Item
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- A particle swarm algorithm for inspection optimization in serial multi-stage processes
- Integration of particle swarm optimization-based fuzzy neural network and artificial neural network for supplier selection
- Evolutionary algorithm to traveling salesman problems
- A discrete particle swarm optimization method for feature selection in binary classification problems
- Particle swarm optimization applied to the design of water supply systems
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation
- Improved results on the 0--1 multidimensional knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- Particle swarm with equilibrium strategy of selection for multi-objective optimization
- An improved particle swarm optimization algorithm combined with piecewise linear chaotic map
- Balancing and optimizing a portfolio of R&D projects
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
This page was built for publication: Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem
