A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
type: Item
instance of: scholarly article
title: A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
zbMATH Open document ID: 1374.90332
author: Peng Zhang
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6811919
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: arbitrary neighbourhoods
zbMATH Keywords: boundary-based encoding scheme
zbMATH Keywords: hybrid algorithm
zbMATH Keywords: close-enough
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.07.024
OpenAlex ID: W2734835295
cites work: Approximation algorithms for the Geometric Covering Salesman Problem
cites work: An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
cites work: TSP with neighborhoods of varying size
cites work: A novel discretization scheme for the close enough traveling salesman problem
cites work: Genetic algorithms and traveling salesman problems
cites work: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
cites work: A model for warehouse order picking
cites work: Approximation algorithms for TSP with neighborhoods in the plane
cites work: Q3447238
cites work: Genetic Algorithms and the Optimal Allocation of Trials
cites work: Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
cites work: Thirty years of heterogeneous vehicle routing
cites work: Parameter setting in evolutionary algorithms.
cites work: Q4945516
cites work: Q4382646
cites work: The Euclidean traveling salesman problem is NP-complete
cites work: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
cites work: Some polynomially solvable subcases of the detailed routing problem in VLSI design
cites work: Q4694752
cites work: Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network
cites work: A two-dimensional mapping for the traveling salesman problem
cites work: An empirical study of a new metaheuristic for the traveling salesman problem
cites work: Q5171587
DOI: 10.1016/J.EJOR.2017.07.024
description: scientific article; zbMATH DE number 6811919