Introducing an Meta-Huristics Method Based on Frog Method to solve resource constrained project scheduling problem

Main Article Content

mohammad masoud javidi

Abstract

The issue of project scheduling with limited resources has attracted the attention of many researchers and great research centers in recent years. The aim of this issue is scheduling the tasks in a project considering the prerequisite restrictions and limited resources, so that the project can be finished in the shortest time possible. The ultra-innovative algorithms are considered as optimization method which is used frequently in solving the NP-Hard problems, especially RCPSP. These algorithms make use of one or more mathematical relations under the title of updater function to improve the results obtained in complex problems. Some of the well-known algorithms are Particle Swarm Optimization (PSO(, Ant Colony, Bee Colony, Fire Fly, Bats and Shuffled Frog Leaping Algorithm (SFLA).  In the present paper,Shuffled Frog Leaping Algorithm(SFLA) was used for solving the RCPSP problem. The suggestive idea in this paper was to define and regulate a number of primary parameters in SFLA for each frog before leaping, and also to define two new updater functions and adding them SFLA. The presented new structure from SFLA was called Extended Shuffled Frog Leaping Algorithm (ESFLA). The results obtained from the suggested algorithm (ESFLA) for solving RCPSP problem indicated the efficiency of the suggested algorithm in solving RCPSP problems, and also the superiority of this algorithm compared with many other methods used in this field.

Article Details

Section
Articles