COMBINING GENETIC AND ARTIFICIAL BEE COLONY ALGORITHMS TO SOLVE TRAVELLING 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.

Yousefi Malek

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON RESEARCH IN ELECTRICAL AND COMPUTER ENGINEERING
Year:2016 | Issue:1

Download Full-Text

View:

123

Download:

161

Information Seminar Paper

Title

COMBINING GENETIC AND ARTIFICIAL BEE COLONY ALGORITHMS TO SOLVE TRAVELLING SALESMAN PROBLEM

Author(s)

Yousefi Malek

Keywords

TRAVELLING SALESMAN PROBLEM

GENETIC ALGORITHM

ARTIFICIAL BEE COLONY ALGORITHM

NP-HARD PROBLEM

Abstract

ONE OF THE MAIN GRAPH ALGORITHMIC PROBLEMS IS TRAVELLING SALESMAN PROBLEM (TSP). THIS PROBLEM IS ONE OF THE NP-HARD OPTIMIZATION PROBLEMS THAT HAS NO CALCULATING SOLUTION AND MAYBE THERE’S NO EXACT SOLUTION IN POLYNOMINAL TIME. THE GOAL OF TSP IS ACHIEVING THE SHORTEST PATH AMONG A COLLECTION OF CITIES, SO THAT EACH CITY IS VISITED JUST ONCE IN THE PATH AND CONSTRUCTED PATH LEADS TO THE FIRST CITY. IN THIS ARTICLE, FOR SOLVING TSP, ARTIFICIAL BEE COLONY (ABC) AND GENETIC ALGORITHM (GA) WERE COMBINED, WE COMPARED IT WITH GA AND ABC ALGORITHMS.

Cites

No record.

References

No record.

Cite

APA: Copy

Yousefi, Malek. (2016). COMBINING GENETIC AND ARTIFICIAL BEE COLONY ALGORITHMS TO SOLVE TRAVELLING SALESMAN PROBLEM. INTERNATIONAL CONFERENCE ON RESEARCH IN ELECTRICAL AND COMPUTER ENGINEERING. SID. https://sid.ir/paper/928571/en

Vancouver: Copy

Yousefi Malek. COMBINING GENETIC AND ARTIFICIAL BEE COLONY ALGORITHMS TO SOLVE TRAVELLING SALESMAN PROBLEM. 2016. Available from: https://sid.ir/paper/928571/en

IEEE: Copy

Malek Yousefi, “COMBINING GENETIC AND ARTIFICIAL BEE COLONY ALGORITHMS TO SOLVE TRAVELLING SALESMAN PROBLEM,” presented at the INTERNATIONAL CONFERENCE ON RESEARCH IN ELECTRICAL AND COMPUTER ENGINEERING. 2016, [Online]. Available: https://sid.ir/paper/928571/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops