An Enhanced Giza Pyramids Construction for Solving Optimization Problems

Paper ID : 1058-ISCBAS

Authors

Naglaa Mohamed Moustafa *1, Abeer S. Desuky2, Asmaa Hekal Omar3 1Al Azhar university 2Azhar Univ. 3Al-Azhar Univ.

Abstract

Many real-world optimization problems can be solved by different algorithms that are not fast in convergence or gain enough accuracy. Metaheuristic algorithms are used to solve optimization problems and have proved their effectiveness in solving many real-world optimization problems. Metaheuristic algorithms try to find the best solution out of all possible solutions in the shortest time possible speed in convergence and accuracy. Giza Pyramids Construction (GPC) has recently been introduced as a physics-inspired optimization method. This paper proposes an Enhanced Giza Pyramids Construction (EGPC) by adding a new parameter that depends on the step length of each individual while revising the individual location. The EGPC algorithm is proposed to improve the GPC exploration and exploitation. Experiments were performed on twenty-three standard benchmark functions to test the performance of the proposed EGPC algorithm. The experimental results based on the standard benchmark functions show that the EGPC algorithm provides very competitive results compared with the basic GPC algorithm and five well-known optimization algorithms in terms of improved exploitation, exploration, local optima avoidance, and convergence rate.

Keywords

Metaheuristic Algorithms, Optimization Algorithms, Giza Pyramids Construction algorithm, GPC algorithm, Benchmark test functions.

Status: Abstract Accepted (Poster Presentation)