Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems
Published 2012 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems
Authors
Keywords
Combinatorial Optimization Problem, NP-hard problem, Meta-heuristic algorithm, Binary Particle Swarm Optimization, Binary Accelerated Particle Swarm Algorithm, Multidimensional Knapsack Problem
Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 57, Issue 2, Pages 549-573
Publisher
Springer Nature
Online
2012-12-13
DOI
10.1007/s10898-012-0006-1
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique
- (2012) Wei-feng Gao et al. Communications in Nonlinear Science and Numerical Simulation
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- (2011) Q. Zhang et al. COMPUTERS & OPERATIONS RESEARCH
- A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems
- (2011) Ghorbanali Moslemipour et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- A Novel Binary Ant Colony Optimization: Application to the Unit Commitment Problem of Power Systems
- (2011) Se-Hwan Jang et al. Journal of Electrical Engineering & Technology
- Kernel search: A general heuristic for the multi-dimensional knapsack problem
- (2010) Enrico Angelelli et al. COMPUTERS & OPERATIONS RESEARCH
- An effective hybrid PSO-based algorithm for planning UMTS terrestrial access networks
- (2010) S. Mehdi Hashemi et al. ENGINEERING OPTIMIZATION
- Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem
- (2010) Nikolaos Argyris et al. JOURNAL OF GLOBAL OPTIMIZATION
- Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
- (2010) George Mavrotas et al. JOURNAL OF GLOBAL OPTIMIZATION
- Knapsack problem with probability constraints
- (2010) Alexei A. Gaivoronski et al. JOURNAL OF GLOBAL OPTIMIZATION
- A tabu search algorithm for the covering design problem
- (2010) Kamal Fadlaoui et al. JOURNAL OF HEURISTICS
- Ant colony approach to constrained redundancy optimization in binary systems
- (2009) Manju Agarwal et al. APPLIED MATHEMATICAL MODELLING
- Application of Genetic Algorithms to Solve the Multidepot Vehicle Routing Problem
- (2009) H C W Lau et al. IEEE Transactions on Automation Science and Engineering
- Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem
- (2009) Tabitha James et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS
- Adaptive Particle Swarm Optimization
- (2009) Zhi-Hui Zhan et al. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS
- Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan
- (2009) Ehram Safari et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots
- (2009) Fantahun M. Defersha et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration
- (2009) Weihang Zhu et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems
- (2008) V. P. Eswaramurthy et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- (2008) Michael Andresen et al. MATHEMATICAL AND COMPUTER MODELLING
- An ant colony optimization method for generalized TSP problem
- (2008) Jinhui Yang et al. Progress in Natural Science-Materials International
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- (2007) Min Kong et al. COMPUTERS & OPERATIONS RESEARCH
- A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
- (2007) Quan-Ke Pan et al. COMPUTERS & OPERATIONS RESEARCH
- A dynamic programming based reduction procedure for the multidimensional 0–1 knapsack problem
- (2007) Stefan Balev et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- (2007) Chao-Tang Tseng et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- (2007) Tabitha James et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
- (2007) Davide Anghinolfi et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment
- (2006) Zne-Jung Lee et al. APPLIED SOFT COMPUTING
- A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan☆
- (2006) Zhigang Lian et al. CHAOS SOLITONS & FRACTALS
Create your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create NowAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started