Experimental analysis of heuristics for the bottleneck traveling salesman problem

DOI10.1007/s10732-012-9194-6zbMath1358.90170OpenAlexW1995945236MaRDI QIDQ519098

John LaRusic, Eric Aubanel, Abraham P. Punnen

Publication date: 4 April 2017

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-012-9194-6

zbMATH Keywords

traveling salesman problemheuristic algorithmsexperimental analysisbottleneck TSPmaximum scatter TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (6)

Unified encoding for hyper-heuristics with application to bioinformatics ⋮ The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis ⋮ Advancing Shannon entropy for measuring diversity in systems ⋮ A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions ⋮ An efficient heuristic algorithm for the bottleneck traveling salesman problem ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem

Uses Software

• TSPLIB
• LKH
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
• Guaranteed performance heuristics for the bottleneck traveling salesman problem
• An approximation algorithm for a bottleneck traveling salesman problem
• Algorithms for the minimax problem of the travelling salesman. II: Dual approach
• Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
• An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• On Gilmore-Gomory's open question for the bottleneck TSP.
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• A linear time algorithm for the bottleneck biconnected spanning subgraph problem
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• An Algorithm for the Bottleneck Traveling Salesman Problem
• The Bottleneck Traveling Salesman Problem
• On the Maximum Scatter Traveling Salesperson Problem
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Bottleneck extrema
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Experimental analysis of heuristics for the bottleneck traveling salesman problem