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