header
Local cover image
Local cover image
Image from OpenLibrary

A multi-objective optimization algorithm for project portfolio selection / Mohammed Mahmoud Saad Eldin Elkholany ; Supervised Hisham Abdelsalam

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Cairo : Mohammed Mahmoud Saad Eldin Elkholany , 2017Description: 80 P. : charts ; 30cmOther title:
  • خوارزمية امثلية متعددة الاهداف لاختيار حافظة المشروعات [Added title page title]
Subject(s): Online resources: Available additional physical forms:
  • Issued also as CD
Dissertation note: Thesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Operations Research and Decision Support Summary: Selecting suitable projects from a group of candidate projects considering all constraints and limitations is one of the challenging problems that face any organization. The main purpose of this thesis is to develop an integrated framework to solve the Project Portfolio Selection (PPS) problem. In order to achieve this purpose, 3 main models are developed. First, a model is developed to solve the PPS problem considering the set of criteria as the objective functions representing them as a single objective using weighted method; this model considers a deterministic data and does not handle any uncertainty. Then to capture the stochastic factors affecting the project selection decision, a simulation optimization framework is developed. The first step that is implemented in the framework is to enhance the first model integrating simulation with the optimization model. The second step is to formulate the problem as a multi-objective model by representing each criterion as a separate objective. A binary Cuckoo Search (CS) was proposed to solve the single objective representation of the problem with deterministic data. Then a Monte Carlo simulation is combined with the binary Cuckoo Search to solve the problem under uncertainty. Furthermore, fast Non-dominated sorting was integrated with Monte Carlo simulation to solve the multi-objective model. The results of Binary Cuckoo Search are compared to the results from Lingo software (using default parameters), and it outperformed Lingo. Regarding the stochastic single objective model, the modified CS showed superior results to the Genetic Algorithm obtained from1. Moreover, the fast Non-dominated sorting Cuckoo Search showed better results than the multi-Objective Cuckoo Search mentioned
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Call number Copy number Status Barcode
Thesis Thesis قاعة الرسائل الجامعية - الدور الاول المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.02.M.Sc.2017.Mo.M (Browse shelf(Opens below)) Not for loan 01010110073583000
CD - Rom CD - Rom مخـــزن الرســائل الجـــامعية - البدروم المكتبة المركزبة الجديدة - جامعة القاهرة Cai01.20.02.M.Sc.2017.Mo.M (Browse shelf(Opens below)) 73583.CD Not for loan 01020110073583000

Thesis (M.Sc.) - Cairo University - Faculty of Computers and Information - Department of Operations Research and Decision Support

Selecting suitable projects from a group of candidate projects considering all constraints and limitations is one of the challenging problems that face any organization. The main purpose of this thesis is to develop an integrated framework to solve the Project Portfolio Selection (PPS) problem. In order to achieve this purpose, 3 main models are developed. First, a model is developed to solve the PPS problem considering the set of criteria as the objective functions representing them as a single objective using weighted method; this model considers a deterministic data and does not handle any uncertainty. Then to capture the stochastic factors affecting the project selection decision, a simulation optimization framework is developed. The first step that is implemented in the framework is to enhance the first model integrating simulation with the optimization model. The second step is to formulate the problem as a multi-objective model by representing each criterion as a separate objective. A binary Cuckoo Search (CS) was proposed to solve the single objective representation of the problem with deterministic data. Then a Monte Carlo simulation is combined with the binary Cuckoo Search to solve the problem under uncertainty. Furthermore, fast Non-dominated sorting was integrated with Monte Carlo simulation to solve the multi-objective model. The results of Binary Cuckoo Search are compared to the results from Lingo software (using default parameters), and it outperformed Lingo. Regarding the stochastic single objective model, the modified CS showed superior results to the Genetic Algorithm obtained from1. Moreover, the fast Non-dominated sorting Cuckoo Search showed better results than the multi-Objective Cuckoo Search mentioned

Issued also as CD

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

Local cover image
Share
Under the supervision of New Central Library Manager

Implemented and Customized by: Eng.M.Mohamady
Contact:   info@cl.cu.edu.eg

© All rights reserved  New Central Library