SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM BY A NOVEL METAHEURISTIC ALGORITHM

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.

LARKI HOSSEIN; YOUSEFIKHOSHBAKHT MAJID

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2014 | Volume:8 | Issue:3 (16) Page(s): 55-63

Download Full-Text

View:

423

Download:

172

Cites:

Information Journal Paper

Title

SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM BY A NOVEL METAHEURISTIC ALGORITHM

Author(s)

LARKI HOSSEIN | YOUSEFIKHOSHBAKHT MAJID | Issue Writer Certificate

Keywords

IMPERIALIST COMPETITIVE ALGORITHM

MULTIPLE TRAVELING SALESMAN PROBLEM

LIN-KERNIGAN ALGORITHM

NP-HARD PROBLEMS

Abstract

The MULTIPLE TRAVELING SALESMAN PROBLEM (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorithm which has been developed through combining Modified IMPERIALIST COMPETITIVE ALGORITHM and LIN-KERNIGAN ALGORITHM (MICA) in order to solve the MTSP. In the proposed algorithm, an absorption function and several local search algorithms as a revolution operator are used.The performance of our algorithm was tested on several MTSP benchmark problems and the results confirmed that the MICA performs well and is quite competitive with other meta-heuristic algorithms.

Cites

No record.

References

Cite

APA: Copy

LARKI, HOSSEIN, & YOUSEFIKHOSHBAKHT, MAJID. (2014). SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM BY A NOVEL METAHEURISTIC ALGORITHM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 8(3 (16)), 55-63. SID. https://sid.ir/paper/632296/en

Vancouver: Copy

LARKI HOSSEIN, YOUSEFIKHOSHBAKHT MAJID. SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM BY A NOVEL METAHEURISTIC ALGORITHM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2014;8(3 (16)):55-63. Available from: https://sid.ir/paper/632296/en

IEEE: Copy

HOSSEIN LARKI, and MAJID YOUSEFIKHOSHBAKHT, “SOLVING THE MULTIPLE TRAVELING SALESMAN PROBLEM BY A NOVEL METAHEURISTIC ALGORITHM,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 8, no. 3 (16), pp. 55–63, 2014, [Online]. Available: https://sid.ir/paper/632296/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops