Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
From MaRDI portal
Publication:377748
DOI10.1007/s10898-012-0006-1zbMath1315.90033MaRDI QIDQ377748
Zahra Beheshti, Siti Sophiayati Yuhaniz, Siti Mariyam Hj. Shamsuddin
Publication date: 7 November 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0006-1
NP-hard problem; combinatorial optimization problem; meta-heuristic algorithm; multidimensional knapsack problem; binary accelerated particle swarm algorithm; binary particle swarm optimization
90C27: Combinatorial optimization
Related Items
Fusion global-local-topology particle swarm optimization for global optimization problems, A novel \(x\)-shaped binary particle swarm optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- A tabu search algorithm for the covering design problem
- Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem
- Knapsack problem with probability constraints
- A random-key genetic algorithm for the generalized traveling salesman problem
- A discrete version of particle swarm optimization for flowshop scheduling problems
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- Ant colony approach to constrained redundancy optimization in binary systems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- MINTO, a Mixed INTeger Optimizer
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A greedy genetic algorithm for the quadratic assignment problem
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- Particle swarm optimization-based algorithms for TSP and generalized TSP
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
- Solving Large-Scale Zero-One Linear Programming Problems
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- Tabu Search—Part I
- Tabu Search—Part II
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A multidimensional knapsack model for asset-backed securitization
- The Theory and Computation of Knapsack Functions
- Numerical Analysis and Its Applications
