000			01970cam a2200325 a 4500
003			EG-GiCUC
005			20250223031046.0
008			140923s2014 ua dh f m 000 0 eng d
040			_aEG-GiCUC _beng _cEG-GiCUC
041	0		_aeng
049			_aDeposite
097			_aM.Sc
099			_aCai01.13.06.M.Sc.2014.Ho.R
100	0		_aHoda Ahmed Darwish
245	1	0	_aReduced Complexity Divide and Conquer Algorithm for Large Scale TSP / _cHoda A. Darwish , Supervised Ihab Talkhan
246	1	5	_aخوارزم التقسيم والحل منخفض التعقيد لحل مشكلة البائع المتجول ذات الحجم الكبير
260			_aCairo : _bHoda Ahmed Darwish , _c2014
300			_a39 P. : _bcharts , facsimiles ; _c30cm
502			_aThesis (M.Sc.) - Cairo University - Faculty of Engineering - Department of Computer Engineering
520			_aThis 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			_aIssued also as CD
653		4	_aComputational Geometry
653		4	_aHeuristic Algorithms
653		4	_aTraveling Salesman Problem
700	0		_aIhab Elsayed Talkhan , _eSupervisor
856			_uhttp://172.23.153.220/th.pdf
905			_aAml _eCataloger
905			_aNazla _eRevisor
942			_2ddc _cTH
999			_c47525 _d47525