Multiple Trajectory Search for the Maximum Clique Problem
碩士 === 國立中興大學 === 資訊科學與工程學系所 === 97 === The Multiple Trajectory Search (MTS) for solving the maximum clique problem is proposed in this thesis. The maximum clique problem is a famous NP-hard problem in the graph theory and has attracted much attention of researches for a very long period. Since this...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/64619959107701982376 |
| Summary: | 碩士 === 國立中興大學 === 資訊科學與工程學系所 === 97 === The Multiple Trajectory Search (MTS) for solving the maximum clique problem is proposed in this thesis. The maximum clique problem is a famous NP-hard problem in the graph theory and has attracted much attention of researches for a very long period. Since this problem is NP-hard, exact algorithms in general can solve only small-sized instances. In recent years, metaheuristics were proposed to find optimal or near-optimal solutions of this problem. The multiple trajectory search is also a metaheuristic method. It is constituted by an upper level search and a lower level search. The upper level search tries to search a large neighborhood of a solution and this search of large neighborhood is based on the lower level search that searches a small neighborhood.
The experimental results of applying the multiple trajectory search to the eighty problems presented by DIMACS were reported. The performance of the multiple trajectory search for the maximum clique problem is good except the brock and C benchmarks.
|
|---|