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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Nowadays swarm intelligence-based algorithms are being used widely tooptimize the dynamic traveling salesman problem (DTSP). In this paper, we haveused mixed method of Ant Colony Optimization (AOC)and gradient descent tooptimize DTSP which differs with ACO algorithm in evaporation rate andinnovative data. This approach prevents premature convergence and scape fromlocal optimum spots and also makes it possible to find better solutions foralgorithm. In this paper, we are going to offer gradient descent and ACOalgorithm which in comparison to some former methods it shows that algorithmhas significantly improved routes optimization.

A new approach in dynamic traveling salesman problem: a hybrid of ant colony optimization and descending gradient