An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
type: Item
instance of: scholarly article
title: An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
zbMATH Open document ID: 1277.90150
DOI: 10.1186/2251-7456-7-10
author: Zakir Hussain Ahmed
published in: Mathematical Sciences
publication date: 2013-12-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6237507
zbMATH Keywords: maximum traveling salesman problem
zbMATH Keywords: hybrid genetic algorithm
zbMATH Keywords: sequential constructive crossover
zbMATH Keywords: 2-opt search
zbMATH Keywords: local search
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1186/2251-7456-7-10
OpenAlex ID: W2114386582
Wikidata QID: Q59294210
cites work: Q5187226
cites work: Q4198056
cites work: An -approximation algorithm for the asymmetric maximum TSP
cites work: Q4461914
cites work: Approximating Capacitated Routing and Delivery Problems
cites work: Rotations of Periodic Strings and Short Superstrings
cites work: Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
cites work: A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
cites work: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
cites work: Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
cites work: 35/44-approximation for asymmetric maximum TSP with triangle inequality
cites work: Simpler approximation of the maximum asymmetric traveling salesman problem
cites work: Better approximations for max TSP
cites work: Improved deterministic approximation algorithms for max TSP
cites work: Deterministic 7/8-approximation for the metric maximum TSP
cites work: The maximum travelling salesman problem on symmetric Demidenko matrices
cites work: An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
cites work: The maximum traveling salesman problem on van der Veen matrices
cites work: Q4692508
cites work: Q4315824
description: scientific article; zbMATH DE number 6237507