Publicado

2012-07-01

MEMETIC ALGORITHM TO MINIMIZE COSTS OF ACTIVITIES IN RCPSP

Palabras clave:

Project scheduling, activity cost, memetic algorithm. (es)

Descargas

Autores/as

  • ELYN LIZETH SOLANO-CHARRIS Universidad de La Sabana
  • JAIRO R. MONTOYA-TORRES Universidad de La Sabana
  • CONSUELO DURÁN-CANTOR Universidad de La Sabana
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

Visitas a la página del resumen del artículo

272

Descargas

Los datos de descarga aún no están disponibles.

Cómo citar

[1]
E. L. SOLANO-CHARRIS, J. R. MONTOYA-TORRES, y C. DURÁN-CANTOR, «MEMETIC ALGORITHM TO MINIMIZE COSTS OF ACTIVITIES IN RCPSP», DYNA, vol. 79, n.º 174, pp. 86–95, jul. 2012, Accedido: 20 de septiembre de 2026. [En línea]. Disponible en: https://revistas.unal.edu.co/index.php/dyna/article/view/26537