Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
type: Item
instance of: scholarly article
title: Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
zbMATH Open document ID: 1315.90033
author: Zahra Beheshti
author: Siti Mariyam Shamsuddin
author: Siti Sophiayati Yuhaniz
published in: Journal of Global Optimization
publication date: 2013-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6223482
zbMATH Keywords: combinatorial optimization problem
zbMATH Keywords: NP-hard problem
zbMATH Keywords: meta-heuristic algorithm
zbMATH Keywords: binary particle swarm optimization
zbMATH Keywords: binary accelerated particle swarm algorithm
zbMATH Keywords: multidimensional knapsack problem
describes a project that uses: OR-Library
describes a project that uses: MINTO
MaRDI profile type: Publication
full work available at URL: s10898-012-0006-1
OpenAlex ID: W2032020700
cites work: Q3095475
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: A random-key genetic algorithm for the generalized traveling salesman problem
cites work: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
cites work: A new ant colony optimization algorithm for the multidimensional Knapsack problem
cites work: Particle swarm optimization-based algorithms for TSP and generalized TSP
cites work: A tabu search algorithm for the covering design problem
cites work: SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
cites work: Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique
cites work: Q4079017
cites work: A greedy genetic algorithm for the quadratic assignment problem
cites work: A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
cites work: A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots
cites work: Optimization by Simulated Annealing
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A cooperative parallel tabu search algorithm for the quadratic assignment problem
cites work: Q3553687
cites work: A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
cites work: A discrete version of particle swarm optimization for flowshop scheduling problems
cites work: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
cites work: A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
cites work: A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
cites work: Ant colony approach to constrained redundancy optimization in binary systems
cites work: Q4198056
cites work: Knapsack problem with probability constraints
cites work: Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
cites work: Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: MINTO, a Mixed INTeger Optimizer
cites work: A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: A multidimensional knapsack model for asset-backed securitization
cites work: The Theory and Computation of Knapsack Functions
cites work: A knapsack-type public key cryptosystem based on arithmetic in finite fields
cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem
cites work: Numerical Analysis and Its Applications
cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem
DOI: 10.1007/S10898-012-0006-1
description: scientific article; zbMATH DE number 6223482