Integrating Case-Based Reasoning, Knowledge-Basedapproach and Tsp Algorithm For Minimum Tourfinding

Imagine you have traveled to an unfamiliar city. before you start your daily (our around city.you need to know a good route. in network theory (nt). this is the traveling salesman problem(tspl. a dynamic programming algorithm is often used for solving this problem. however. whenthe road network of the city is very complicated and dense, which is usually the case: it will take toolong for the algorithm to find the shortest path. furthermore. in reality, things arc not as simple asthose stated in at. for instance. the cost of travel for the same part of the city at different timesmay not be the same. in this project. we have integrated tsp algorithm with ai knowledge-basedapproach and case-based reasoning in solving the problem. with this integration, knowledge aboutthe geographical information and past cases are used to help tsp algorithm in finding a solution.this approach dramatically reduces the computation time required for minimum tour finding.