z-logo
open-access-imgOpen Access
An efficient hybrid genetic algorithm for solving truncated travelling salesman problem
Author(s) -
S. Purusotham,
T. Jayanth Kumar,
T. Vimala,
K.J. Ghanshyam
Publication year - 2022
Publication title -
decision science letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 18
eISSN - 1929-5804
pISSN - 1929-5812
DOI - 10.5267/j.dsl.2022.6.003
Subject(s) - travelling salesman problem , tree traversal , genetic algorithm , heuristic , mathematical optimization , christofides algorithm , computer science , 2 opt , lin–kernighan heuristic , bottleneck traveling salesman problem , metaheuristic , algorithm , selection (genetic algorithm) , mathematics , artificial intelligence

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom