A Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem
International Journal of Applied Metaheuristic Computing · 2013
DOI: 10.4018/ijamc.2013070105 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Applied Metaheuristic Computing, 2013. Verfasst von Mohamed Messaoudi-Ouchene und 1 weiteren Autor:innen. Die Arbeit nennt 11 Literaturangaben.
Abstract (Originalsprache)
This paper investigates a comparative study which addresses the P/prec/Cmax scheduling problem, a notable NP-hard benchmark. MLP_SACS, a modified ant colony algorithm, is used to solve it. Its application provides us a better job allocation to machines. In front of each machine, the jobs are performed with three priority rules, the longest path (LP), a modified longest path (MLP) and a maximum between two values (MAX). With these three rules and with both static and dynamic information heuristics called “visibility”, six versions of this ant colony algorithm are obtained, studied and compared. The comparative study analyzes the following four meta-heuristics, simulated annealing, taboo search, genetic algorithm and MLP_SACS (a modified ant colony system), is performed. The solutions obtained by the MLP_SACS algorithm are shown to be the best.
Zitieren
APA
Messaoudi-Ouchene, M., & Derbala, A. (2013). A Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem. International Journal of Applied Metaheuristic Computing. https://doi.org/10.4018/ijamc.2013070105
Vancouver
Messaoudi-Ouchene M, Derbala A. A Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem. International Journal of Applied Metaheuristic Computing. 2013. doi:10.4018/ijamc.2013070105
BibTeX
@article{MessaoudiOuchene2013,
author = {Messaoudi-Ouchene, Mohamed and Derbala, Ali},
title = {A Modified Ant Colony Algorithm to the P| Prec| Cmax Scheduling Problem},
journal = {International Journal of Applied Metaheuristic Computing},
year = {2013},
doi = {10.4018/ijamc.2013070105}
}
EUVIMED