Abstract
AbstractAn ant colony optimization (ACO)-based methodology for solving a multimode resource-constrained project scheduling problem (MRCPSP) with the objective of minimizing project duration is presented. With regards to the need to determine sequence and mode selection of activities for the MRCPSP, two levels of pheromones for each ant are proposed to guide the search course in the ACO algorithm. The corresponding heuristics and probabilities for each type of the pheromone are considered, and their calculation algorithms are presented. The flowchart of the proposed ACO algorithm is described, where a serial schedule generation scheme is adopted to transform an ACO solution into a feasible schedule. The effectiveness and efficiency of the proposed ACO methodology are justified through a series of computational analyses. The study is expected to provide a more effective alternative methodology for solving the MRCPSP by utilizing the ACO theory.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
