An Effective Frog-leaping Algorithm to Minimize the Completion Time Problem of the Resource-constrained Projects

Frog leaping algorithm combination (SFLA) is an algorithm based on memetic Meta-heuristic. Created in recent years by Eusuff and Lansey, SFLA algorithm works in a way that the frog groups search for food. The development of memetic algorithms for local search method is similar to the activities of a frog among subgroups. SFLA uses a combination of strategy and provides the ability to exchange messages in local search. Frog leaping algorithm combines the advantages of particle swarm optimization algorithm and memetic development (PSO). Since the resource-constrained project scheduling problem is the timing issue, scheduling issues in the construction sites and plants is highly considered. One of the main duties of the project scheduling and project management is to reduce the completion time. Because of the resource constraints and precedence relationships between activities, project scheduling problem is difficult. In this paper, the algorithm performance LeapFrog (SFLA) is applied to reduce the project scheduling problems with resource constraints. The findings prove the robust performance of the new meta-heuristic algorithm.