This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: So the repetitive nearest neighbor algorithm gives the tour A,E,D,B,C,A with $722 as the cheapest. The CheapestLink Algorithm We then consider CD, AB, and DE which do not close the circuit. BE does close the circuit. Add BE to your graph. The total cost of this tour is : 119+120+150+152+200= $741 The cheapestlink algorithm gives the tour: A,C,E,B,D.A and costs 119+120+150+152+200= $741 Willy’s optimal tour using the bruteforce algorithm is A,D,C,B,E,A and costs $676. The repetitive nearest neighbor algorithm gives the tour A,E,D,B,C,A and costs $722. Relative error of a tour (e) e=(cost of tourcost of optimal tour)/cost of optimal tour relative error for the repetitive nearest neighbor algorithm=(722676)/676= 0.068047=6.80% relative error for the cheapestlink algorithm=(741676)/676= 0.096154=9.62% Method Optimal? Efficient? Bruteforce Yes No Repetitive nearestNo Yes neighbor Cheapest link No Yes...
View
Full
Document
This note was uploaded on 01/20/2012 for the course MATH 103 taught by Professor Berkowitz during the Spring '07 term at Rutgers.
 Spring '07
 Berkowitz
 Math

Click to edit the document details