This preview shows pages 1–2. Sign up to view the full content.
Neural Networks, CAP 6615 Spring 2011
Homework 7, Due 18 April 2011
1.
(Haykin Problem 11.3) Consider the Markov chain depicted in Figure P11.3, which is reducible.
Identify the classes of states contained in this state transition diagram.
Figure P11.3
2.
(Haykin Problem 11.4) Calculate the steadystate probabilities of the Markov chain shown in
Fig. P11.4
Figure P11.4
3.
(Haykin Problem 11.7) In this problem, we consider the use of simulated annealing for solving
the
travelingsalesman problem
(TSP). You are given the following:
◦
N
cities
◦
the distance between each pair of cities,
d
◦
a tour represented by a closed path visiting each city once, and only once.
The objective is to find a tour (i.e., permutation of the order in which the cities are visited) that
is of minimal total length
L
. In this problem, the different possible tours are the configurations,
and the total length of a tour is the cost function to be minimized.
(a) Devise an iterative method of generating valid configurations.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 11/30/2011 for the course CAP 6615 taught by Professor Staff during the Spring '08 term at University of Florida.
 Spring '08
 Staff

Click to edit the document details