A tabu search with geometry‐based sparsification methods for angular traveling salesman problems

DOI10.1002/net.22180OpenAlexW4385879241MaRDI QIDQ6180041

No author found.

Publication date: 18 January 2024

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22180

zbMATH Keywords

granular tabu searchangleDistanceTSPangleTSPangular TSPssparsification methods

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Designing granular solution methods for routing problems with time windows
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• Granular tabu search for the pickup and delivery problem with time windows and electric vehicles
• Geometric and LP-based heuristics for angular travelling salesman problems in the plane
• The symmetric quadratic traveling salesman problem
• An efficient algorithm for determining the convex hull of a finite planar set
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• Discrete optimization methods to determine trajectories for Dubins' vehicles
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Tabu Search—Part I
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• The Angular-Metric Traveling Salesman Problem
• Traveling Salesperson Problems for the Dubins Vehicle
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• Minimization and maximization versions of the quadratic travelling salesman problem

This page was built for publication: A tabu search with geometry‐based sparsification methods for angular traveling salesman problems