Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations.

Simple item page
dc.contributor.authorGomes, Helton Cristiano
dc.contributor.authorNeves, Francisco de Assis das
dc.contributor.authorSouza, Marcone Jamilson Freitas
dc.date.accessioned2015-01-26T11:35:19Z
dc.date.available2015-01-26T11:35:19Z
dc.date.issued2014
dc.description.abstractThis study addresses the resource-constrained project scheduling problem with precedence relations, and aims at minimizing two criteria: the makespan and the total weighted start time of the activities. To solve the problem, five multi-objective metaheuristic algorithms are analyzed, based on Multi-objective GRASP (MOG), Multi-objective Variable Neighborhood Search (MOVNS) and Pare to Iterated Local Search (PILS) methods. The proposed algorithms use strategies based on the concept of Pare to Dominance to search for solutions and determine the set of non-dominated solutions. The solutions obtained by the algorithms, from asset of instances adapted from the literature, are compared using four multi-objective performance measures: distance metrics, hyper volume indicator, epsilon metric and error ratio. The computational tests have indicated an algorithm based on MOVNS as the most efficient one, compared to the distance metrics; also, a combined feature of MOG and MOVNS appears to be superior compared to the hyper volume and epsilon metrics and one based on PILS compared to the error ratio. Statistical experiments have shown a significant difference between some proposed algorithms compared to the distance metrics, epsilon metric and error ratio. However, significant difference between the proposed algorithms with respect to hyper volume indicator was not observed.pt_BR
dc.identifier.citationGOMES, H. C.; NEVES, F. de A. das; SOUZA, M. J. F. Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations. Computers & Operations Research, v. 44, p. 92-104, 2014. Disponível em: <http://www.sciencedirect.com/science/article/pii/S0305054813003158#>. Acesso em: 23 jan. 2015.pt_BR
dc.identifier.doihttps://doi.org/10.1016/j.cor.2013.11.002
dc.identifier.issn0305-0548
dc.identifier.urihttp://www.repositorio.ufop.br/handle/123456789/4386
dc.language.isoen_USpt_BR
dc.rights.licenseO periódico Computers & Operations Research concede permissão para depósito do artigo no Repositório Institucional da UFOP. Número da licença: 3553121136993.pt_BR
dc.subjectProject managementpt_BR
dc.subjectResource constrained project schedulingpt_BR
dc.subjectMulti objective optimizationpt_BR
dc.subjectMetaheuristicspt_BR
dc.titleMulti-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations.pt_BR
dc.typeArtigo publicado em periodicopt_BR
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
ARTIGO_MultiObjectiveMetaheuristic.pdf
Size:
485.87 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.57 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
DECOM - Artigos publicados em periódicos