Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Memetic Algorithm for the Solution of the Resource Leveling Problem
Download
buildings-13-02738.pdf
Date
2023-10-01
Author
Iranagh, Mehdi
Sönmez, Rifat
Uysal, Furkan
Atan, Sabri Tankut
Bettemir, Önder Halis
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
41
views
6
downloads
Cite This
In this paper, we present a novel memetic algorithm (MA) for the solution of the resource leveling problem (RLP). The evolutionary framework of the MA is based on integration of a genetic algorithm and simulated annealing methods along with a resource leveling heuristic. The main objective of the proposed algorithm is to integrate complementary strengths of different optimization methods and incorporate the individual learning as a separate process for achieving a successful optimization method for the RLP. The performance of the MA is compared with the state-of-the-art leveling methods. For small instances up to 30 activities, mixed-integer linear models are presented for two leveling metrics to provide a basis for performance evaluation. The computational results indicate that the new integrated framework of the MA outperforms the state-of-the-art leveling heuristics and meta-heuristics and provides a successful method for the RLP. The limitations of popular commercial project management software are also illustrated along with the improvements achieved by the MA to reveal potential contributions of the proposed integrated framework in practice.
Subject Keywords
Resource leveling
,
Project scheduling
,
Optimization
,
Genetic algorithms
,
Simulated annealing
,
Memetic algorithms
URI
https://doi.org/10.3390/buildings13112738
https://hdl.handle.net/11511/106200
Journal
BUILDINGS (BASEL)
DOI
https://doi.org/10.3390/buildings13112738
Collections
Department of Civil Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Iranagh, R. Sönmez, F. Uysal, S. T. Atan, and Ö. H. Bettemir, “A Memetic Algorithm for the Solution of the Resource Leveling Problem,”
BUILDINGS (BASEL)
, vol. 13, pp. 2738–2756, 2023, Accessed: 00, 2023. [Online]. Available: https://doi.org/10.3390/buildings13112738.