Approximate Traveling Salesman Algorithms

DOI10.1287/OPRE.28.3.694MaRDI QIDQ3893692zbMATH OpenOpenAlexFDO

Authors Bruce Golden, Lawrence Bodin, T. B. Doyle, W. Jun. Stewart

Publication date 1980

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.28.3.694

zbMATH Keywords

heuristic algorithmscomparison of algorithmsnumerical theoryapproximate traveling salesman algorithmslarge scale traveling salesman problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(40)

• Locating concentrators in centralized computer networks
• Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
• IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
• Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach
• Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
• On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem
• Genetic algorithms and traveling salesman problems
• Set-up saving schemes for printed circuit boards assembly
• A computational tool for optimizing the urban public transport: A real application
• Heuristic methods and applications: A categorized survey
• An empirical study of a new metaheuristic for the traveling salesman problem
• A diagonal completion and 2-optimal procedure for the travelling salesman problem
• One-to-many-to-one single vehicle pickup and delivery problems
• Global strategies for augmenting the efficiency of TSP heuristics
• Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure
• A two-dimensional mapping for the traveling salesman problem
• Lower Bounds for Insertion Methods for TSP
• Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie
• A comparison of techniques for solving the fleet size and mix vehicle routing problem
• Operational estimators for the length of a traveling salesman tour
• A hybrid algorithm for TSP
• Time complexity of the analyst's traveling salesman algorithm
• On the method of interchanging networks for permutation problems
• The fleet size and mix vehicle routing problem
• On the complexity of generating synchronizable test sequences
• A tabu search approach to an urban transport problem in northern Spain
• A model for warehouse order picking
• Convex-hull based two-phase algorithm to solve capacitated vehicle routing problem
• Multiple stack branch and bound
• A useful transform of standard input data for a classical NP-complete problem
• Point estimation of a global optimum for large combinatorial problems
• A generalized set partitioning model for MinMax vehicle routing
• Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
• A parallel insert method for the capacitated arc routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Tourenplanung für zwei Depots bei offenen Touren
• Heuristics and their design: A survey
• Asymptotic expected performance of some TSP heuristics: An empirical evaluation
• Shuffling heuristics for the storage location assignment in an AS/RS
• Determination of optimal path under approach and exit constraints

This page was built for publication: Approximate Traveling Salesman Algorithms

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