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

Ant colony algorithm is a new heuristic optimization algorithm suitable for solving complex combinatorial optimization problems. Traditional ant colony algorithm converges slowly, and falls into local optimal solution, this paper presents a negative feedback connection weights improved ant colony algorithm. On the basis of the core to the ant colony algorithm, according to the selection result and continue to function through a negative feedback to adjust the connection weights, in order to achieve optimal search algorithm. In this paper, the choice of the path Yuan tong Express, for example, to the shortest path is selected as the objective function, the optimization functions by negative feedback connection weight, effectively improve the convergence speed and overall performance, it can better solve the optimal path of express logistics the selection problem.

Improved Ant Colony Algorithm in Logistics Time Optimal Path Selection based on the Positive and Negative Feedback and Neighboring Rights