INTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
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 netwo...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Islamic Azad University, Rasht Branch
2009-07-01
|
Series: | Iranian Journal of Optimization |
Subjects: | |
Online Access: | http://ijo.iaurasht.ac.ir/pdf_513245_3c4d2bff5986f79d2b7094d0cd0a9317.html |