English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

salesman problem (TSP) finds applications in wide domains. It is a well known NP Hard problem. In this paper we have proposed nature inspired ant colony optimization on travelling salesman problem. A comparative analysis is done among the standard travelling salesman problem and proposed ant colony based approaches. All the implementations are compared in terms of communication overhead and execution time. It is found that multi colony based approach in which all colonies are independent is most efficient in terms of communication overhead and execution time. Keywordssalesman problem, Ant colony optimization, NP- Hard, metaheuristic.

Solution to Travelling Salesman Problem by Nature Inspired Algorithm