Memetic algorithm to minimize costs of activities in rcpsp

The Resource-Constrained Project Scheduling Problem (RCPSP) is a classic and important problem in project management and has got much attention from researchers. In this paper, we consider the case in which the cost of activities has to be minimized. This variant of the problem can be found mainly i...

Full description

Autores:
Solano Charris, Elyn Lizeth
Montoya Torres, Jairo Rafael
Durán Cantor, Mercedes Consuelo
Tipo de recurso:
Article of journal
Fecha de publicación:
2012
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/38641
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/38641
http://bdigital.unal.edu.co/28738/
Palabra clave:
Project scheduling
activity cost
memetic algorithm.
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional
id UNACIONAL2_7e583d7f2cd26d979781608c3afbfc60
oai_identifier_str oai:repositorio.unal.edu.co:unal/38641
network_acronym_str UNACIONAL2
network_name_str Universidad Nacional de Colombia
repository_id_str
spelling Atribución-NoComercial 4.0 InternacionalDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Solano Charris, Elyn Lizeth268696f5-02aa-44ac-bc90-2806875192ac300Montoya Torres, Jairo Rafael08401104-800a-4842-9431-091b00652855300Durán Cantor, Mercedes Consuelob5e0d2b7-ef93-4758-a067-502e55f8ba343002019-06-28T02:49:26Z2019-06-28T02:49:26Z2012https://repositorio.unal.edu.co/handle/unal/38641http://bdigital.unal.edu.co/28738/The Resource-Constrained Project Scheduling Problem (RCPSP) is a classic and important problem in project management and has got much attention from researchers. In this paper, we consider the case in which the cost of activities has to be minimized. This variant of the problem can be found mainly in construction management supply chains. Its characteristics show that this objective function is non-regular and that the problem is NP-hard. This paper presents a memetic algorithm to solve this problem. Computational experiments are carried out using well-known instances from the PSPLIB. Results obtained validate the effectiveness of the proposed algorithm and allow us to understand the algorithm’s behaviorapplication/pdfspaUniversidad Nacional de Colombia Sede Medellínhttp://revistas.unal.edu.co/index.php/dyna/article/view/26537Universidad Nacional de Colombia Revistas electrónicas UN DynaDynaDyna; Vol. 79, núm. 174 (2012); 86-95 DYNA; Vol. 79, núm. 174 (2012); 86-95 2346-2183 0012-7353Solano Charris, Elyn Lizeth and Montoya Torres, Jairo Rafael and Durán Cantor, Mercedes Consuelo (2012) Memetic algorithm to minimize costs of activities in rcpsp. Dyna; Vol. 79, núm. 174 (2012); 86-95 DYNA; Vol. 79, núm. 174 (2012); 86-95 2346-2183 0012-7353 .Memetic algorithm to minimize costs of activities in rcpspArtículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85Texthttp://purl.org/redcol/resource_type/ARTProject schedulingactivity costmemetic algorithm.ORIGINAL26537-191372-1-PB.htmltext/html29766https://repositorio.unal.edu.co/bitstream/unal/38641/1/26537-191372-1-PB.htmlc403e4ba5fb37fa2fde7891ad34474c7MD5126537-135296-1-PB.pdfapplication/pdf1216615https://repositorio.unal.edu.co/bitstream/unal/38641/2/26537-135296-1-PB.pdf8df770a273ed1d3e15e8de3d0071eb75MD52THUMBNAIL26537-135296-1-PB.pdf.jpg26537-135296-1-PB.pdf.jpgGenerated Thumbnailimage/jpeg8519https://repositorio.unal.edu.co/bitstream/unal/38641/3/26537-135296-1-PB.pdf.jpgd1f6ef6d9e0b416114627b95b1727a6aMD53unal/38641oai:repositorio.unal.edu.co:unal/386412023-01-19 23:03:59.142Repositorio Institucional Universidad Nacional de Colombiarepositorio_nal@unal.edu.co
dc.title.spa.fl_str_mv Memetic algorithm to minimize costs of activities in rcpsp
title Memetic algorithm to minimize costs of activities in rcpsp
spellingShingle Memetic algorithm to minimize costs of activities in rcpsp
Project scheduling
activity cost
memetic algorithm.
title_short Memetic algorithm to minimize costs of activities in rcpsp
title_full Memetic algorithm to minimize costs of activities in rcpsp
title_fullStr Memetic algorithm to minimize costs of activities in rcpsp
title_full_unstemmed Memetic algorithm to minimize costs of activities in rcpsp
title_sort Memetic algorithm to minimize costs of activities in rcpsp
dc.creator.fl_str_mv Solano Charris, Elyn Lizeth
Montoya Torres, Jairo Rafael
Durán Cantor, Mercedes Consuelo
dc.contributor.author.spa.fl_str_mv Solano Charris, Elyn Lizeth
Montoya Torres, Jairo Rafael
Durán Cantor, Mercedes Consuelo
dc.subject.proposal.spa.fl_str_mv Project scheduling
activity cost
memetic algorithm.
topic Project scheduling
activity cost
memetic algorithm.
description The Resource-Constrained Project Scheduling Problem (RCPSP) is a classic and important problem in project management and has got much attention from researchers. In this paper, we consider the case in which the cost of activities has to be minimized. This variant of the problem can be found mainly in construction management supply chains. Its characteristics show that this objective function is non-regular and that the problem is NP-hard. This paper presents a memetic algorithm to solve this problem. Computational experiments are carried out using well-known instances from the PSPLIB. Results obtained validate the effectiveness of the proposed algorithm and allow us to understand the algorithm’s behavior
publishDate 2012
dc.date.issued.spa.fl_str_mv 2012
dc.date.accessioned.spa.fl_str_mv 2019-06-28T02:49:26Z
dc.date.available.spa.fl_str_mv 2019-06-28T02:49:26Z
dc.type.spa.fl_str_mv Artículo de revista
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.driver.spa.fl_str_mv info:eu-repo/semantics/article
dc.type.version.spa.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.coar.spa.fl_str_mv http://purl.org/coar/resource_type/c_6501
dc.type.coarversion.spa.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.content.spa.fl_str_mv Text
dc.type.redcol.spa.fl_str_mv http://purl.org/redcol/resource_type/ART
format http://purl.org/coar/resource_type/c_6501
status_str publishedVersion
dc.identifier.uri.none.fl_str_mv https://repositorio.unal.edu.co/handle/unal/38641
dc.identifier.eprints.spa.fl_str_mv http://bdigital.unal.edu.co/28738/
url https://repositorio.unal.edu.co/handle/unal/38641
http://bdigital.unal.edu.co/28738/
dc.language.iso.spa.fl_str_mv spa
language spa
dc.relation.spa.fl_str_mv http://revistas.unal.edu.co/index.php/dyna/article/view/26537
dc.relation.ispartof.spa.fl_str_mv Universidad Nacional de Colombia Revistas electrónicas UN Dyna
Dyna
dc.relation.ispartofseries.none.fl_str_mv Dyna; Vol. 79, núm. 174 (2012); 86-95 DYNA; Vol. 79, núm. 174 (2012); 86-95 2346-2183 0012-7353
dc.relation.references.spa.fl_str_mv Solano Charris, Elyn Lizeth and Montoya Torres, Jairo Rafael and Durán Cantor, Mercedes Consuelo (2012) Memetic algorithm to minimize costs of activities in rcpsp. Dyna; Vol. 79, núm. 174 (2012); 86-95 DYNA; Vol. 79, núm. 174 (2012); 86-95 2346-2183 0012-7353 .
dc.rights.spa.fl_str_mv Derechos reservados - Universidad Nacional de Colombia
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.rights.license.spa.fl_str_mv Atribución-NoComercial 4.0 Internacional
dc.rights.uri.spa.fl_str_mv http://creativecommons.org/licenses/by-nc/4.0/
dc.rights.accessrights.spa.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv Atribución-NoComercial 4.0 Internacional
Derechos reservados - Universidad Nacional de Colombia
http://creativecommons.org/licenses/by-nc/4.0/
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.mimetype.spa.fl_str_mv application/pdf
dc.publisher.spa.fl_str_mv Universidad Nacional de Colombia Sede Medellín
institution Universidad Nacional de Colombia
bitstream.url.fl_str_mv https://repositorio.unal.edu.co/bitstream/unal/38641/1/26537-191372-1-PB.html
https://repositorio.unal.edu.co/bitstream/unal/38641/2/26537-135296-1-PB.pdf
https://repositorio.unal.edu.co/bitstream/unal/38641/3/26537-135296-1-PB.pdf.jpg
bitstream.checksum.fl_str_mv c403e4ba5fb37fa2fde7891ad34474c7
8df770a273ed1d3e15e8de3d0071eb75
d1f6ef6d9e0b416114627b95b1727a6a
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
repository.name.fl_str_mv Repositorio Institucional Universidad Nacional de Colombia
repository.mail.fl_str_mv repositorio_nal@unal.edu.co
_version_ 1814089782047801344