- 849 Downloads
In many applications, the parameters which are sought to minimize (or maximize) the objective function are not continuously varying. For instance, a salesperson is to travel through a series of cities in an order that gives the shortest traveling distance. The parameters take the form of integers in this case. And as the number of cities increases, the number of possible configurations (sequences) grows rapidly, rendering exhaustive search infeasible.
KeywordsSimulated Annealing Ising Model Travel Salesman Problem Metropolis Algorithm Dimensional Array
Unable to display preview. Download preview PDF.