title   
  

Multiobjective genetic algorithm approaches to project scheduling under risk

Kılıç, Murat (2003) Multiobjective genetic algorithm approaches to project scheduling under risk. [Thesis]

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
698Kb

Official URL: http://risc01.sabanciuniv.edu/record=b1083553 (Table of Contents)

Abstract

In this thesis, project scheduling under risk is chosen as the topic of research. Project scheduling under risk is defined as a biobjective decision problem and is formulated as a 0-1 integer mathematical programming model. In this biobjective formulation, one of the objectives is taken as the expected makespan minimization and the other is taken as the expected cost minimization. As the solution approach to this biobjective formulation genetic algorithm (GA) is chosen. After carefully investigating the multiobjective GA literature, two strategies based on the vector evaluated GA are developed and a new GA is proposed. For these three GAs first the parameters are investigated through statistical experimentation and then the values are decided upon. The chosen parameters are used for the computational study part of this thesis. In this thesis three improvement heuristics are developed also to further improve the GA solutions. The aim of these improvement heuristics is to decrease the expected cost of the project while keeping the expected duration of the project fixed. These improvement heuristics are implemented at the end of the proposed GA and used to improve the results of the proposed GA. Finally the GAs and improvement heuristics are tested on three different sets of problems. The results are evaluated by pairwise comparisons of algorithms and of heuristics. Also an approximation of the true Pareto front is generated using the commercial mathematical modelling program, GAMS. The results are compared to that approximation and they seem comparable to that solution. The results of the improvement heuristics are also compared against each other and the performance of the heuristics is reported in detail.

Item Type:Thesis
Subjects:T Technology > T Technology (General)
ID Code:8167
Deposited By:IC-Cataloging
Deposited On:18 Apr 2008 10:11
Last Modified:27 Dec 2008 10:00

Repository Staff Only: item control page