A MODIFIED ELITE ANT COLONY ALGORITHM FOR SOLVING MULTIPLE TRAVELING SALESMEN 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.

YOUSEFI KHOSHBAKHT M.; SEDIGHPOUR M.

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

Journal Paper

Paper Information

Journal: Journal of Operational Research in its Applications Year:2011 | Volume:8 | Issue:3 (30) Page(s): 83-96

Download Full-Text

Persian Verion

View:

1,730

Download:

Cites:

Information Journal Paper

Title

A MODIFIED ELITE ANT COLONY ALGORITHM FOR SOLVING MULTIPLE TRAVELING SALESMEN PROBLEM

Author(s)

YOUSEFI KHOSHBAKHT M. | SEDIGHPOUR M. | Issue Writer Certificate

Keywords

MULTIPLE TRAVELING SALESMAN PROBLEMQ3

ELITE ANT COLONYQ3

PHEROMONE COEFFICIENTQ3

COMBINATORIAL OPTIMIZATION PROBLEMSQ3

Abstract

The MULTIPLE TRAVELING SALESMAN PROBLEM (MTSP) is one of the most famous COMBINATORIAL OPTIMIZATION PROBLEMS in which m>1 traveling salesmen simultaneously start to move from the node in the name of depot and come back to it after visiting n>m customers so that each customer is visited only once by a salesman. The objective is to minimize the total route visited by all the salesmen. In this paper, a modified ELITE ANT COLONY is applied for this problem differenced in encouragement coefficient of the best route. This coefficient leads that the algorithm has more ability for escaping from local optimum points, and can yield better solutions. Experimental conclusions on standard benchmarks clearly show performance of the new algorithm compared with other meta-heuristic algorithms.

Cites

No record.

References

No record.

Cite

APA: Copy

YOUSEFI KHOSHBAKHT, M., & SEDIGHPOUR, M.. (2011). A MODIFIED ELITE ANT COLONY ALGORITHM FOR SOLVING MULTIPLE TRAVELING SALESMEN PROBLEM. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), 8(3 (30)), 83-96. SID. https://sid.ir/paper/164609/en

Vancouver: Copy

YOUSEFI KHOSHBAKHT M., SEDIGHPOUR M.. A MODIFIED ELITE ANT COLONY ALGORITHM FOR SOLVING MULTIPLE TRAVELING SALESMEN PROBLEM. JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS)[Internet]. 2011;8(3 (30)):83-96. Available from: https://sid.ir/paper/164609/en

IEEE: Copy

M. YOUSEFI KHOSHBAKHT, and M. SEDIGHPOUR, “A MODIFIED ELITE ANT COLONY ALGORITHM FOR SOLVING MULTIPLE TRAVELING SALESMEN PROBLEM,” JOURNAL OF OPERATIONAL RESEARCH AND ITS APPLICATIONS (JOURNAL OF APPLIED MATHEMATICS), vol. 8, no. 3 (30), pp. 83–96, 2011, [Online]. Available: https://sid.ir/paper/164609/en

Related Journal Papers