FINDING THE SHORTEST HAMILTONIAN PATH FOR IRANIAN CITIES, USING TABU SEARCH AND MEMETIC ALGORITHMS

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.

YAGHINI M.; MOMENI M.; SARMADI M.

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

Journal Paper

Paper Information

Journal: Journal of Transportation Engineering Year:2011 | Volume:2 | Issue:2 (6) Page(s): 0-0

Download Full-Text

Persian Verion

View:

1,368

Download:

Cites:

Information Journal Paper

Title

FINDING THE SHORTEST HAMILTONIAN PATH FOR IRANIAN CITIES, USING TABU SEARCH AND MEMETIC ALGORITHMS

Author(s)

YAGHINI M. | MOMENI M. | SARMADI M. | Issue Writer Certificate

Keywords

TRAVELLING SALESMAN PROBLEMQ4

HAMILTONIAN PATHQ4

TABU SEARCH ALGORITHMQ4

MEMETIC ALGORITHMQ4

Abstract

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NP-hard problems. This means that no known algorithm is guaranteed to solve all TSP instances to optimality within reasonable execution time. Due to the different nature of metaheuristics algorithms and the importance and application of TSP in different fields, in this paper the shortest HAMILTONIAN PATH is achieved between 423 Iranian cities by the two types of algorithms. for the first time Tabu search as a single-solution-based algorithm and MEMETIC ALGORITHM as a population-based algorithm is selected. To evaluate the accuracy and efficiency of the proposed algorithms, standard problems with size from 16 cities to 1060 cities have been used. Results demonstrate the performance and effectiveness of proposed algorithms. Java programming language to code algorithms has been used in this research. Parameters tuning for each algorithm is done separately and ultimately the best value for each parameter has been determined. Finally, the performances of each algorithm determined by quality of solution and CPU time and the results have been compared.

Cites

No record.

References

FINDING A MINIMAL HAMILTONIAN TOUR THROUGH A SELECTED SET OF IRANIAN POINTS USING HYBRID ANT COLONY SYSTEM AND LOCAL SEARCH ALGORITHM

Cite

APA: Copy

YAGHINI, M., MOMENI, M., & SARMADI, M.. (2011). FINDING THE SHORTEST HAMILTONIAN PATH FOR IRANIAN CITIES, USING TABU SEARCH AND MEMETIC ALGORITHMS. JOURNAL OF TRANSPORTATION ENGINEERING, 2(2 (6)), 0-0. SID. https://sid.ir/paper/224026/en

Vancouver: Copy

YAGHINI M., MOMENI M., SARMADI M.. FINDING THE SHORTEST HAMILTONIAN PATH FOR IRANIAN CITIES, USING TABU SEARCH AND MEMETIC ALGORITHMS. JOURNAL OF TRANSPORTATION ENGINEERING[Internet]. 2011;2(2 (6)):0-0. Available from: https://sid.ir/paper/224026/en

IEEE: Copy

M. YAGHINI, M. MOMENI, and M. SARMADI, “FINDING THE SHORTEST HAMILTONIAN PATH FOR IRANIAN CITIES, USING TABU SEARCH AND MEMETIC ALGORITHMS,” JOURNAL OF TRANSPORTATION ENGINEERING, vol. 2, no. 2 (6), pp. 0–0, 2011, [Online]. Available: https://sid.ir/paper/224026/en

Related Journal Papers