Document Type

Report

Date

6-1992

Keywords

G.3 [Probability and Statistics]: Probabilistic algorithms (Monte Carlo), Algorithms, Simulated annealing, traveling salesperson

Language

English

Disciplines

Computer Sciences

Description/Abstract

This tutorial describes simulated annealing, an optimization method based on the principles of statistical mechanics. Simulated annealing finds near-optimal solutions to optimization problems that cannot be solved exactly because they are NP-complete. The method is illustrated by a Pascal algorithm for the traveling salesperson problem. The performance of the algorithm was measured on a Computing Surface.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-02-12

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.