Fast Heuristics for Large Geometric Traveling Salesman Problems

DOI10.1287/IJOC.4.2.206MaRDI QIDQ4030791zbMATH OpenOpenAlexFDO

Authors Gerhard Reinelt

Publication date 1 April 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.4.2.206

zbMATH Keywords

heuristicstime restrictionsvery large scale traveling salesman problems

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• Fast Algorithms for Geometric Traveling Salesman Problems
• scientific article; zbMATH DE number 91020
• On an algorithm for solving traveling salesman problems of large dimension
• A new heuristic for the traveling salesman problem
• scientific article; zbMATH DE number 1145369
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• Heuristics and bounds for the travelling salesman location problem on the plane
• Faster algorithms for the geometric transportation problem
• Rapid solution of constrained traveling salesman problems
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Cited in

(16)

• The traveling salesman problem: An overview of exact and approximate algorithms
• Quick updates for \(p\)-opt TSP heuristics
• Vehicle routing with a sparse feasibility graph
• Genetic local search in combinatorial optimization
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Routing problems: A bibliography
• Finding Hamiltonian cycles in Delaunay triangulations is NP-complete
• Divide and conquer strategies for parallel TSP heuristics
• Geometric and LP-based heuristics for angular travelling salesman problems in the plane
• Good triangulations yield good tours
• Implementation analysis of efficient heuristic algorithms for the traveling salesman problem
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• Fast Algorithms for Geometric Traveling Salesman Problems
• Provably good solutions for the traveling salesman problem
• TRAVELING SALESMAN PROBLEM OF SEGMENTS
• Evolutionary algorithms for solving multi-objective travelling salesman problem

This page was built for publication: Fast Heuristics for Large Geometric Traveling Salesman Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030791)