Prioritising and scheduling road projects by genetic algorithm

Min Qiu

Mathematics and Computers in Simulation (MATCOM), 1997, vol. 43, issue 3, 569-574

Abstract: The optimum timetable for implementing a set of road projects so as to achieve maximum investment effectiveness can be found by ranking or Goal Programming (GP) under the assumption that the payoffs of all the projects are divisible and proportional to their proportions undertaken. This assumption is valid for upgrading projects (Type 1) but not for new ones (Type 2). When this difference is taken into account, neither ranking nor GP are effective methods to find the optimum timetable. This paper develops a genetic algorithm (GA) to address this problem. The GA uses the ranking vector of the projects as a GA individual and then transforms it into a project proportion matrix by imposing the budget constraint. Experiments show that the GA can find the optimum solution with an acceptable accuracy, and when the projects are differentiated between Type 1 and 2, the GA finds the optimum timetable that is different from that in the case of all Type 1 projects.

Date: 1997
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475497827619
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:43:y:1997:i:3:p:569-574

DOI: 10.1016/S0378-4754(97)82761-9

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().