Discrete flower pollination algorithm for resource constrained project scheduling problem
| Autor: | Bibiks, Kirils, Li, Jian-Ping, Hu, Yim Fun |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: | |
| Druh dokumentu: | Článek |
| Popis: | Yes In this paper, a new population-based and nature-inspired metaheuristic algorithm, Discrete Flower Pollination Algorithm (DFPA), is presented to solve the Resource Constrained Project Scheduling Problem (RCPSP). The DFPA is a modification of existing Flower Pollination Algorithm adapted for solving combinatorial optimization problems by changing some of the algorithm's core concepts, such as flower, global pollination, Lévy flight, local pollination. The proposed DFPA is then tested on sets of benchmark instances and its performance is compared against other existing metaheuristic algorithms. The numerical results have shown that the proposed algorithm is efficient and outperforms several other popular metaheuristic algorithms, both in terms of quality of the results and execution time. Being discrete, the proposed algorithm can be used to solve any other combinatorial optimization problems. Innovate UK Awarded 'Best paper of the Month' |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|