A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
type: Item
instance of: scholarly article
title: A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
zbMATH Open document ID: 1458.90565
author: Xingyin Wang
author: Bruce Golden
author: Edward Wasil
published in: Computers \& Operations Research
publication date: 2018-12-03T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6988105
zbMATH Keywords: traveling salesman
zbMATH Keywords: Steiner zone
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: heuristic
describes a project that uses: TSPLIB
describes a project that uses: Gurobi
MaRDI profile type: Publication
full work available at URL: j.cor.2018.07.023
OpenAlex ID: W2884583022
cites work: An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
cites work: A novel discretization scheme for the close enough traveling salesman problem
cites work: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
cites work: Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem
cites work: Q3447238
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
cites work: A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
DOI: 10.1016/J.COR.2018.07.023
description: scientific article; zbMATH DE number 6988105