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

Received 10.03.2017, received in revised form 10.06.2017, accepted 20.08.2017 In this work authors introduce and study the self-configuring Genetic Algorithm (GA) and the selfconfiguring Ant Colony Optimization (ACO) algorithm and apply them to one of the most known combinatorial optimization task – Travelling Salesman Problem (TSP). The estimation of suggested algorithms performance is fulfilled on well-known benchmark TSP and then compared with other heuristics such as Lin-Kernigan (3-opt local search) and Intelligent Water Drops algorithm (IWDs). Numerical experiments show that suggested approach demonstrates the competitive performance. Both adaptive algorithms show good results on these problems as they outperform other algorithms with their settings with average performance.

Self-configuring Nature Inspired Algorithms for Combinatorial Optimization Problems