An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem
RAIRO - Operations Research - Recherche Opérationnelle, Tome 48 (2014) no. 4, pp. 595-614
Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an independent thread and endowed with the learning ability to dynamically select the excellent priority rules. In addition, all the ants in the ant algorithm have the prejudgment ability to avoid infeasible routes based on the branch and bound method. The algorithm is tested on the well-known benchmark instances in PSPLIB. The computational results validate the effectiveness of the proposed algorithm.

DOI : 10.1051/ro/2014025
Classification : 68M20, 90C59
Keywords: operations research, mathematical programming
@article{RO_2014__48_4_595_0,
     author = {Wuliang, Peng and Min, Huang and Yongping, Hao},
     title = {An improved ant algorithm for {Multi-mode} {Resource} {Constrained} {Project} {Scheduling} {Problem}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {595--614},
     year = {2014},
     publisher = {EDP-Sciences},
     volume = {48},
     number = {4},
     doi = {10.1051/ro/2014025},
     mrnumber = {3264395},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2014025/}
}
TY  - JOUR
AU  - Wuliang, Peng
AU  - Min, Huang
AU  - Yongping, Hao
TI  - An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2014
SP  - 595
EP  - 614
VL  - 48
IS  - 4
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2014025/
DO  - 10.1051/ro/2014025
LA  - en
ID  - RO_2014__48_4_595_0
ER  - 
%0 Journal Article
%A Wuliang, Peng
%A Min, Huang
%A Yongping, Hao
%T An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2014
%P 595-614
%V 48
%N 4
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2014025/
%R 10.1051/ro/2014025
%G en
%F RO_2014__48_4_595_0
Wuliang, Peng; Min, Huang; Yongping, Hao. An improved ant algorithm for Multi-mode Resource Constrained Project Scheduling Problem. RAIRO - Operations Research - Recherche Opérationnelle, Tome 48 (2014) no. 4, pp. 595-614. doi: 10.1051/ro/2014025

Cité par Sources :