Solving 0–1 knapsack problem by binary flower pollination algorithm

Faculty Computer Science Year: 2018
Type of Publication: ZU Hosted Pages:
Authors:
Journal: Neural Computing and Applications Springer Volume:
Keywords : Solving , knapsack problem , binary flower pollination    
Abstract:
In this paper, we propose a new binary version of the flower pollination algorithm (BFPA) for solving 0–1 knapsack problem. The standard flower pollination algorithm (FPA) is used for the continuous optimization problems. So, a transformati
   
     
 
       

Author Related Publications

  • Doaa El-Shahat Barakat Mohammed, "A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making", Springer, 2017 More
  • Doaa El-Shahat Barakat Mohammed, "Integrating the whale algorithm with Tabu search for quadratic assignment problem: A new approach for locating hospital departments", Elsevier, 2018 More
  • Doaa El-Shahat Barakat Mohammed, "A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem", North-Holland, 2018 More
  • Doaa El-Shahat Barakat Mohammed, "A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem", Springer Berlin Heidelberg, 2017 More
  • Doaa El-Shahat Barakat Mohammed, "A Novel Whale Optimization Algorithm for Cryptanalysis in Merkle-Hellman Cryptosystem", Springer, 2018 More

Department Related Publications

  • Saber Mohamed, "Online Generation of Trajectories for Autonomous Vehicles using a Multi-Agent System", IEEE, 2014 More
  • Saber Mohamed, "Parameters Adaptation in Differential Evolution", IEEE, 2012 More
  • Eman samir hasan sayed, "Using Hybrid Dependency Identification with a Memetic Algorithm for Large Scale Optimization Problems", Springer Berlin Heidelberg, 2012 More
  • Eman samir hasan sayed, "A Decomposition-based Algorithm for Dynamic Economic Dispatch Problems", IEEE, 2014 More
  • Eman samir hasan sayed, "Decomposition-based evolutionary algorithm for large scale constrained problems", Elsevier Inc, 2014 More
Tweet