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

In this paper, we present a new mutation operator, Hybrid Mutation (HPRM),for a genetic algorithm that generates high quality solutions to the TravelingSalesman Problem (TSP). The Hybrid Mutation operator constructs an offspringfrom a pair of parents by hybridizing two mutation operators, PSM and RSM. Theefficiency of the HPRM is compared as against some existing mutation operators;namely, Reverse Sequence Mutation (RSM) and Partial Shuffle Mutation (PSM) forBERLIN52 as instance of TSPLIB. Experimental results show that the new mutationoperator is better than the RSM and PSM.

Hybridizing PSM and RSM Operator for Solving NP-Complete Problems: Application to Travelling Salesman Problem