The Use of Simulated Annealing and Genetic Algorithm in Solving Resource Leveling Problem in Multi-project Mode

Ebrahimi, Seyed Mahdi; Kananizadeh, Mohammad

doi:10.22034/ijiems.2023.367290.1059

The Use of Simulated Annealing and Genetic Algorithm in Solving Resource Leveling Problem in Multi-project Mode

Document Type : Original Article

Authors

seyed mahdi ebrahimi ¹

Mohammad Kananizadeh ²

¹ University of Science and Arts of Yazd

² b PhD student of Industrial Engineering of Yazd University, Yazd, Iran

10.22034/ijiems.2023.367290.1059

Abstract

Having a functionally efficient plan with regards to Resource Leveling is among the significant determining factors when it comes to reducing the costs of any project; especially, when multiple projects are carried out simultaneously, this notion proves to have even more importance. In the present article, after exploring the general concept and notion of Resource Leveling and Problem Modelling in a single project, the problem will be scrutinized in multi-project mode. To proceeding with doing so, a mathematical model is proposed whose objective is to minimize the changes in the levels of different resources which are used by all projects.
Given the fact that Resource Leveling Problem is an NP-hard problem and reaching the optimized solution is not generally possible, methods such as Genetic Algorithm and Simulated Annealing Algorithm are used by which to reach an approximate optimal result. Additionally, to elucidate the quality of the eventual answer which was achieved by the two aforementioned algorithms, a real-life example of resource planning in a software company has been used.

Keywords

Resource Leveling

Multi-project Mode

Genetic Algorithm

Simulated Annealing