| 000 | 02007cam a2200313 a 4500 | ||
|---|---|---|---|
| 003 | EG-GiCUC | ||
| 008 | 110317s2010 ua d f m 000 0 eng d | ||
| 040 |
_aEG-GiCUC _beng _cEG-GiCUC |
||
| 041 | 0 | _aeng | |
| 049 | _aDeposite | ||
| 097 | _aM.Sc | ||
| 099 | _aCai01.18.05.M.Sc.2010.Ah.A | ||
| 100 | 0 | _aAhmed Abdelhamied Abdelaziz Zakzouk | |
| 245 | 1 | 3 |
_aAn ant colony optimization approach for solving shortest path problem with fuzzy constraints / _cAhmed Abdelhamied Abdelaziz Zakzouk ; Supervised Hegazy Mohamed Zaher , Ramadan Abdelhamied Zean Eldeen |
| 246 | 1 | 5 | _aحل مشكلة المسار الأقصر ذات القيود المبهمة باستخدام منهجية مستعمرة النمل |
| 260 |
_aCairo : _bAhmed Abdelhamied Abdelaziz Zakzouk , _c2010 |
||
| 300 |
_a129 Leaves : _bcharts ; _c30cm |
||
| 502 | _aThesis (M.Sc.) - Cairo University - Institute of Statistical Studies and Research - Department of Operation Research | ||
| 520 | _aThis thesis presents an ant colony optimization approach ( ACO ) to solve the shortest path problem, especially with fuzzy constraints; this thesis consists of five chapters as follows: in chapter one we introduce an introduction, summary and review of literature, in chapter two we handle the shortest path problem in details, in chapter three an ant colony optimization approach is introduced as a methodology for solving the shortest path problem, in chapter four we introduce an introduction on fuzzy sets, definitions, formulation algorithms, in chapter five we introduce the supposed algorithm and we have got two empirical formulas which give the best convergence to the optimal solution | ||
| 530 | _aIssued also as CD | ||
| 653 | 4 | _aAnt colony optimization | |
| 653 | 4 | _aFuzzy constraints | |
| 653 | 4 | _aShortest path problem | |
| 700 | 0 |
_aHegazy Mohamed Zaher , _eSupervisor |
|
| 700 | 0 |
_aRamadan Abdelhamied Zean Eldeen , _eSupervisor |
|
| 905 |
_aEnas _eCataloger |
||
| 905 |
_aNazla _eRevisor |
||
| 942 |
_2ddc _cTH |
||
| 999 |
_c33329 _d33329 |
||