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

The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hardcombinatorial optimization problems. A variant of GTSP is E-GTSP where E,meaning equality, has the constraint: exactly one node from a cluster of agraph partition is visited. The main objective of the E-GTSP is to find aminimum cost tour passing through exactly one node from each cluster of anundirected graph. Agent-based approaches involving are successfully usednowadays for solving real life complex problems. The aim of the current paperis to illustrate some variants of agent-based algorithms including ant-basedmodels with specific properties for solving E-GTSP.

A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP