Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Universidad Nacional de Colombia
2012
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=49623216013 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- MEMETIC ALGORITHM TO MINIMIZE COSTS OF ACTIVITIES IN RCPSP JAIRO R. MONTOYA-TORRES ELYN L. SOLANO-CHARRIS CONSUELO DURÁN-CANTOR Ingeniería Activity cost Memetic algorithm Project scheduling The resource-constrained project scheduling problem (RCPSP) is a classic and important problem in project management and has gotten 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. 2012 artículo científico 0012-7353 https://www.redalyc.org/articulo.oa?id=49623216013 en http://www.redalyc.org/revista.oa?id=496 Dyna application/pdf Universidad Nacional de Colombia Dyna (Colombia) Num.174 Vol.79