A hybrid computational intelligent approach to solve project scheduling problems / Elshimaa Ahmed Ramadan Ibrahim Elgendi ; Supervised Mohamed Hassan Rasmy , Omar Soliman Soliman
Material type:
- أسلوب حسابى ذكى مهجن لحل مشاكل جدولة المشروعِ [Added title page title]
- Issued also as CD
Item type | Current library | Home library | Call number | Copy number | Status | Barcode | |
---|---|---|---|---|---|---|---|
![]() |
قاعة الرسائل الجامعية - الدور الاول | المكتبة المركزبة الجديدة - جامعة القاهرة | Cai01.20.02.Ph.D.2015.El.H (Browse shelf(Opens below)) | Not for loan | 01010110067762000 | ||
![]() |
مخـــزن الرســائل الجـــامعية - البدروم | المكتبة المركزبة الجديدة - جامعة القاهرة | Cai01.20.02.Ph.D.2015.El.H (Browse shelf(Opens below)) | 67762.CD | Not for loan | 01020110067762000 |
Browsing المكتبة المركزبة الجديدة - جامعة القاهرة shelves Close shelf browser (Hides shelf browser)
Thesis (Ph.D.) - Cairo University - Faculty of Computers and Information - Department of Operations Research and Decision Support
Multi-mode resource-constrained project scheduling problem (MRCPSP) is one of the most important problems in the context of project scheduling. MRCPSP is a notoriously difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms to find optimal or near-optimal solutions [7, 25, 30, 45]. Estimation of Distribution Algorithms (EDAs) are some of the most powerful evolutionary algorithms (EAs). The first motivation behind the emergence of EDAs, is to identify and exploit the linkage between variables in the solution in order to assist the evolution. Unlike other EAs, EDAs do not use crossover or mutation. Instead, they explicitly extract global statistical information from the previous search and build a posterior probability model of promising solutions, based on the extracted information
Issued also as CD
There are no comments on this title.