Date of Defense
This chapter presents the traveling salesperson problem as an example of combinatorial optimization, introduces simulated annealing as a category of approximation algorithms, and explains how the Boltzmann machine is a biologically inspired implementation of simulated annealing. An example is given of how a Boltzmann Machine can be used to get approximate solutions to the traveling salesperson problem.
Tesar, Bruce Benson, "Investigations of Parallel Implementations of Boltzmann Machines" (1990). Honors Theses. 1497.
Honors Thesis-Campus Only