BRADFORD SCHOLARS

    • Sign in
    View Item 
    •   Bradford Scholars
    • Engineering and Digital Technology
    • Engineering and Digital Technology Publications
    • View Item
    •   Bradford Scholars
    • Engineering and Digital Technology
    • Engineering and Digital Technology Publications
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of Bradford ScholarsCommunitiesAuthorsTitlesSubjectsPublication DateThis CollectionAuthorsTitlesSubjectsPublication Date

    My Account

    Sign in

    HELP

    Bradford Scholars FAQsCopyright Fact SheetPolicies Fact SheetDeposit Terms and ConditionsDigital Preservation Policy

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Discrete flower pollination algorithm for resource constrained project scheduling problem

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    View/Open
    Hu_et_al_IJCSIS.pdf (1.012Mb)
    Download
    Publication date
    2015-07
    Author
    Bibiks, Kirils
    Li, Jian-Ping
    Hu, Yim Fun
    Keyword
    Flower pollination algorithm; Discrete flower pollination algorithm; Combinatorial optimization; Resource constrained project scheduling problem; Evolutionary computing
    Rights
    Copyright © IJCSIS. This is an open access journal distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
    Peer-Reviewed
    Yes
    
    Metadata
    Show full item record
    Abstract
    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.
    URI
    http://hdl.handle.net/10454/9991
    Version
    published version paper
    Citation
    Bibiks K, Li J-P and Hu F (2015) Discrete flower pollination algorithm for resource constrained project scheduling problem. International Journal of Computer Science and Information Security. 13(7): 8-19.
    Link to publisher’s version
    https://sites.google.com/site/ijcsis/vol-13-no-7-jul-2015
    Type
    Article
    Notes
    Awarded 'Best paper of the Month'
    Collections
    Engineering and Digital Technology Publications

    entitlement

     
    DSpace software (copyright © 2002 - 2023)  DuraSpace
    Quick Guide | Contact Us
    Open Repository is a service operated by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.