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

We propose a new genetic algorithm with optimal recombination for theasymmetric instances of travelling salesman problem. The algorithm incorporatesseveral new features that contribute to its effectiveness: (i) Optimalrecombination problem is solved within crossover operator. (ii) A new mutationoperator performs a random jump within 3-opt or 4-opt neighborhood. (iii)Greedy constructive heuristic of W.Zhang and 3-opt local search heuristic areused to generate the initial population. A computational experiment on TSPLIBinstances shows that the proposed algorithm yields competitive results to otherwell-known memetic algorithms for asymmetric travelling salesman problem.

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem