Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems

The majority of Combinatorial Optimization Problems (COPs) are defined in the discrete space. Hence, proposing an efficient algorithm to solve the problems has become an attractive subject in recent years. In this paper, a meta-heuristic algorithm based on Binary Particle Swarm Algorithm (BPSO) and the governing Newtonian motion laws, so-called Binary Accelerated Particle Swarm Algorithm (BAPSA) is offered for discrete search spaces. The method is presented in two global and local topologies and evaluated on the 0–1 Multidimensional Knapsack Problem (MKP) as a famous problem in the class of COPs and NP-hard problems. Besides, the results are compared with BPSO for both global and local topologies as well as Genetic Algorithm (GA). We applied three methods of Penalty Function (PF) technique, Check-and-Drop (CD) and Improved Check-and-Repair Operator (ICRO) algorithms to solve the problem of infeasible solutions in the 0–1 MKP. Experimental results show that the proposed methods have better performance than BPSO and GA especially when ICRO algorithm is applied to convert infeasible solutions to feasible ones.

[1]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[2]  Yee Leung,et al.  Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis , 1997, IEEE Trans. Neural Networks.

[3]  Manju Agarwal,et al.  Ant colony approach to constrained redundancy optimization in binary systems , 2010 .

[4]  José Rui Figueira,et al.  Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem , 2011, J. Glob. Optim..

[5]  Philippe Galinier,et al.  A tabu search algorithm for the covering design problem , 2011, J. Heuristics.

[6]  Li Mao-lin,et al.  Hyper-mutation antibody clone algorithms for TSP , 2009 .

[7]  Haozhong Cheng,et al.  New discrete method for particle swarm optimization and its application in transmission network expansion planning , 2007 .

[8]  Martin W. P. Savelsbergh,et al.  MINTO, a mixed INTeger optimizer , 1994, Oper. Res. Lett..

[9]  Zne-Jung Lee,et al.  Genetic algorithm with ant colony optimization (GA-ACO) for multiple sequence alignment , 2008, Appl. Soft Comput..

[10]  Ronald L. Rivest,et al.  A knapsack-type public key cryptosystem based on arithmetic in finite fields , 1988, IEEE Trans. Inf. Theory.

[11]  Henry C. W. Lau,et al.  Application of Genetic Algorithms to Solve the Multidepot Vehicle Routing Problem , 2010, IEEE Transactions on Automation Science and Engineering.

[12]  A. Tamilarasi,et al.  Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems , 2009 .

[13]  Ching-Jong Liao,et al.  A discrete particle swarm optimization for lot-streaming flowshop scheduling problem , 2008, Eur. J. Oper. Res..

[14]  Li Zhang,et al.  Genetic Algorithm Based on the Orthogonal Design for Multidimensional Knapsack Problems , 2006, ICNC.

[15]  John E. Beasley,et al.  A Genetic Algorithm for the Multidimensional Knapsack Problem , 1998, J. Heuristics.

[16]  Lawrence V. Snyder,et al.  A random-key genetic algorithm for the generalized traveling salesman problem , 2006, Eur. J. Oper. Res..

[17]  He Li,et al.  Permutation Algorithm with Simulated Annealing for Laser Antimissile Problem , 2010 .

[18]  Larry Bull.  On the Evolution of Multicellularity and Eusociality , 1999, Artificial Life.

[19]  Der-Rong Din,et al.  Heuristic and Simulated Annealing Algorithms for Wireless ATM Backbone Network Design Problem , 2008, J. Inf. Sci. Eng..

[20]  Stefka Fidanova,et al.  Ant Colony Optimization for Multiple Knapsack Problem and Model Bias , 2004, NAA.

[21]  Fred W. Glover,et al.  A cooperative parallel tabu search algorithm for the quadratic assignment problem , 2009, Eur. J. Oper. Res..

[22]  Min Kong,et al.  A new ant colony optimization algorithm for the multidimensional Knapsack problem , 2008, Comput. Oper. Res..

[23]  Salim Chikhi,et al.  BPSO Algorithms for Knapsack Problem , 2011, WiMo/CoNeCo.

