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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The generalized traveling salesman problem (GTSP) is an extension of thewell-known traveling salesman problem. In GTSP, we are given a partition ofcities into groups and we are required to find a minimum length tour thatincludes exactly one city from each group. The recent studies on this subjectconsider different variations of a memetic algorithm approach to the GTSP. Theaim of this paper is to present a new memetic algorithm for GTSP with apowerful local search procedure. The experiments show that the proposedalgorithm clearly outperforms all of the known heuristics with respect to bothsolution quality and running time. While the other memetic algorithms weredesigned only for the symmetric GTSP, our algorithm can solve both symmetricand asymmetric instances.

A Memetic Algorithm for the Generalized Traveling Salesman Problem