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

This paper presents a powerful genetic algorithm(GA) to solve the travelingsalesman problem (TSP). To construct a powerful GA, I use edge swapping(ES)with a local search procedure to determine good combinations of building blocksof parent solutions for generating even better offspring solutions.Experimental results on well studied TSP benchmarks demonstrate that theproposed GA is competitive in finding very high quality solutions on instanceswith up to 16,862 cities.

A Powerful Genetic Algorithm for Traveling Salesman Problem