[24]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[25]  Wei Shih,et al.  A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[26]  M. Marchese,et al.  An ant colony optimization method for generalized TSP problem , 2008 .

[27]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[28]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[29]  José Rui Figueira,et al.  Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems , 2011, J. Glob. Optim..

[30]  Frank Werner,et al.  Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop , 2008, Math. Comput. Model..

[31]  B. Al-kazemi,et al.  Discrete Multi-Phase Particle Swarm Optimization , 2005 .

[32]  Anna Kucerová,et al.  Improvements of real coded genetic algorithms based on differential operators preventing premature convergence , 2004, ArXiv.

[33]  Massimo Paolucci,et al.  A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times , 2009, Eur. J. Oper. Res..

[34]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[35]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[36]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

[37]  Kamran Shahanaghi,et al.  Scheduling flowshops with condition-based maintenance constraint to minimize expected makespan , 2010 .

[38]  Andreas Drexl,et al.  A simulated annealing approach to the multiconstraint zero-one knapsack problem , 1988, Computing.

[39]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[40]  Maria Grazia Speranza,et al.  A multidimensional knapsack model for asset-backed securitization , 2002, J. Oper. Res. Soc..

[41]  Sanyang Liu,et al.  Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique , 2012 .

[42]  Richard E. Neapolitan,et al.  Foundations of Algorithms using C++ Pseudocode, Third Edition , 2008 .

[43]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[44]  Abdel Lisser,et al.  Knapsack problem with probability constraints , 2011, J. Glob. Optim..

[45]  Mingyuan Chen,et al.  A simulated annealing algorithm for dynamic system reconfiguration and production planning in cellular manufacturing , 2009, Int. J. Manuf. Technol. Manag..

[46]  Mingyuan Chen,et al.  A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots , 2010 .

[47]  Ralph E. Gomory,et al.  The Theory and Computation of Knapsack Functions , 1966, Oper. Res..

[48]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[49]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[50]  Rumen Andonov,et al.  A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem , 2008, Eur. J. Oper. Res..

[51]  T. Senjyu,et al.  Memory-Bounded Ant Colony Optimization With Dynamic Programming and $A^{\ast}$ Local Search for Generator Planning , 2007, IEEE Transactions on Power Systems.

[52]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[53]  José Neves,et al.  The fully informed particle swarm: simpler, maybe better , 2004, IEEE Transactions on Evolutionary Computation.

[54]  Jacques Teghem,et al.  Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem , 1998, J. Glob. Optim..

[55]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[56]  Xingsheng Gu,et al.  A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan ☆ , 2008 .

[57]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[58]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[59]  Ghorbanali Moslemipour,et al.  A review of intelligent approaches for designing dynamic and robust layouts in flexible manufacturing systems , 2012 .

[60]  Min Kong,et al.  Apply the Particle Swarm Optimization to the Multidimensional Knapsack Problem , 2006, ICAISC.

[61]  Labed Said,et al.  A Modified Hybrid Particle Swarm Optimization Algorithm for Multidimensional Knapsack Problem , 2011 .

[62]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[63]  William J. Cook,et al.  Combinatorial Optimization: Cook/Combinatorial , 1997 .

[64]  S. Senju,et al.  An Approach to Linear Programming with 0--1 Variables , 1968 .

[65]  Ahmad Moradi,et al.  An effective hybrid PSO-based algorithm for planning UMTS terrestrial access networks , 2010 .

[66]  Jin-Ho Kim,et al.  A Novel Binary Ant Colony Optimization: Application to the Unit Commitment Problem of Power Systems , 2011 .

[67]  Maria Grazia Speranza,et al.  Kernel search: A general heuristic for the multi-dimensional knapsack problem , 2010, Comput. Oper. Res..

[68]  Marie-Ange Manier,et al.  A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times , 2012, Comput. Oper. Res..

[69]  Weihang Zhu,et al.  SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration , 2010 .

[70]  Carlos Cotta,et al.  A Hybrid Genetic Algorithm for the 0-1 Multiple Knapsack Problem , 1997, ICANNGA.

[71]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[72]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[73]  Fred W. Glover,et al.  Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem , 2009, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.