Reduced Complexity Divide and Conquer Algorithm for Large Scale TSP / (Record no. 47525)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 01970cam a2200325 a 4500 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | EG-GiCUC |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20250223031046.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 140923s2014 ua dh f m 000 0 eng d |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | EG-GiCUC |
Language of cataloging | eng |
Transcribing agency | EG-GiCUC |
041 0# - LANGUAGE CODE | |
Language code of text/sound track or separate title | eng |
049 ## - LOCAL HOLDINGS (OCLC) | |
Holding library | Deposite |
097 ## - Thesis Degree | |
Thesis Level | M.Sc |
099 ## - LOCAL FREE-TEXT CALL NUMBER (OCLC) | |
Classification number | Cai01.13.06.M.Sc.2014.Ho.R |
100 0# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Hoda Ahmed Darwish |
245 10 - TITLE STATEMENT | |
Title | Reduced Complexity Divide and Conquer Algorithm for Large Scale TSP / |
Statement of responsibility, etc. | Hoda A. Darwish , Supervised Ihab Talkhan |
246 15 - VARYING FORM OF TITLE | |
Title proper/short title | خوارزم التقسيم والحل منخفض التعقيد لحل مشكلة البائع المتجول ذات الحجم الكبير |
260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
Place of publication, distribution, etc. | Cairo : |
Name of publisher, distributor, etc. | Hoda Ahmed Darwish , |
Date of publication, distribution, etc. | 2014 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | 39 P. : |
Other physical details | charts , facsimiles ; |
Dimensions | 30cm |
502 ## - DISSERTATION NOTE | |
Dissertation note | Thesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Computer Engineering |
520 ## - SUMMARY, ETC. | |
Summary, etc. | This thesis presents an algorithm to solve the NP-hard Traveling Salesman Problem (TSP) problem of finding the shortest path passing through all given cities while only passing by each city once and finishing at the same starting city. It is based on the idea of utilizing a spatial 2geographical3 Divide and Conquer technique in conjunction with heuristic Nearest Neighbor 2-opt TSP algorithm. At a cost of only 9% lower performance, the algorithm has complexity of O((N/{u221A}b)2) where N is the number of cities and b is the number of spatial divisions. This is much lower than published results. Specifically it is lower than the reference Lin-Kernighan algorithm which has computational complexity of O (N2.2)making it practical for real applications |
530 ## - ADDITIONAL PHYSICAL FORM AVAILABLE NOTE | |
Additional physical form available note | Issued also as CD |
653 #4 - INDEX TERM--UNCONTROLLED | |
Uncontrolled term | Computational Geometry |
653 #4 - INDEX TERM--UNCONTROLLED | |
Uncontrolled term | Heuristic Algorithms |
653 #4 - INDEX TERM--UNCONTROLLED | |
Uncontrolled term | Traveling Salesman Problem |
700 0# - ADDED ENTRY--PERSONAL NAME | |
Personal name | Ihab Elsayed Talkhan , |
Relator term | |
856 ## - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | <a href="http://172.23.153.220/th.pdf">http://172.23.153.220/th.pdf</a> |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
Cataloger | Aml |
Reviser | Cataloger |
905 ## - LOCAL DATA ELEMENT E, LDE (RLIN) | |
Cataloger | Nazla |
Reviser | Revisor |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | Dewey Decimal Classification |
Koha item type | Thesis |
Source of classification or shelving scheme | Not for loan | Home library | Current library | Date acquired | Full call number | Barcode | Date last seen | Koha item type | Copy number |
---|---|---|---|---|---|---|---|---|---|
Dewey Decimal Classification | المكتبة المركزبة الجديدة - جامعة القاهرة | قاعة الرسائل الجامعية - الدور الاول | 11.02.2024 | Cai01.13.06.M.Sc.2014.Ho.R | 01010110063425000 | 22.09.2023 | Thesis | ||
Dewey Decimal Classification | المكتبة المركزبة الجديدة - جامعة القاهرة | مخـــزن الرســائل الجـــامعية - البدروم | 11.02.2024 | Cai01.13.06.M.Sc.2014.Ho.R | 01020110063425000 | 22.09.2023 | CD - Rom | 63425.CD |