Large Scale Optimization based on self-directed Local Search

Faculty Computer Science Year: 2011
Type of Publication: ZU Hosted Pages:
Authors:
Journal: ASOR Bulletin ASOR Bulletin Volume:
Keywords : Large Scale Optimization based , self-directed Local    
Abstract:
In this paper we propose, a Memetic Algorithm (MA) that is based on a self-directed Local Search (MA-sd-LS), for solving large scale problems using a random grouping decomposition technique. To overcome the large dimensionality difficulties
   
     
 
       

Author Related Publications

  • 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, "Decision Making Assessment for Site Selection Using the AHP and TOPSIS Methods", Statistical studies institution, Cairo University, Egypt, 2007 More
  • Eman samir hasan sayed, "Dependency Identification technique for large scale optimization problems", IEEE, 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

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