An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem

DOI10.1186/2251-7456-7-10zbMath1277.90150OpenAlexW2114386582WikidataQ59294210 ScholiaQ59294210MaRDI QIDQ387104

Zakir Hussain Ahmed

Publication date: 11 December 2013

Published in: Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/2251-7456-7-10

zbMATH Keywords

local searchhybrid genetic algorithm2-opt searchmaximum traveling salesman problemsequential constructive crossover

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Experimental study of a hybrid genetic algorithm for the multiple travelling salesman problem ⋮ Optimization for multi-objective sum of linear and linear fractional programming problem: fuzzy nonlinear programming approach

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 35/44-approximation for asymmetric maximum TSP with triangle inequality
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• Deterministic 7/8-approximation for the metric maximum TSP
• Improved deterministic approximation algorithms for max TSP
• An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
• Better approximations for max TSP
• The maximum traveling salesman problem on van der Veen matrices
• The maximum travelling salesman problem on symmetric Demidenko matrices
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
• Approximating Capacitated Routing and Delivery Problems
• Rotations of Periodic Strings and Short Superstrings
• A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP
• Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
• An -approximation algorithm for the asymmetric maximum TSP

This page was built for publication: An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem