Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/19148
Title: Ant colony optimization-based multi-mode scheduling under renewable and nonrenewable resource constraints
Authors: Li, H 
Zhang, H
Keywords: Ant colony optimization
Construction projects
Multi-mode scheduling
Renewable and nonrenewable resource constraints
Issue Date: 2013
Publisher: Elsevier
Source: Automation in construction, 2013, v. 35, p. 431-438 How to cite?
Journal: Automation in construction 
Abstract: An ant colony optimization (ACO)-based methodology for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) considering both renewable and nonrenewable resources is presented. With regard to the MRCPSP solution consisting of activity sequencing and mode selection, two levels of pheromones are proposed to guide search in the ACO algorithm. Correspondingly, two types of heuristic information and probabilities as well as related calculation algorithms are introduced. Nonrenewable resource-constraint and elitist-rank strategy are taken into account in updating the pheromones. The flowchart of the proposed ACO algorithm is described, where a serial schedule generation scheme is incorporated to transform an ACO solution into a feasible schedule. The parameter-selection and the resultant performance of the proposed ACO methodology are investigated through a series of computational experiments. It is expected to provide an effective alternative methodology for solving the MRCPSP by utilizing the ACO theory.
URI: http://hdl.handle.net/10397/19148
ISSN: 0926-5805
EISSN: 1872-7891
DOI: 10.1016/j.autcon.2013.05.030
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

19
Last Week
0
Last month
1
Citations as of Aug 17, 2017

WEB OF SCIENCETM
Citations

19
Last Week
0
Last month
2
Citations as of Aug 15, 2017

Page view(s)

49
Last Week
4
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.