Using Hybrid Dependency Identification with a Memetic Algorithm for Large Scale Optimization Problems

Faculty	Computer Science	Year:	2012
Type of Publication:	ZU Hosted	Pages:	168-177
Authors:	Eman samir hasan sayed Staff Zu Site Abstract In Staff Site
Journal:	Simulated Evolution and Learning Springer Berlin Heidelberg	Volume:	0302-9743

Keywords :	Using Hybrid Dependency Identification with , Memetic
Abstract:	Decomposing a large scale problem into smaller subproblems is one of the approaches used to overcome the usual performance deterioration that occurs in EA because of the large dimensionality. To achieve a good performance with a decompositi

Author Related Publications

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
Eman samir hasan sayed, "Large Scale Optimization based on self-directed Local Search", ASOR Bulletin, 2011 More

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