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 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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
Universidad Nacional de Colombia
2012
|
| Online Access: | http://www.scielo.org.co/scielo.php?script=sci_arttext&pid=S0012-73532012000400012 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|