Solving 0–1 Knapsack Problems by Binary Dragonfly Algorithm

Faculty Computer Science Year: 2017
Type of Publication: ZU Hosted Pages:
Authors:
Mohammed Abdel Basset Metwally Attia
Journal: ICIC 2017: Intelligent Computing Methodologies pp 491-502 Springer Volume:
Keywords : Solving , Knapsack Problems , Binary Dragonfly Algorithm    
Abstract:
The 0–1 knapsack problem (0–1KP) is a well-known combinatorial optimization problem. It is an NP-hard problem which plays significant roles in many real life applications. Dragonfly algorithm (DA) a novel swarm intelligence optimization alg
    
     
 
       

Author Related Publications

  • Mohammed Abdel Basset Metwally Attia, "Discrete greedy flower pollination algorithm for spherical traveling salesman problem", Springer, 2019 More
  • Mohammed Abdel Basset Metwally Attia, "A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems", Natural Sciences Publishing Cor., 2014 More
  • Mohammed Abdel Basset Metwally Attia, "A novel equilibrium optimization algorithm for multi-thresholding image segmentation problems", Springer London, 2021 More
  • Mohammed Abdel Basset Metwally Attia, "An efficient binary slime mould algorithm integrated with a novel attacking-feeding strategy for feature selection", Pergamon, 2021 More
  • Mohammed Abdel Basset Metwally Attia, "An efficient teaching-learning-based optimization algorithm for parameters identification of photovoltaic models: Analysis and validations", Pergamon, 2021 More

Department Related Publications

  • Karam mohamed goda, "Hybrid Gene Selection Methods of Microarray Data for Cancer Classification", International Journal of Graphics & Image Processing |Vol 2|issue 3|August 2012 , 2013 More
  • Saber Mohamed, "Evolving the Parameters of Differential Evolution using Evolutionary Algorithms", Springer, 2014 More
  • Saber Mohamed, "A Comparative Study of Different Variants of Genetic Algorithms for Constrained Optimization", Springer, 2010 More
  • Saber Mohamed, "Differential Evolution with Multiple Strategies for Solving CEC2011 Real-world Numerical Optimization Problems", IEEE, 2011 More
  • Eman samir hasan sayed, "Dependency Identification technique for large scale optimization problems", IEEE, 2012 More
Tweet