| Abstrakt: |
A novel hybrid genetic scheme to solve the traveling salesman problem is presented in this paper. The proposed scheme has two major steps: clustering and global optimization. The clustering step is used to obtain an initial solution that is used as seed. The global optimization uses this seed to produce a better result using genetic operators. A number of benchmarks have been used to evaluate the proposed scheme. The solutions to these benchmarks which include 105-, 318-, 1060-, 2152-, 3038-, and 5934-city TSPs are extremely close to the best known solutions. This scheme is the first genetic approach that deals with large TSP benchmarks. |
