A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem

DOI10.1016/j.cor.2018.07.023zbMath1458.90565OpenAlexW2884583022MaRDI QIDQ1628059

Xingyin Wang, Bruce L. Golden, Edward A. Wasil

Publication date: 3 December 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2018.07.023

zbMATH Keywords

traveling salesmanheuristicvariable neighborhood searchSteiner zone

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (6)

A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance ⋮ Results for the close-enough traveling salesman problem with a branch-and-bound algorithm ⋮ The generalized close enough traveling salesman problem ⋮ An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem ⋮ Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims ⋮ Multi-visit drone routing problem

Uses Software

• TSPLIB
• Gurobi

Cites Work

• Unnamed Item
• A novel discretization scheme for the close enough traveling salesman problem
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
• Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem