Greedy randomized adaptive search procedure for traveling salesman problem /
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[College Station, Tex.] :
[Texas A&M University],
[2006]
|
| Subjects: | |
| Online Access: | Link to OAK Trust copy |
| Abstract: | 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. |
|---|---|
| Item Description: | "Major Subject: Industrial Engineering" Title from author supplied metadata (automated record created on Sep. 15, 2006.) Vita. Abstract. Electronic resource. |
| Format: | Mode of access: World Wide Web. System requirements: World Wide Web access and Adobe Acrobat Reader. |
| Bibliography: | Includes bibliographical references. |