A hybrid metaheuristic for the resource-constrained project scheduling problem

This study presents a hybrid metaheuristic ANGEL for the resource-constrained project scheduling problem (RCPSP). ANGEL combines ant colony optimization (ACO), genetic algorithm (GA) and local search strategy. The procedures of ANGEL are as follows. First, ACO searches the solution space and generat...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2006-12, Vol.175 (2), p.707-721
Main Authors: Tseng, Lin-Yu, Chen, Shih-Chieh
Format: Article
Language:English
Subjects:
Ant colony optimization
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Genetic algorithm
Genetic algorithms
Heuristic
Local search
Metaheuristics
Operational research and scientific management
Operational research. Management science
Optimization
Project management
Project scheduling
Scheduling, sequencing
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This study presents a hybrid metaheuristic ANGEL for the resource-constrained project scheduling problem (RCPSP). ANGEL combines ant colony optimization (ACO), genetic algorithm (GA) and local search strategy. The procedures of ANGEL are as follows. First, ACO searches the solution space and generates activity lists to provide the initial population for GA. Next, GA is executed and the pheromone set in ACO is updated when GA obtains a better solution. When GA terminates, ACO searches again by using a new pheromone set. ACO and GA search alternately and cooperatively in the solution space. This study also proposes an efficient local search procedure which is applied to yield a better solution when ACO or GA obtains a solution. A final search is applied upon the termination of ACO and GA. The experimental results of ANGEL on the standard sets of the project instances show that ANGEL is an effective method for solving the RCPSP.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2005.06.014