New binary marine predators optimization algorithms for 0–1 knapsack problems

Faculty Computer Science Year: 2021
Type of Publication: ZU Hosted Pages:
Authors:
Journal: Computers & Industrial Engineering Pergamon Volume: 151
Keywords : , binary marine predators optimization algorithms , , knapsack    
Abstract:
Recently, a novel meta-heuristic algorithm known as the marine predators algorithm (MPA) has been proposed for solving continuous optimization problems. Despite the significant superiority of MPA in solving continuous problems, the algorith
   
     
 
       

Author Related Publications

    Department 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
    • Saber Mohamed, "Training and Testing a Self-Adaptive Multi-Operator Evolutionary Algorithm for Constrained Optimization", ELSEVEIR, 2015 More
    • Saber Mohamed, "An Improved Self-Adaptive Differential Evolution Algorithm for Optimization Problems", IEEE, 2013 More
    • Saber Mohamed, "Differential Evolution with Dynamic Parameters Selection for Optimization Problems", IEEE, 2014 More
    Tweet