Fast Algorithms for Geometric Traveling Salesman Problems

DOI10.1287/IJOC.4.4.387zbMATH Open0758.90071OpenAlexW2102076751MaRDI QIDQ4024311FDOQ4024311

Publication date: 25 February 1993

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

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

Recommendations

Fast Heuristics for Large Geometric Traveling Salesman Problems
scientific article; zbMATH DE number 1145369
Faster algorithms for the geometric transportation problem
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Rapid solution of constrained traveling salesman problems
The geometric maximum traveling salesman problem
Approximation algorithms for the traveling salesman problem
Approximation algorithms for the Geometric Covering Salesman Problem
scientific article; zbMATH DE number 4095236
Approximation algorithms for geometric shortest path problems

approximate traveling salesman tours multidimensional point sets starting heuristics uniform planar million-city traveling salesman

Mathematics Subject Classification ID

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

Cited In (75)

Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
First vs. best improvement: an empirical study
IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem
Fast local search algorithms for the handicapped persons transportation problem
Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
Sequential search and its application to vehicle-routing problems
Match twice and stitch: a new TSP tour construction heuristic.
A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
Variable neighborhood search: Principles and applications
Genetically improved presequences for Euclidean traveling salesman problems
Design and analysis of stochastic local search for the multiobjective traveling salesman problem
Speed-up techniques for solving large-scale biobjective TSP
New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
Method to solve the travelling salesman problem using the inverse of diffusion process
Instance-specific multi-objective parameter tuning based on fuzzy logic
An improved ant colony system for the sequential ordering problem
Variable neighborhood search
New edges not used in shortest tours of TSP
Genetic operators for combinatorial optimization in TSP and microarray gene ordering
Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
Lasso solution strategies for the vehicle routing problem with pickups and deliveries
Fast Heuristics for Large Geometric Traveling Salesman Problems
Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem
Divide and conquer strategies for parallel TSP heuristics
Guided local search and its application to the traveling salesman problem
Traveling salesman problem heuristics: leading methods, implementations and latest advances
Expanding neighborhood GRASP for the traveling salesman problem
Good triangulations yield good tours
Solving large-scale TSP using a fast wedging insertion partitioning approach
A new adaptive multi-start technique for combinatorial global optimizations
Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
A guided local search heuristic for the capacitated arc routing problem
Routing problems: A bibliography
A note on single alternating cycle neighborhoods for the TSP
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
Coupling ant colony systems with strong local searches
Minimizing labor requirements in a periodic vehicle loading problem
Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
A hybrid particle swarm optimization approach for the sequential ordering problem
An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms
Estimation-based metaheuristics for the probabilistic traveling salesman problem
Title not available (Why is that?)
Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
Transgenetic algorithm for the traveling purchaser problem
Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
On the solving strategy in composite heuristics
A discrete gravitational search algorithm for solving combinatorial optimization problems
Assigning real-time tasks to heterogeneous processors by applying ant colony optimization
Iterated local search for the quadratic assignment problem
An effective implementation of the Lin-Kernighan traveling salesman heuristic
A hybrid metaheuristic for the quadratic assignment problem
Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem
A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
New TSP construction heuristics and their relationships to the 2-Opt
Genetic algorithms for the traveling salesman problem
A class of exponential neighbourhoods for the quadratic travelling salesman problem
Embedded local search approaches for routing optimization
The traveling group problem
Exact solution of the soft-clustered vehicle-routing problem
Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems
Bounded-degree plane geometric spanners in practice
TRAVELING SALESMAN PROBLEM OF SEGMENTS
Title not available (Why is that?)
Provably good solutions for the traveling salesman problem
The Approximation Ratio of the k-Opt Heuristic for the Euclidean Traveling Salesman Problem
Heuristics for a cash-collection routing problem with a cluster-first route-second approach
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
The approximation ratio of the 2-Opt heuristic for the metric traveling salesman problem

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

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