Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

Abstract
Acknowledgements
History
Motivation
Purpose
1. Introduction of the Structure of TSP
1.1 Arcs, Edges, and Tours
Figure 2: Network with 4 cities and 6 arcs
Figure 3: Graph of Nodes vs. arcs and Nodes vs. Tours
2. Solution methods of TSP
Introduction
2.1 Brute-force method
Figure 4: A 4 city TSP
Figure 5: Tour 1 of a 4 city TSP
Figure 7: Tour 3 of a 4 city TSP
Figure 8: A 5 city TSP
Figure 13: Tour 5 of a 5 city TSP Figure 14: Tour 6 of a 5 city TSP
Table 3: Estimated time to solve TSP using Brute-force method. [5]
2.2 Nearest Neighbor (Greedy)
Figure 21: Network of a 4 city TSP
Figure 22: Tour of a 4 city TSP using Nearest Neighbor Heuristic
Figure 23: Network of a 5 city TSP
Figure 24: Tour of a 4 city TSP using Nearest Neighbor Heuristic
2.3 Greedy Approach
Figure 25: A 4 city TSP network
Figure 26: A greedy approach with 4 cities
Figure 28: A greedy approach with 5 cities
2.4 Branch and Bound
3. Implementations of TSP in MATLAB
3.1 Implementation of Brute-force
Figure 29: Optimal tour of 11 cities in MATLAB using Brute-force
3.2 Implementation of Branch and Bound
Figure 30: Optimal tour of 12 cities in MATLAB using Branch and Bound
Table 4: Computational results comparing Brute-force and Branch and Bound
4. Chinese Postman Problem (CPP)
Table 5: Comparison of TSP and CPP
Conclusion/Future Work
Appendix A
MATLAB Code 1
Appendix B
MATLAB Code 2
Appendix C
MATLAB Code 3
References
0 of .
Results for:
P. 1
Ann Em Senior Project

# Ann Em Senior Project

Ratings: (0)|Views: 1,512|Likes:

See more
See less

01/16/2013

pdf

text

original