Loading...
Please wait, while we are loading the content...
Similar Documents
Intelligent neighborhood exploration in local search heuristics (2006)
| Content Provider | CiteSeerX |
|---|---|
| Author | Devarenne, Isabelle Mabed, Hakim Caminada, Re |
| Description | Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming evaluation, the total exploration of the neighborhood is impractical. In this paper, we present an adaptive exploration of neighborhood using extension and restriction mechanisms represented by a loop detection mechanism and a tabu list structure. This approach is applied to the K-coloring problem and evaluated on standard benchmarks like DIMACS in comparison with more powerful recently published algorithms. |
| File Format | |
| Language | English |
| Publisher | IEEE Computer Society |
| Publisher Date | 2006-01-01 |
| Publisher Institution | In Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI ’06 |
| Access Restriction | Open |
| Subject Keyword | Standard Benchmark Current Solution Neighborhood Adaptive Exploration Complete Exploration Local Search Heuristic Search Method Total Exploration K-coloring Problem Loop Detection Mechanism Intelligent Neighborhood Exploration Restriction Mechanism Large Neighborhood Time-consuming Evaluation Tabu List Structure |
| Content Type | Text |
| Resource Type | Article |
