INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

ERFANI HOSSEIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF OPTIMIZATION Year:2009 | Volume:1 | Issue:2 Page(s): 151-161

Download Full-Text

View:

341

Download:

142

Cites:

Information Journal Paper

Title

INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING

Author(s)

ERFANI HOSSEIN | Issue Writer Certificate

Keywords

CASE-BASED REASONING

KNOWLEDGE-BASED APPROACH

TRAVELING SALESMAN PROBLEM

CASE-BASED TOUR FINDER

KNOWLEDGE-BASED ROUTE FINDER

GEOGRAPHICAL INFORMATION

Abstract

Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the TRAVELING SALESMAN PROBLEM (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long for the algorithm to find the shortest path. Furthermore, in reality, things are not as simple as those stated in AT. For instance, the cost of travel for the same part of the city at different times may not be the same. In this project, we have integrated TSP algorithm with AI KNOWLEDGE-BASED APPROACH and CASE-BASED REASONING in solving the problem. With this integration, knowledge about the 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.

Multimedia

No record.

Cites

No record.

References

Cite

APA: Copy

ERFANI, HOSSEIN. (2009). INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING. IRANIAN JOURNAL OF OPTIMIZATION, 1(2), 151-161. SID. https://sid.ir/paper/327309/en

Vancouver: Copy

ERFANI HOSSEIN. INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING. IRANIAN JOURNAL OF OPTIMIZATION[Internet]. 2009;1(2):151-161. Available from: https://sid.ir/paper/327309/en

IEEE: Copy

HOSSEIN ERFANI, “INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING,” IRANIAN JOURNAL OF OPTIMIZATION, vol. 1, no. 2, pp. 151–161, 2009, [Online]. Available: https://sid.ir/paper/327309/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops