tspbb.pdf - Traveling salesman What are the differences...

• 10

Course Hero uses AI to attempt to automatically extract content from documents to surface to you and others so you can study better, e.g., in search results, to enrich docs, and more. This preview shows page 1 - 10 out of 10 pages.

Traveling salesman
What are the differences between 'Backtracking'and 'Branch & Bound' Algorithm techniques?
Here is the state space tree for n=4 (Using Branch And Bound)
What is traveling salesman problem?Let us look at a situation that there are 5 cities,which are represented as NODES.There is a Person at NODE-1This person has to reach each nodes one and onlyones and come back to original (starting) positionThis process has to occur with minimum cost orminimum distance travelled.Note that starting point can start with any Node. ForExample:1-2-4-5-3-11-5-2-3-4-1
How to compute the cost of each node?A row/column is said to be reduce iff it contains at least one zero andall remaining entries are non-negative.A matrix is reduced iff every row and column is reduced.Rules of reduced cost matrix :1. Change all entries in row i and column j from A to inf2. Set A[j,1] to inf3. Reduce all rows and columns in the resulting except for rows andcolumn containing only inf.4. Cost Function C(s)=C(R)+A[i,j]+ r[rtotal reduce value]
-10-2-2-3-4REDUCTION (ROW)INF2030101115INF1642
End of preview. Want to read all 10 pages?

Course Hero member to access this document

Term
Winter
Professor
Ankit Kaundal
Tags
NP complete, Cutting stock problem, Function problem