A NEW INNOVATIVE METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM

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.

RAJABI M.R.; MANSOURIAN A.; TALEAI M.; ALIMOHAMADI A.

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

Journal Paper

Paper Information

Journal: Iranian Journal of Remote Sensing & GIS Year:2013 | Volume:4 | Issue:4 Page(s): 1-19

Download Full-Text

Persian Verion

View:

3,477

Download:

Cites:

Information Journal Paper

Title

A NEW INNOVATIVE METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM

Author(s)

RAJABI M.R. | MANSOURIAN A. | TALEAI M. | ALIMOHAMADI A. | Issue Writer Certificate

Keywords

GISQ2

ROUTINGQ1

GENETIC ALGORITHMQ2

NEAREST NEIGHBORQ2

LOCAL SEARCHQ2

Abstract

Routing issues have many applications in GIS. The main goal in ROUTING is to find the best route passing a series of determined positions. This process has an effective role in many of spatial decision makings. A lot of studies have been accomplished about the optimization of different kinds of ROUTING problems. Traveling Salesman Problem is one of the very old issues in applied sciences. Emerging of new technologies such as GIS caused a lot of new applications for the TSP. A lot of new approaches have been suggested using these technologies to solve TSP. Evolutionary algorithms are one of the methods have been used to solve various optimization problems. Researches have shown that combining LOCAL SEARCH methods with the genetic operators can lead to better results in solving TSP. In this paper, a new and innovative method is presented to solve this ROUTING problem. In this method using the concept of mass center for a set of station points a growing convex polygon is assigned to them. During this process a reliable solution, which is a route, is produced. Besides, a LOCAL SEARCH method based on the GENETIC ALGORITHM and a NEAREST NEIGHBOR algorithm has been implemented to evaluate the results of the new developed method in solving TSP. Evaluation of the results of the genetic method, LOCAL SEARCH and NEAREST NEIGHBORs indicate that the new method can provide acceptable solutions during very short time.

Cites

No record.

References

No record.

Cite

APA: Copy

RAJABI, M.R., MANSOURIAN, A., TALEAI, M., & ALIMOHAMADI, A.. (2013). A NEW INNOVATIVE METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM. REMOTE SENSING & GIS, 4(4), 1-19. SID. https://sid.ir/paper/184192/en

Vancouver: Copy

RAJABI M.R., MANSOURIAN A., TALEAI M., ALIMOHAMADI A.. A NEW INNOVATIVE METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM. REMOTE SENSING & GIS[Internet]. 2013;4(4):1-19. Available from: https://sid.ir/paper/184192/en

IEEE: Copy

M.R. RAJABI, A. MANSOURIAN, M. TALEAI, and A. ALIMOHAMADI, “A NEW INNOVATIVE METHOD FOR SOLVING TRAVELING SALESMAN PROBLEM,” REMOTE SENSING & GIS, vol. 4, no. 4, pp. 1–19, 2013, [Online]. Available: https://sid.ir/paper/184192/en

Related Journal Papers