By Topic

Simulated annealing variants for solving resource Constrained Project Scheduling Problem: A comparative study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Das, P.P. ; Comput. Sci. & Eng., West Bengal Univ. of Technol., Kolkata, India ; Acharyya, S.

Now-a-days different meta-heuristic approaches are being applied for solving Combinatorial Optimization Problems (COP). In this paper Resource Constrained Project Scheduling Problem (RCPSP) has been presented as a COP. This is a common problem for many construction projects. It is highly constrained and is categorized as a NP-hard problem. In our earlier work Simulated Annealing (SA_RCP) outperformed other meta-heuristics, like, Genetic Algorithm, Tabu Search, Particle Swarm Optimization and its variant in solving benchmark instances of this problem. Having been inspired by this result we have further applied new variants of Simulated Annealing for RCPSP. In this work, we have taken three more SA variants and applied them for solving a benchmark instance of this problem. The results show that Simulated Annealing incorporated with Tabu List and Greedy Selection Heuristic (GTSA_RCP) outperforms other methods in getting optimal results with maximum hit and minimum fluctuations.

Published in:

Computer and Information Technology (ICCIT), 2011 14th International Conference on

Date of Conference:

22-24 Dec. 2011