Revisiting the Simulated Annealing Algorithm from a Teaching Perspective
Year: 2016
Type: conference-paper
Abstract: Hill climbing and simulated annealing are two fundamental search techniques integrating most artificial intelligence and machine learning courses curricula. These techniques serve as introduction to stochastic and probabilistic based metaheuristics. Simulated annealing can be considered a hill-climbing variant with a probabilistic decision. While simulated annealing is conceptually a simple algorithm, in practice it can be difficult to parameterize. In order to promote a good simulated annealing algorithm perception by students, a simulation experiment is reported here. Key implementation issues are addressed, both for minimization and maximization problems. Simulation results are presented.
Institutions: INESC TEC, Centro ALGORITMI, University of Minho
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
SDG: Quality education
Open Access status: hybrid
OpenAlex ID: W2525196195
