Loading...
Please wait, while we are loading the content...
Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem a Thesis
| Content Provider | Semantic Scholar |
|---|---|
| Author | El-Halwagi, Mahmoud M. Peters, Brett A. |
| Copyright Year | 2005 |
| Abstract | Greedy Randomized Adaptive Search Procedure for Traveling Salesman Problem. (May 2005) Seung Ho Lee, B.E., Korea University Chair of Advisory Committee: Dr. Sergiy Butenko In this thesis we use greedy randomize adaptive search procedure (GRASP) to solve the traveling salesman problem (TSP). Starting with nearest neighbor method to construct the initial TSP tour, we apply the 2-opt and the path-relinking method for the initial tour improvement. To increase 2-opt search speed, fixed-radius near neighbor search and don′t− look bit techniques are introduced. For the same reason a new efficient data structure, the reverse array, is proposed to represent the TSP tour. Computational results show that GRASP gives fairly good solutions in a short time. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://oaktrust.library.tamu.edu/bitstream/handle/1969.1/3735/etd-tamu-2005A-INEN-Lee-SeungHo.pdf?isAllowed=y&sequence=1 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |