Name
Abstract | ||
|---|---|---|
Simulated annealing is a well-known search algorithm used with success history in many search problems. However, the random walk of the simulated annealing does not benefit from the memory of visited states, causing excessive random search with no diversification history. Unlike memory-based search algorithms such as the tabu search, the search in simulated annealing is dependent on the choice of the initial temperature to explore the search space, which has little indications of how much exploration has been carried out. The lack of exploration eye can affect the quality of the found solutions while the nature of the search in simulated annealing is mainly local. In this work, a methodology of two phases using an automatic diversification and intensification based on memory and sensing tools is proposed. The proposed method is called Simulated Annealing with Exploratory Sensing. The computational experiments show the efficiency of the proposed method in ensuring a good exploration while finding good solutions within a similar number of iterations. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.3390/a13090230 | ALGORITHMS |
Keywords | DocType | Volume |
simulated annealing, exploration, intensification, sensing search, search memory | Journal | 13 |
Issue | Citations | PageRank |
9 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Majid Almarashi | 1 | 0 | 0.34 |
| Wael A. Deabes | 2 | 5 | 4.12 |
| Hesham H. Amin | 3 | 6 | 2.94 |
| Abdel-Rahman Hedar | 4 | 404 | 30.79 |